| Task: | Kasat |
| Sender: | |
| Submission time: | 2015-09-13 13:34:23 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | 21 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.33 s | 1 | details |
| #2 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import java.util.Arrays;
import java.util.Scanner;
public class Kasat {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
final int testejä = input.nextInt();
int k[][] = new int[testejä][3];
for (int t = 0 ; t<testejä ; t++){
// Haetaan arvot
k[t][0] = input.nextInt();
k[t][1] = input.nextInt();
k[t][2] = input.nextInt();
int kierroksia = input.nextInt();
// kierrokset
for (int n = 0; n<kierroksia; n++){
Arrays.sort(k[t]);
k[t][2] = k[t][2]-1;
k[t][0] = k[t][0]+1;
}
// järjestys lopuksi
Arrays.sort(k[t]);
}
// Tulostetaan kaikki arvot
for (int t = 0; t<testejä; t++){
System.out.println(k[t][0] + " " + k[t][1] + " " + k[t][2]);
}
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 1000 7 69 64 45 37 5 30 81 50 49 37 38 46 37 100 6 ... |
| correct output |
|---|
| 46 47 47 24 24 24 45 45 46 43 46 94 32 32 33 ... |
| user output |
|---|
| 46 47 47 24 24 24 45 45 46 43 46 94 32 32 33 ... |
Test 2
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 19 13 88 978977859 67 57 39 960003440 81 16 67 971611942 92 96 2 957979201 ... |
| correct output |
|---|
| 39 40 41 54 54 55 54 55 55 63 63 64 36 37 38 ... |
| user output |
|---|
| (empty) |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 211358104 753479603 549127067 ... |
| correct output |
|---|
| 504654924 504654925 504654925 589019272 589019272 589019273 101309993 101309994 101309994 436205296 436205297 436205298 351062567 351062568 351062568 ... |
| user output |
|---|
| (empty) |
