QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#605687 | #9107. Zayin and Count | jiangzhihui# | RE | 0ms | 0kb | C++23 | 584b | 2024-10-02 18:36:56 | 2024-10-02 18:36:57 |
answer
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include <bits/Bingbong.h>
#endif
using namespace std;
#define i64 long long
#define pi acos(-1)
void solve() {
int cnt1 = 0;
for (int i = 1; i <= 10; i++) {
int x;
cin >> x;
if (x == 1) cnt1++;
}
assert(cnt1 >= 2);
int cnt2 = 0;
for (int i = 1; i <= 10; i++) {
int x;
cin >> x;
cnt2++;
}
assert(cnt2 >= 2);
i64 x;
cin >> x;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
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 ...