Submission #1498660
Source Code Expand
#include <iostream> #define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++) using namespace std; typedef long long ll; ll N, A[100000]; int main(void) { cin >> N; REP(i, 0, N) cin >> A[i]; bool f = 0; ll odd = 0, n4 = 0; REP(i, 0, N) { if(A[i] % 4 == 0) n4++; else if(A[i] % 2 == 0) f = 1; else odd++; } cout << (odd + f <= n4 + 1 ? "Yes" : "No") << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 4-adjacent |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 412 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 40 ms | 1024 KB |
1_08.txt | AC | 40 ms | 1024 KB |
1_09.txt | AC | 40 ms | 1024 KB |
1_10.txt | AC | 40 ms | 1024 KB |
1_11.txt | AC | 40 ms | 1024 KB |
1_12.txt | AC | 40 ms | 1024 KB |
1_13.txt | AC | 40 ms | 1024 KB |