Submission #1408646
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #define maxn 55 using namespace std; long long dp[maxn][2]; int n,p; int a[maxn]; int main(){ cin >> n >> p; for(int i = 1; i <= n; i++) cin >> a[i]; dp[0][0] = 1; for(int i = 1; i <= n; i++){ for(int j = 0; j <= 1; j++){ dp[i][(j + a[i]) % 2] += dp[i-1][j]; dp[i][j] += dp[i-1][j]; } } cout << dp[n][p] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | chenxiaoyu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 420 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
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 |