Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
pattern
#include<iostream> using namespace std; int main(){ int i,j,k,ar[6]; for(i=0;i<5;i++){ k=i+1; cout<<"\n"; for(j=0;j<5;j++){ if(i>=j){ if(j==0) cout<<k<<" "; else{ k=k+(5-j); cout<<k<<" "; } } } } }
run
|
edit
|
history
|
help
0
akshitha
Const Return Test
Anagrams WIP
Merge problem
lab17feb22x4B.cpp
Microsoft - MaxEmployeeAttendence (R repititions - DP solution bitmask)
Equilateral triangle
HotelVec
segmentedSieveR
Test 6(2020)