Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Buenos Amigos
//g++ 5.4.0 #include <iostream> using namespace std; int main() { int casos,n,res; cin>>casos; while(casos--){ cin>>n; res=((n-1)*(n-2))/2; cout<<res<<"\n"; } }
run
|
edit
|
history
|
help
0
getline vs cin
Bucket Graph Creation
Template arguments pack
Microsoft - MaxEmployeeAttendence (R repititions - Semi Optimised DP)
Project Euler - 113
Building squares using smallest amount of matches
ExceptionHandling4
Ploshtina na krug
dijkstra
1163. Last Substring in Lexicographical Order