Submission #5543822
Source Code Expand
#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f3f3f3f3fLL
#define rep(i,a,b) for(register ll i=(a);i<=(b);i++)
#define dep(i,a,b) for(register ll i=(a);i>=(b);i--)
using namespace std;
const int maxn=50+5;
const int maxm=5000+5;
//const double pi=acos(-1.0);
//const double eps=1e-9;
const ll mo=1e9+7;
int n,m,k;
int a[maxn];
int ans,tmp,cnt;
ll dp[maxn][2510];
char s[maxn];
ll power(ll a,ll n)
{
ll sum=1;
while(n)
{
if(n&1) sum=sum*a%mo;
n>>=1;
a=a*a%mo;
}
return sum;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
int sum=0;
rep(i,1,n)
{
scanf("%d",&a[i]);
sum+=a[i];
}
memset(dp,-1,sizeof(dp));
dp[0][0]=1;
rep(i,1,n)
{
dep(k,i-1,0)
dep(j,sum,a[i])
if(dp[k][j-a[i]]!=-1){
dp[k+1][j]=max(dp[k+1][j],0LL);
dp[k+1][j]+=dp[k][j-a[i]];
//if(j==18)
//cout<<k<<" * "<<i<<" "<<dp[k][j-a[i]]<<endl;
}
}
//rep(i,1,n)
//rep(j,0,sum)
//cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
ll ans=0;
rep(i,1,n)
if(i*m<=sum&&dp[i][i*m]>0){
ans+=dp[i][i*m];
//cout<<i<<" "<<i*m<<" "<<dp[i][i*m]<<endl;
}
printf("%lld\n",ans);
}
return 0;
}
Submission Info
Submission Time
2019-05-22 16:45:41+0900
Task
C - Tak and Cards
User
IGVA
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
1458 Byte
Status
AC
Exec Time
4 ms
Memory
1280 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:35:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[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
1280 KB
example_02.txt
AC
2 ms
1280 KB
example_03.txt
AC
2 ms
1280 KB
example_04.txt
AC
2 ms
1280 KB
subtask1_01.txt
AC
2 ms
1280 KB
subtask1_02.txt
AC
2 ms
1280 KB
subtask1_03.txt
AC
2 ms
1280 KB
subtask1_04.txt
AC
2 ms
1280 KB
subtask1_05.txt
AC
2 ms
1280 KB
subtask1_06.txt
AC
2 ms
1280 KB
subtask1_07.txt
AC
2 ms
1280 KB
subtask1_08.txt
AC
2 ms
1280 KB
subtask1_09.txt
AC
2 ms
1280 KB
subtask2_01.txt
AC
3 ms
1280 KB
subtask2_02.txt
AC
3 ms
1280 KB
subtask2_03.txt
AC
3 ms
1280 KB
subtask2_04.txt
AC
4 ms
1280 KB
subtask2_05.txt
AC
4 ms
1280 KB
subtask2_06.txt
AC
2 ms
1280 KB
subtask2_07.txt
AC
3 ms
1280 KB
subtask2_08.txt
AC
2 ms
1280 KB
subtask2_09.txt
AC
2 ms
1280 KB
subtask2_10.txt
AC
3 ms
1280 KB
subtask2_11.txt
AC
3 ms
1280 KB