Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
2015(M2)Mod.
//g++ 7.4.0 #include <iostream> using namespace std; /*bool subperfect(int n) { int s = 0; for(int i = 2; i < n; i ++) { if(n % i == 0) { s = s + i; } } if(n < s) { return true; } else { return false; } } int main() { int a, b, c = 0; cin>>a>>b; for(int i = b; i >= a; i--) { if(subperfect(i)) { cout<<i<<" "; c++; } } if(c == 0) { cout<<"Nu exista"; } }*/ /*int main() { int n, i, c = 0; cin>>n; int v[n]; for(i = 0; c < n; i++) { if(i % 3 != 0 && i % 2 != 0) { v[c] = i; c++; } } for(i = c - 1; i >= 0; i--) { cout<<v[i]<<" "; } }*/ int main() { int n, i; cin>>n; int v[1000]; int ind_a = 0; int a[ind_a]; for(i = 0; i < 1000; i ++) { cin>>v[i]; } for(i = 0; i < 1000; i ++) { if(v[i]) } }
run
|
edit
|
history
|
help
0
მატრიცა
override
typedef char*
lab17feb22x4B.cpp
Make Bin Tree
unordered_map
Best way for getting more precision no.
Sort row sorted matrix
frndclass
BintTree vertical sum