QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#605665#9107. Zayin and Countjiangzhihui#RE 0ms0kbC++14441b2024-10-02 18:26:082024-10-02 18:26:09

Judging History

This is the latest submission verdict.

  • [2024-10-02 18:26:09]
  • Judged
  • Verdict: RE
  • Time: 0ms
  • Memory: 0kb
  • [2024-10-02 18:26:08]
  • Submitted

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;
}

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 ...

output:


result: