Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
half diamond or pyramid
#include<bits/stdc++.h> using namespace std; int main() { int i,j,no; cin>>no; for(i=1;i<=no;i++) { for(j=1;j<=2*no-1;j++) { if(j>=no-(i-1) and j<=no+(i-1)) {cout<<"*";} else{cout<<" ";} } cout<<endl; } return 0; }
run
|
edit
|
history
|
help
1
Least missing num
FAK MEN
Diferenciacion e integracion beta 0.1
override
replace_copy-30-Seconds-of-C++
Web Browser History - DLL
Member function detection
Microsoft - MaxEmployeeAttendence (R repititions - Semi Optimised DP)
Counting top students
005#