Submission #2715798
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int a = sc.nextInt(); int[] x = new int[n]; for(int i = 0 ; i < n ; i++) x[i] = sc.nextInt(); int[][][] dp = new int[51][51][2501]; dp[0][0][0] = 1; for(int i = 0 ; i <= n ; i++) { for(int j = 0 ; j <= n ; j++) { for(int k = 0 ; k <= 2500 ; k++) { if(i >= 1) dp[i][j][k] = dp[i - 1][j][k]; if(i >= 1 && j >= 1 && k - x[i - 1] >= 0) dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - x[i - 1]]; } } } long ans = 0; for(int i = 1 ; i <= n ; i++) ans += (long)dp[n][i][i * a]; System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | kouta1612 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 726 Byte |
Status | WA |
Exec Time | 205 ms |
Memory | 54612 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 0 / 100 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt, example_03.txt, example_04.txt |
Subtask1 | example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
All | example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 120 ms | 50644 KB |
example_02.txt | AC | 107 ms | 47956 KB |
example_03.txt | AC | 125 ms | 50132 KB |
example_04.txt | AC | 144 ms | 49484 KB |
subtask1_01.txt | AC | 124 ms | 50644 KB |
subtask1_02.txt | AC | 124 ms | 51668 KB |
subtask1_03.txt | AC | 122 ms | 51408 KB |
subtask1_04.txt | AC | 123 ms | 52564 KB |
subtask1_05.txt | AC | 123 ms | 49360 KB |
subtask1_06.txt | AC | 107 ms | 54484 KB |
subtask1_07.txt | AC | 103 ms | 50004 KB |
subtask1_08.txt | AC | 122 ms | 49620 KB |
subtask1_09.txt | AC | 124 ms | 49232 KB |
subtask2_01.txt | WA | 165 ms | 54612 KB |
subtask2_02.txt | AC | 164 ms | 52564 KB |
subtask2_03.txt | WA | 166 ms | 52432 KB |
subtask2_04.txt | WA | 168 ms | 51924 KB |
subtask2_05.txt | AC | 167 ms | 47828 KB |
subtask2_06.txt | AC | 205 ms | 50388 KB |
subtask2_07.txt | AC | 204 ms | 50644 KB |
subtask2_08.txt | AC | 145 ms | 50388 KB |
subtask2_09.txt | AC | 158 ms | 50644 KB |
subtask2_10.txt | AC | 154 ms | 50004 KB |
subtask2_11.txt | WA | 155 ms | 51664 KB |