Submission #1125755
Source Code Expand
# coding: utf-8 n = int(input()) a = [] b = [] for i in range(n): nums = [int(x) for x in input().split(" ")] a.append(nums[0]) b.append(nums[1]) botton, i = 0, -1 while i > -1 - n: if a[i] % b[i] == 0: i -= 1 continue else: botton += 1 for j in range(i, -n-1, -1): a[j] += 1 print(botton)
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | khanda610 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 372 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 11048 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 | TLE | 2104 ms | 10996 KB |
02.txt | TLE | 2104 ms | 10996 KB |
03.txt | TLE | 2104 ms | 10996 KB |
04.txt | TLE | 2104 ms | 10996 KB |
05.txt | TLE | 2104 ms | 10996 KB |
06.txt | TLE | 2104 ms | 10996 KB |
07.txt | AC | 322 ms | 7876 KB |
08.txt | TLE | 2104 ms | 10952 KB |
09.txt | AC | 334 ms | 7776 KB |
10.txt | TLE | 2104 ms | 11048 KB |
11.txt | AC | 345 ms | 10996 KB |
12.txt | AC | 320 ms | 4752 KB |
13.txt | TLE | 2104 ms | 10996 KB |
14.txt | AC | 337 ms | 11020 KB |
15.txt | AC | 17 ms | 3064 KB |
16.txt | AC | 17 ms | 3060 KB |
s1.txt | AC | 17 ms | 3064 KB |
s2.txt | AC | 17 ms | 3064 KB |