Submission #855293


Source Code Expand

Copy
#include <cstdio>
#include <algorithm>
using namespace std;
long long int knapsack[50][3000]={};
long long int ans=0;
int main(){
	int n,a,t;
	knapsack[0][0]=1;
	scanf("%d %d",&n,&a);
	for(int i=1;i<=n;i++){
		scanf("%d",&t);
		for(int k=i-1;k>=0;k--){
			for(int j=2500;j>=t;j--){
				knapsack[k+1][j]+=knapsack[k][j-t];
			}
		}
	}
	for(int i=1;i<=n;i++)
		ans+=knapsack[i][a*i];
	printf("%lld",ans);
}

Submission Info

Submission Time
Task C - Tak and Cards
User VoSK
Language C++14 (GCC 5.4.1)
Score 200
Code Size 424 Byte
Status RE
Exec Time 960 ms
Memory 1280 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&a);
                      ^
./Main.cpp:11:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&t);
                 ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 4
AC × 12
AC × 18
RE × 6
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 256 KB
example_02.txt AC 2 ms 256 KB
example_03.txt AC 3 ms 384 KB
example_04.txt AC 6 ms 896 KB
subtask1_01.txt AC 3 ms 512 KB
subtask1_02.txt AC 3 ms 512 KB
subtask1_03.txt AC 3 ms 512 KB
subtask1_04.txt AC 3 ms 512 KB
subtask1_05.txt AC 3 ms 512 KB
subtask1_06.txt AC 2 ms 128 KB
subtask1_07.txt AC 2 ms 128 KB
subtask1_08.txt AC 3 ms 512 KB
subtask1_09.txt AC 3 ms 512 KB
subtask2_01.txt RE 960 ms 1280 KB
subtask2_02.txt RE 199 ms 1280 KB
subtask2_03.txt AC 9 ms 1280 KB
subtask2_04.txt RE 197 ms 1280 KB
subtask2_05.txt RE 195 ms 1280 KB
subtask2_06.txt RE 200 ms 1280 KB
subtask2_07.txt RE 199 ms 1280 KB
subtask2_08.txt AC 6 ms 896 KB
subtask2_09.txt AC 6 ms 896 KB
subtask2_10.txt AC 7 ms 1152 KB
subtask2_11.txt AC 7 ms 1152 KB