QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #49855 | #3828. László Babai | ckiseki# | AC ✓ | 2ms | 3680kb | C++ | 444b | 2022-09-23 17:00:18 | 2022-09-23 17:00:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int t; cin >> t;
while (t--) {
int m1; cin >> m1;
for (int i = 0 ;i < m1; ++i) {
int a,b; cin >> a >> b;
}
int m2; cin >> m2;
for (int i = 0 ;i < m2; ++i) {
int a,b; cin >> a >> b;
}
cout << ((m1 == m2) ? "yes" : "no") << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3680kb
input:
100 1 2 3 2 1 3 1 2 3 1 2 2 3 1 3 3 1 3 1 2 3 2 1 3 2 0 2 1 2 3 2 3 3 2 1 3 2 1 1 3 2 2 3 1 3 2 0 1 3 2 0 0 1 3 2 2 2 3 3 1 0 1 2 3 2 3 2 1 3 2 3 1 3 2 3 1 3 2 1 2 3 3 3 1 2 3 2 1 3 1 2 3 2 3 1 0 2 1 3 2 3 2 2 1 3 2 0 0 2 3 2 1 3 0 2 1 3 1 2 1 1 3 0 0 2 2 3 1 2 3 2 3 3 1 1 2 1 1 2 0 2 1 2 1 3 2 2 3 ...
output:
no yes no no no no yes no no yes yes no yes yes no no yes no no yes no no no yes no yes yes yes no no no no no no yes no yes yes no yes no yes no no no no yes no no yes no no no no yes no no yes no no no no yes yes no yes no no no no yes yes no yes no no no no yes yes no no no no no no yes no no yes...
result:
ok 100 lines