| Task: | Neliöt |
| Sender: | |
| Submission time: | 2015-12-20 13:19:48 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.17 s | 1 | details |
| #2 | WRONG ANSWER | 0.20 s | 2 | details |
| #3 | WRONG ANSWER | 0.29 s | 3 | details |
Code
#include <iostream>
#include <algorithm>
using namespace std;
int main () {
int n;
cin>>n;
for (int i = 0; i < n; i++) {
int a, b, c, d;
cin>>a>>b>>c>>d;
int v[] = {a, b, c, d};
sort(v, v + 4);
int w = v[2];
int h = v[3] - v[2];
if ((v[0] == w && v[0] + v[1] == h) || (v[0] == h && v[0] + v[1] == w)) cout<<"10-4"<<endl;
else cout<<"QAQ"<<endl;
}
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 100000 6 9 3 3 1 3 1 1 3 3 6 9 2 2 4 4 ... |
| correct output |
|---|
| 10-4 10-4 10-4 10-4 QAQ ... |
| user output |
|---|
| 10-4 10-4 10-4 QAQ QAQ ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 100000 270 90 90 90 372 914 438 84 304 152 152 304 238 238 714 238 ... |
| correct output |
|---|
| 10-4 QAQ 10-4 10-4 10-4 ... |
| user output |
|---|
| 10-4 QAQ QAQ 10-4 10-4 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 821863964 821863964 821863964 ... |
| correct output |
|---|
| 10-4 10-4 QAQ 10-4 10-4 ... |
| user output |
|---|
| QAQ 10-4 QAQ QAQ 10-4 ... |