Submission #1074375
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; int[] b = new int[n]; int[] count = new int[n]; int sum = 0; for (int i = 0; i < n; i++) { a[i] = sc.nextInt(); b[i] = sc.nextInt(); } for (int i = n - 1; i >= 0; i--) { while (a[i] % b[i] != 0) { for(int j = 0; j <= i; j++) { a[j]++; } count[i]++; } sum += count[i]; } System.out.println(sum); } }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | Nomoya5 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 601 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 49812 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 | 2106 ms | 49348 KB |
02.txt | TLE | 2106 ms | 49108 KB |
03.txt | TLE | 2106 ms | 49024 KB |
04.txt | TLE | 2106 ms | 49076 KB |
05.txt | TLE | 2106 ms | 48796 KB |
06.txt | TLE | 2106 ms | 49812 KB |
07.txt | AC | 600 ms | 49336 KB |
08.txt | TLE | 2106 ms | 48904 KB |
09.txt | AC | 596 ms | 48812 KB |
10.txt | TLE | 2106 ms | 48896 KB |
11.txt | AC | 611 ms | 48560 KB |
12.txt | AC | 541 ms | 49140 KB |
13.txt | TLE | 2106 ms | 48628 KB |
14.txt | AC | 659 ms | 49132 KB |
15.txt | AC | 133 ms | 9552 KB |
16.txt | AC | 130 ms | 9672 KB |
s1.txt | AC | 129 ms | 9544 KB |
s2.txt | AC | 130 ms | 9552 KB |