Codeforces Round #770 (Div. 2) 1634B. Fortune Telling Solution




 Solution in C++: 

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    long long  t,n,x,y,i,s,a;
    cin>>t;
    while(t--)
    {
        cin>>n>>x>>y;
        s=x;
        for(i=0; i<n; i++)
        {
            cin>>a;
            s+=a;
        }
        if(s%2==y%2)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<"\n";
    }
    return 0;
}

No comments

Most View Post

Recent post

Codeforces Round 971 (Div. 4) 2009C. The Legend of Freya the Frog Solution

  Problem Link    https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h &g...

Powered by Blogger.