Submission #1408946
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=50+5;
int a[maxn],A,B;
int n,p;
ll c[maxn][maxn];
void yanghui()
{
c[0][0]=1;
c[1][0]=c[1][1]=1;
for(int i=2;i<maxn;i++)
{
c[i][0]=c[i][i]=1;
for(int j=1;j<i;j++) c[i][j]=c[i-1][j-1]+c[i-1][j];
}
/* for(int i=1;i<maxn;i++)
{
for(int j=0;j<=i;j++){
printf("%8lld ",c[i][j]);
}puts("");
}*/
}
ll C(int i,int j) {return c[i][j];}
int main()
{
// freopen("1.out","w",stdout);
scanf("%d%d",&n,&p);
yanghui();
for(int i=1;i<=n;i++) {scanf("%d",&a[i]);A+=(a[i]%2==1),B+=(a[i]%2==0);}
if(p==1){
ll ans=0;
int lim=A%2==1?A:A-1;
for(int i=1;i<=lim;i+=2)
for(int j=0;j<=B;j++)
ans+=C(B,j)*C(A,i);
printf("%lld\n",ans);
}else{
ll ans=0;
int lim=A%2==0?A:A-1;
for(int i=0;i<=lim;i+=2)
for(int j=0;j<=B;j++)
ans+=C(B,j)*C(A,i);
printf("%lld\n",ans);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Biscuits |
User |
owarisunezeko |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1114 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:28:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&p);
^
./Main.cpp:30:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++) {scanf("%d",&a[i]);A+=(a[i]%2==1),B+=(a[i]%2==0);}
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All |
sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
AC |
1 ms |
256 KB |
in2.txt |
AC |
1 ms |
256 KB |
in3.txt |
AC |
1 ms |
256 KB |
in4.txt |
AC |
1 ms |
256 KB |
in5.txt |
AC |
1 ms |
256 KB |
in6.txt |
AC |
1 ms |
256 KB |
in7.txt |
AC |
1 ms |
256 KB |
in8.txt |
AC |
1 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |
sample4.txt |
AC |
1 ms |
256 KB |