- #include <bits/stdc++.h>
- using namespace std;
- int solve(){
- int n;
- cin>>n;
- int nim = 0;
- for(int i = 0; i < n; ++i){
- int a,b;cin>>a>>b;
- nim ^= (b-a-1);
- }
- return nim;
- }
- int main(){
- int tc;
- cin>>tc;
- for(int i = 0; i < tc; ++i){
- int ans = solve();
- if(ans) cout<<"Case "<<(i+1)<<": "<<"Alice"<<endl;
- else cout<<"Case "<<(i+1)<<": "<<"Bob"<<endl;
- }
- return 0;
- }
Thursday 27 July 2017
Lightoj 1192 Left right
Subscribe to:
Post Comments (Atom)
Most Featured Post
Lightoj 1159 - Batman
http://lightoj.com/volume_showproblem.php?problem=1159 problem analysis: First i thought of this as if s1, s2 and s3 are those three str...
-
Problem link: Problem Analysis: It is actually a basic Bisection problem , as we can see here we can not actually find a formula fo...
-
http://lightoj.com/volume_showproblem.php?problem=1382 Problem analysis: This is a rare problem i wrote about so far. After much strugg...
No comments:
Post a Comment