1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 | import java.io.BufferedReader; import java.io.FileNotFoundException; import java.io.FileReader; import java.io.IOException; import java.io.InputStreamReader; import java.math.BigInteger; import java.util.StringTokenizer; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int T = sc.nextInt(); for(int t = 0;t<T;t++){ int n = sc.nextInt(); int[] c = new int[n]; for(int i=0;i<n;i++){ c[i] = sc.nextInt(); } int g = sc.nextInt(); int[] dp = new int[g+1]; dp[0] = 1; for(int i=0;i<n;i++){ for(int j=c[i];j<=g;j++){ dp[j] += dp[j-c[i]]; } } System.out.println(dp[g]); } } } class FastScanner { BufferedReader br; StringTokenizer st; public FastScanner(String s) { try { br = new BufferedReader(new FileReader(s)); } catch (FileNotFoundException e) { throw new RuntimeException(e); } } public FastScanner() { br = new BufferedReader(new InputStreamReader(System.in)); } String nextToken() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(nextToken()); } long nextLong() { return Long.parseLong(nextToken()); } double nextDouble() { return Double.parseDouble(nextToken()); } String nextLine() { String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } } | cs |
'알고리즘' 카테고리의 다른 글
[11729번] 하노이 탑 이동 순서 (0) | 2017.08.13 |
---|---|
[11053번] 가장 긴 증가하는 부분 수열 (0) | 2017.08.13 |
[5598번] 카이사르 암호 (0) | 2017.08.13 |
[2616번] 소형기관차 (0) | 2017.08.13 |
[2609번] 최대공약수와 최소공배수 (0) | 2017.08.13 |