Submission #5498086
Source Code Expand
#include <algorithm> #include <iostream> #include <iomanip> #include <cstring> #include <cstdlib> #include <utility> #include <cstdio> #include <vector> #include <string> #include <queue> #include <stack> #include <cmath> #include <set> #include <map> using ll = long long; using namespace std; int main() { int n; cin >> n; int a[n], b[n]; int ans = 0; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (int i = n; i >= 0; i--) { for (int j = 0; j < n; j++) { if ((a[i] + j) / b[i] == 0) { ans = ans + j; } } } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | umeboshi123 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 594 Byte |
Status | RE |
Exec Time | 215 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | RE | 199 ms | 1024 KB |
02.txt | RE | 201 ms | 1024 KB |
03.txt | RE | 200 ms | 1024 KB |
04.txt | RE | 200 ms | 1024 KB |
05.txt | RE | 200 ms | 1024 KB |
06.txt | RE | 201 ms | 1024 KB |
07.txt | RE | 167 ms | 1024 KB |
08.txt | RE | 206 ms | 1024 KB |
09.txt | RE | 165 ms | 1024 KB |
10.txt | RE | 206 ms | 1024 KB |
11.txt | RE | 165 ms | 1024 KB |
12.txt | RE | 132 ms | 1024 KB |
13.txt | RE | 167 ms | 1024 KB |
14.txt | RE | 215 ms | 1024 KB |
15.txt | RE | 98 ms | 256 KB |
16.txt | RE | 96 ms | 256 KB |
s1.txt | RE | 97 ms | 256 KB |
s2.txt | RE | 97 ms | 256 KB |