Task: | Pussit |
Sender: | |
Submission time: | 2015-08-15 10:41:36 +0300 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.29 s | 1 | details |
#2 | WRONG ANSWER | 0.31 s | 2 | details |
#3 | WRONG ANSWER | 0.31 s | 3 | details |
Code
import java.util.*;public class pussit {public static void main(String[] args) {Scanner input = new Scanner(System.in);int kpl = input.nextInt();long n[] = new long[kpl];long m[] = new long[kpl];long k[] = new long[kpl];long tulos[] = new long[kpl];for (int i = 0; i < kpl; i++) {n[i] = input.nextLong();m[i] = input.nextLong();k[i] = input.nextLong();}// lasketaan, montako hutia voi tulla// tulokseen lisataan minimimaara klong ohi = 0;long jaannos = 0;for (int i = 0; i < kpl; i++) {jaannos = m[i] % n[i];ohi = n[i] - jaannos;if (jaannos == 0) ohi = 0;tulos[i] = ohi + k[i];}for (int i = 0; i < kpl; i++) {System.out.println(tulos[i]);}}}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
1000 11 16 2 5 16 15 2 14 14 9 11 1 ... |
correct output |
---|
2 15 14 1 1 ... |
user output |
---|
8 19 14 8 6 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 1436 3023 1378 4419 4559 3881 115 4220 1440 3556 3152 1653 ... |
correct output |
---|
1378 3881 1440 2057 5312 ... |
user output |
---|
2663 8160 1475 2057 6983 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
1000 337723917 939459738 544279388 233319567 486500388 164139442 722536320 995223331 969580610 274242146 994174001 844564432 ... |
correct output |
---|
544279388 164139442 1194505265 870263078 547470112 ... |
user output |
---|
617991401 377597755 1419429919 947359015 547470112 ... |