Code Submission Evaluation System Login

Datatähti 2019 alku

Start:2018-10-01 00:00:00
End:2018-10-15 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2019 alku - Results
History
2018-10-07 02:35:23100
2018-10-07 02:33:520
2018-10-06 14:48:05100
2018-10-06 14:37:5348
2018-10-04 19:12:050
Task:Kolikot
Sender:DevBonBon
Submission time:2018-10-07 02:35:23
Language:Java
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED23
#2ACCEPTED25
#3ACCEPTED52

Test results

testverdicttime (s)group
#1ACCEPTED0.22 / 1.001details
#2ACCEPTED0.23 / 1.001details
#3ACCEPTED0.26 / 1.001details
#4ACCEPTED0.28 / 1.001details
#5ACCEPTED0.28 / 1.001details
#6ACCEPTED0.26 / 1.001details
#7ACCEPTED0.26 / 1.001details
#8ACCEPTED0.27 / 1.001details
#9ACCEPTED0.27 / 1.001details
#10ACCEPTED0.26 / 1.001details
#11ACCEPTED0.27 / 1.002details
#12ACCEPTED0.26 / 1.002details
#13ACCEPTED0.26 / 1.002details
#14ACCEPTED0.27 / 1.002details
#15ACCEPTED0.27 / 1.002details
#16ACCEPTED0.27 / 1.002details
#17ACCEPTED0.26 / 1.002details
#18ACCEPTED0.26 / 1.002details
#19ACCEPTED0.26 / 1.002details
#20ACCEPTED0.27 / 1.002details
#21ACCEPTED0.27 / 1.003details
#22ACCEPTED0.26 / 1.003details
#23ACCEPTED0.27 / 1.003details
#24ACCEPTED0.27 / 1.003details
#25ACCEPTED0.29 / 1.003details
#26ACCEPTED0.33 / 1.003details
#27ACCEPTED0.38 / 1.003details
#28ACCEPTED0.45 / 1.003details
#29ACCEPTED0.50 / 1.003details
#30ACCEPTED0.49 / 1.003details

Code

import java.util.Scanner;

public class Datatahti_kolikot {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        //Read input, we should only ever get numbers, so no datatype checks here
        //NOTE: so yeah, 10^9 is such a large number, that it doesn't really work with the function
        //bellow, so we need to use a long
        Scanner input = new Scanner(System.in);
        long amount = input.nextInt();

        //We use the trianlge number formula Tn = ..., and solve it for 'n'
        //Casting to int always rounds down to the closest whole number
        int piles = (int) (-1 + Math.sqrt(1 - 4 * (-amount * 2))) / 2;
        //Output the number of most amount of pile we can have
        System.out.println(piles);

        //Easiest? way to give example piles, is just go up from 1 until the sum would be larger
        //than the amount of coins given
        int sum = 0;
        for (int i = 1; i < piles; i++) {
            sum += i;
            System.out.print(i + " ");
        }
        //Finally we output the final number for out example,
        //which is whatever is left from the amount of coins - the sum we got from the loop above
        System.out.println(amount - sum);

        //I think there might be a bit more efficient way of doing this by using the triangle number
        //sum funvtion, but what i have works as is, so I won't waste time on it now
//        int n = (piles * (piles + 1)) / 2;
//        System.out.println("\n\n" + n);
    }
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1
view   save

correct output
1
1
view   save

user output
1
1
view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
2
view   save

correct output
1
2
view   save

user output
1
2
view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
3
view   save

correct output
2
1 2
view   save

user output
2
1 2
view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
4
view   save

correct output
2
1 3
view   save

user output
2
1 3
view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
5
view   save

correct output
2
1 4
view   save

user output
2
1 4
view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
6
view   save

correct output
3
1 2 3
view   save

user output
3
1 2 3
view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
7
view   save

correct output
3
1 2 4
view   save

user output
3
1 2 4
view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
8
view   save

correct output
3
1 2 5
view   save

user output
3
1 2 5
view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
9
view   save

correct output
3
1 2 6
view   save

user output
3
1 2 6
view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
10
view   save

correct output
4
1 2 3 4
view   save

user output
4
1 2 3 4
view   save

Test 11

Group: 2

Verdict: ACCEPTED

input
11
view   save

correct output
4
1 2 3 5
view   save

user output
4
1 2 3 5
view   save

Test 12

Group: 2

Verdict: ACCEPTED

input
54
view   save

correct output
9
1 2 3 4 5 6 7 8 18
view   save

user output
9
1 2 3 4 5 6 7 8 18
view   save

Test 13

Group: 2

Verdict: ACCEPTED

input
55
view   save

correct output
10
1 2 3 4 5 6 7 8 9 10
view   save

user output
10
1 2 3 4 5 6 7 8 9 10
view   save

Test 14

Group: 2

Verdict: ACCEPTED

input
56
view   save

correct output
10
1 2 3 4 5 6 7 8 9 11
view   save

user output
10
1 2 3 4 5 6 7 8 9 11
view   save

Test 15

Group: 2

Verdict: ACCEPTED

input
123
view   save

correct output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 16

Group: 2

Verdict: ACCEPTED

input
819
view   save

correct output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 17

Group: 2

Verdict: ACCEPTED

input
820
view   save

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 18

Group: 2

Verdict: ACCEPTED

input
821
view   save

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 19

Group: 2

Verdict: ACCEPTED

input
999
view   save

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 20

Group: 2

Verdict: ACCEPTED

input
1000
view   save

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 21

Group: 3

Verdict: ACCEPTED

input
1274
view   save

correct output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 22

Group: 3

Verdict: ACCEPTED

input
1275
view   save

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 23

Group: 3

Verdict: ACCEPTED

input
1276
view   save

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 24

Group: 3

Verdict: ACCEPTED

input
12345
view   save

correct output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 25

Group: 3

Verdict: ACCEPTED

input
123456
view   save

correct output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 26

Group: 3

Verdict: ACCEPTED

input
10000000
view   save

correct output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 27

Group: 3

Verdict: ACCEPTED

input
100000000
view   save

correct output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 28

Group: 3

Verdict: ACCEPTED

input
500000000
view   save

correct output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 29

Group: 3

Verdict: ACCEPTED

input
999999999
view   save

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 30

Group: 3

Verdict: ACCEPTED

input
1000000000
view   save

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save