CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:planckcons
Submission time:2016-10-04 10:40:37 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.12 s1details
#2ACCEPTED0.13 s1details
#30.15 s1details
#4ACCEPTED0.12 s1details
#50.13 s1details
#60.17 s2details
#7ACCEPTED0.15 s2details
#8ACCEPTED0.15 s2details
#90.16 s2details
#100.18 s2details
#110.54 s3details
#12ACCEPTED0.56 s3details
#13ACCEPTED0.63 s3details
#140.58 s3details
#150.56 s3details
#160.57 s3details

Code

import java.util.Scanner;

public class Kolikot {
    
    public static void main (String args[])
    {
        Scanner input = new Scanner(System.in);
        
        int[] set = new int[input.nextInt()];
        int n = set.length;
        
		for(int i : set)
		{
			set[i] = input.nextInt();
		}

        for(int i = 1; i < 1000000001; i++)
        {
            if (isSubsetSum(set, n, i) != true){
                System.out.println(i);
                break;
            }
        }
    }

    static boolean isSubsetSum(int set[], int n, int sum)
    {
        boolean subset[][] = new boolean[sum+1][n+1];

        for (int i = 0; i <= n; i++)
			subset[0][i] = true;

        for (int i = 1; i <= sum; i++)
            subset[i][0] = false;

        for (int i = 1; i <= sum; i++)
        {
			for (int j = 1; j <= n; j++)
			{
				subset[i][j] = subset[i][j-1];
				if (i >= set[j-1])
					subset[i][j] = subset[i][j] || subset[i - set[j-1]][j-1];
            }
        }
        return subset[sum][n];
    }
}

Test details

Test 1

Group: 1

Verdict:

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
1

Test 2

Group: 1

Verdict: ACCEPTED

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
1

Test 3

Group: 1

Verdict:

input
10
10 9 2 8 7 10 7 1 5 2

correct output
62

user output
1

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
1

Test 5

Group: 1

Verdict:

input
10
8 2 1 7 9 7 5 2 4 5

correct output
51

user output
1

Test 6

Group: 2

Verdict:

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
1

Test 7

Group: 2

Verdict: ACCEPTED

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
1

Test 9

Group: 2

Verdict:

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
1

Test 10

Group: 2

Verdict:

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
1

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
1

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
1

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
1

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
1

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
1