Submission #1409279
Source Code Expand
#include<iostream> // 入出力 #include<stdio.h> // printf()が使える小数は%fで #include<math.h> // 数学の関数 #include<vector> // 配列 #include<string> // 文字列 #include<map> // 連想配列 #include<stack> // スタック #include<queue> // キュー #include<algorithm> // ソートとか using namespace std; int main() { int N; cin >> N; int P; cin >> P; int ki = 0, gu = 0; for (int i = 0; i < N; ++i) { int A; cin >> A; if (A % 2 == 0) { ++gu; } else { ++ki; } } long long int ans = 1; if (P == 0) { for (int i = 0; i < gu; ++i) { ans *= 2; } int psum = 0; for (int i = 0; i <= ki; i += 2) { int p = 1; for (int j = 1; j <= i; ++j) { p = p*(ki - j + 1) / j; } psum += p; } ans *= psum; } else { for (int i = 0; i < gu; ++i) { ans *= 2; } int psum = 0; for (int i = 1; i <= ki; i += 2) { int p = 1; for (int j = 1; j <= i; ++j) { p = p*(ki - j + 1) / j; } psum += p; } ans *= psum; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | mori08 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1121 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 |