QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#44008 | #4545. Triangle Game | Cfer# | AC ✓ | 49ms | 3596kb | C++17 | 780b | 2022-08-12 09:15:44 | 2022-08-12 09:15:47 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<cmath>
#include<bitset>
#include<cmath>
#define int long long
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define kd ios::sync_with_stdio(false);cin.tie();cout.tie(0);
using namespace std;
typedef pair<int,int>pi;
const int N=2e6+100,mod=1e9+7,INF=1e10;
int lowbit(int x){return x&-x;}
int gcd(int a,int b){return a%b==0?b:gcd(b,a%b);}
void solve()
{
int a,b,c;cin>>a>>b>>c;
int res=0;
res^=(a-1);
res^=(b-1);
res^=(c-1);
if(res)cout<<"Win"<<endl;
else cout<<"Lose"<<endl;
}
signed main()
{
kd;
int _;_=1;
cin>>_;
while(_--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 49ms
memory: 3596kb
input:
10000 1 1 1 1 2 2 1 3 3 1 4 4 1 5 5 1 6 6 1 7 7 1 8 8 1 9 9 1 10 10 1 11 11 1 12 12 1 13 13 1 14 14 1 15 15 1 16 16 1 17 17 1 18 18 1 19 19 1 20 20 2 1 2 2 2 1 2 2 2 2 2 3 2 3 2 2 3 3 2 3 4 2 4 3 2 4 4 2 4 5 2 5 4 2 5 5 2 5 6 2 6 5 2 6 6 2 6 7 2 7 6 2 7 7 2 7 8 2 8 7 2 8 8 2 8 9 2 9 8 2 9 9 2 9 10 2...
output:
Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win Win Win Lose Lose Win Win ...
result:
ok 10000 lines