Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
series kv type 1
#include<iostream> #include<iomanip> using namespace std; int main() { int t; cin>>t; int a,b; while(t--) { int n; cin>>n; if(n%2==0) { a=(n/2)-1; cout<<a; } else { b=n-1; cout<<b; } if(t>0) { cout<<endl; } } }
run
|
edit
|
history
|
help
0
subset sum=k(dp)
wealth of banks
2015(M2)Simulare
TIME
Изволов#2
sorting using array and pointer
Treap for spoj : MEANARR (we can use policy based data structures instead)
Zahra_matrix
sort
grid