Kolikot

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 < 1000000000; 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 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER