Submission #2180626
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<algorithm> using namespace std; int N; int a[10]; int index(int n, int m) { int a = 1; for (int i = 0; i < n - 1; ++i) { a *= m; } return a; } int main() { cin >> N; int allV = 1, even=1; for (int i = 0; i < N; ++i) { cin >> a[i]; allV *= 3; if (a[i] % 2 == 0) even*=2; } cout << allV - even << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Similar Arrays |
User | hamray |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 418 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 | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |