Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
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
Display all prime numbers upto N without sieve
cast operator
26 და 28 მარტს დამუშავებული
scuba
data locality - slow example
HashTable
задача new
gp series
bc
shell sort