QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#561822 | #8674. Riddle of the Sphinx | Starrykiller | WA | 0ms | 3648kb | C++23 | 871b | 2024-09-13 11:07:46 | 2024-09-13 11:07:46 |
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;
cout<<"1 1 0"<<endl; cin>>a;
cout<<"0 1 1"<<endl; cin>>b;
cout<<"1 0 1"<<endl; cin>>c;
cout<<"1 1 1"<<endl; cin>>d;
cout<<"1 0 0"<<endl; cin>>e;
if (a+b+c==d*2) {
int A=d-b;
int B=d-c;
int C=d-a;
// assert(A!=e);
cerr<<5;
cout<<A<<" "<<B<<' '<<C<<'\n';
// return 0;
}
if (e+(d-c)!=a) {
cerr<<1;
cout<<e<<" "<<d-c<<' '<<d-a<<'\n';
}
if (d-e!=b) {
cerr<<2;
cout<<e<<' '<<d-c<<' '<<d-a<<'\n';
}
if (e+(d-a)!=c) {
cerr<<3;
cout<<e<<" "<<e+d-a<<" "<<d-a<<'\n';
}
if (a+b+c!=d*2) {
cerr<<4;
cout<<e<<" "<<a-e<<' '<<c-e<<'\n';
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
3 5 4 6 1
output:
1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 2 3
result:
ok correct!
Test #2:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
9999 2 9999 10000 9998
output:
1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 9998 1 1
result:
ok correct!
Test #3:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
6666 6666 6666 9999 3333
output:
1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 3333 3333 3333
result:
ok correct!
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3636kb
input:
1395 1215 1605 2108 893
output:
1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 893 503 713 893 1606 713 893 502 712
result:
wrong answer read