Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
3
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define mp make_pair #define pb push_back #define pii pair<int, int> int main(){ ios_base :: sync_with_stdio(0); cin.tie(0); int t; cin >> t; for(int i = 1; i <= t; i++){ cout << "Case #" << i << ": "; int n; cin >> n; vector<int> p(n+1, 0); for(int j = 0; j < n+1; j++) cin >> p[j]; if(n % 2 == 0){ cout << 0 << endl; } else{ cout << 1 << endl; cout << 0.0 << endl; } } return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
BinTree playground
Cuantos
Boost phoenix e.g. 1 no functor
Updated Linked Lists - 5/10/2017 V4.0
Cross Multiplication
scemo dd
Cyclically rotate an array by one
CPP - Ex 5
passing by reference vs passing by value
Dar
Please log in to post a comment.