Submission #3004189
Source Code Expand
#include<iostream> #include<algorithm> #include<math.h> #include<set> #include<vector> #include<map> #include<functional> #include<iomanip> #include<queue> #include<random> #include<numeric> #include<string> #include<stack> #include<cstring> typedef long long ll; typedef long double ld; using namespace std; ll dx[] = { 0,0,1,-1 }; ll dy[] = { 1,-1,0,0 }; ll gcd(ll a, ll b) { if (a<b) { return gcd(b, a); } else if (a%b) { return gcd(b, a%b); } else { return b; } } ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } int main() { ll N; cin >> N; ll a[N]; ll ans = 1; for (ll i = 0; i < N; i++) { cin >> a[i]; if (a[i] % 2 == 0) { ans *= 2; } } ll sum = 1; for (ll i = 0; i < N; i++) { sum *= 3; } cout << sum - ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Similar Arrays |
User | sintan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 793 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 |