Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
triangle_ isosceles
#include <iostream> using namespace std; int main () { int n; cin >> n; for (int i=1; i<=n; i++) { for (int j=1; j<=n+i-1; j++) if (j<=n-i) cout << " "; else cout << "^"; cout << endl; } return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Stack
Bin Tree build
pac update
Sum of digits of number
Widget Class with dynamic memory and pointers
k1
Day3
Interview Prep
Treap for spoj : MEANARR (we can use policy based data structures instead)
Backpack with recursion
stackse - search stackoverflow differently
Please log in to post a comment.