Submission #2833855
Source Code Expand
#include<bits/stdc++.h> const int INF = 1e9; const int MOD = 1e9+7; using LL = long long; const LL LINF = 1e18; using namespace std; #define COUT(v) cout<<(v)<<endl #define CIN(n) int(n);cin >> (n) #define LCIN(n) LL(n);cin >> (n) #define SCIN(n) string(n);cin >> (n) #define YES(n) cout<<((n)? "YES" : "NO")<<endl #define Yes(n) cout<<((n)? "Yes" : "No")<<endl #define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) <<endl #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define REPR(i,n) for(int i=n;i>=0;i--) #define FOREACH(x,a) for(auto& (x) : (a) ) #define ALL(obj) (obj).begin(),(obj).end() #define P pair<LL,LL> #define I vector<int> #define S set<int> #define pb(v) push_back(v) #define V vector #define rt return #define rmsame(a) sort(ALL(a)),a.erase(unique(ALL(a)), a.end()) typedef string::const_iterator State; class PalseError {}; class Edge{ public: LL from,to,value; Edge(LL a,LL b,LL c){ from = a; to = b; value = c; } Edge(LL a,LL b){ from = a; to = b; } }; int main(){ CIN(A);CIN(B); A /= 2; B /= 2; if(A == 0&&B == 0){ COUT("Alice"); return 0; } COUT(( A ^ B == 0 ? "Alice" : "Brown")); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Alice&Brown |
User | hamuhei4869 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1404 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00-00.txt, 00-01.txt, 00-02.txt, 00-03.txt |
All | 00-00.txt, 00-01.txt, 00-02.txt, 00-03.txt, 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-00.txt | AC | 1 ms | 256 KB |
00-01.txt | AC | 1 ms | 256 KB |
00-02.txt | WA | 1 ms | 256 KB |
00-03.txt | AC | 1 ms | 256 KB |
01-00.txt | WA | 1 ms | 256 KB |
01-01.txt | WA | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | WA | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
01-11.txt | AC | 1 ms | 256 KB |
01-12.txt | WA | 1 ms | 256 KB |
01-13.txt | AC | 1 ms | 256 KB |
01-14.txt | WA | 1 ms | 256 KB |
01-15.txt | AC | 1 ms | 256 KB |
01-16.txt | WA | 1 ms | 256 KB |
01-17.txt | AC | 1 ms | 256 KB |
01-18.txt | AC | 1 ms | 256 KB |
01-19.txt | AC | 1 ms | 256 KB |