QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#561796 | #8674. Riddle of the Sphinx | Starrykiller | WA | 1ms | 3688kb | C++23 | 909b | 2024-09-13 10:37:08 | 2024-09-13 10:37:09 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int bin[]={1,2,4,5,7};
int ans[5];
signed main() {
int a, b, c, d, e;
// for (int i=0; i<5; ++i) {
// if (ans[i]<0)
// }
cout<<"1 0 0"<<endl;
cin>>a;
cout<<"0 1 0"<<endl;
cin>>b;
cout<<"0 0 1"<<endl;
cin>>c;
cout<<"1 0 1"<<endl;
cin>>d;
cout<<"1 1 1"<<endl;
cin>>e;
// 1 is false
{
int A=d-c;
if (A+b+c==e) {
cout<<A<<" "<<b<<' '<<c;
return 0;
}
}
// 2 is false
{
int B=e-d;
if (a+B+c==e) {
cout<<a<<' '<<B<<' '<<c;
return 0;
}
}
// 3 is false
{
int C=d-a;
if (a+b+C==e) {
cout<<a<<' '<<b<<" "<<C;
return 0;
}
}
cout<<a<<' '<<b<<' '<<c;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3688kb
input:
1 2 3 4 6
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 1 2 3
result:
ok correct!
Test #2:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
9998 1 1 9999 10000
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 9998 1 1
result:
ok correct!
Test #3:
score: 0
Accepted
time: 1ms
memory: 3688kb
input:
3333 3333 3333 6666 9999
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 3333 3333 3333
result:
ok correct!
Test #4:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
892 503 712 1605 2108
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 893 503 712
result:
ok correct!
Test #5:
score: 0
Accepted
time: 1ms
memory: 3544kb
input:
868 365 947 1815 2182
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 868 367 947
result:
ok correct!
Test #6:
score: -100
Wrong Answer
time: 1ms
memory: 3600kb
input:
684 827 794 1477 2304
output:
1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 683 827 794
result:
wrong answer read