Submission #861841
Source Code Expand
Copy
#include <stdio.h> int N,A; int x[51]; long long int dp[51][5050]; int main(){ int i,j; int X; scanf("%d %d",&N,&A);X=A; for(i=1;i<=N;i++){ scanf("%d",&x[i]); if(X<x[i])X=x[i]; x[i]-=A; } dp[0][N*X]=1; for(i=1;i<=N;i++){ for(j=0;j<=2*N*X;j++){ dp[i][j]=dp[i-1][j]+dp[i-1][j-x[i]]; } } printf("%lld\n",dp[N][N*X]-1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | noteton |
Language | C (GCC 5.4.1) |
Score | 300 |
Code Size | 414 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 2176 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:8:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&N,&A);X=A; ^ ./Main.c:10:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&x[i]); ^
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 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 | 2 ms | 128 KB |
example_02.txt | AC | 2 ms | 128 KB |
example_03.txt | AC | 2 ms | 256 KB |
example_04.txt | AC | 2 ms | 384 KB |
subtask1_01.txt | AC | 2 ms | 384 KB |
subtask1_02.txt | AC | 2 ms | 384 KB |
subtask1_03.txt | AC | 2 ms | 384 KB |
subtask1_04.txt | AC | 2 ms | 384 KB |
subtask1_05.txt | AC | 2 ms | 384 KB |
subtask1_06.txt | AC | 2 ms | 128 KB |
subtask1_07.txt | AC | 2 ms | 128 KB |
subtask1_08.txt | AC | 3 ms | 384 KB |
subtask1_09.txt | AC | 2 ms | 384 KB |
subtask2_01.txt | AC | 5 ms | 2176 KB |
subtask2_02.txt | AC | 5 ms | 2176 KB |
subtask2_03.txt | AC | 5 ms | 2048 KB |
subtask2_04.txt | AC | 5 ms | 2176 KB |
subtask2_05.txt | AC | 8 ms | 2176 KB |
subtask2_06.txt | AC | 5 ms | 2176 KB |
subtask2_07.txt | AC | 5 ms | 2176 KB |
subtask2_08.txt | AC | 4 ms | 1152 KB |
subtask2_09.txt | AC | 3 ms | 1152 KB |
subtask2_10.txt | AC | 4 ms | 1664 KB |
subtask2_11.txt | AC | 4 ms | 1792 KB |