QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#605668 | #9107. Zayin and Count | jiangzhihui# | WA | 2ms | 3636kb | C++14 | 442b | 2024-10-02 18:26:49 | 2024-10-02 18:26:50 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
vector<int> b;
for (int i = 0; i < 10; i++) {
int x;
cin >> x;
}
for (int i = 0; i < 10; i++) {
int x;
cin >> x;
if (x == 1) b.push_back(i);
}
// assert(!b.empty());
unsigned long long x;
cin >> x;
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3636kb
input:
10000 1 0 0 0 1 1 0 0 0 1 0 0 1 0 1 1 1 1 0 0 950595954440050004054505054050 1 0 0 0 1 1 1 1 0 0 1 1 1 0 1 0 0 0 1 1 45467007076660767550460064 1 1 1 1 0 0 0 1 0 0 1 1 0 1 1 0 1 0 0 1 23373171320213300170200722 0 0 0 0 1 1 1 0 1 0 0 0 1 0 0 1 0 1 1 1 558565664666565565558468668484 1 1 0 0 1 0 1 0 1 ...
output:
result:
wrong answer 1st lines differ - expected: '52755244567262766742575722', found: ''