Submission #1366277
Source Code Expand
#include "iostream" #include "climits" #include "list" #include "queue" #include "stack" #include "set" #include "functional" #include "algorithm" #include "math.h" #include "utility" #include "string" #include "map" #include "unordered_map" #include "iomanip" #include "random" using namespace std; const long long int MOD = 1000000007; list<long long int> Prime(int M) { list<long long int>P; P.push_back(2); P.push_back(3); for (int i = 5; i <= M; i += 6) { bool flag = true; for (auto j : P) { if (i%j == 0) { flag = false; break; } } if (flag)P.push_back(i); flag = true; for (auto j : P) { if ((i + 2) % j == 0) { flag = false; break; } } if (flag)P.push_back(i + 2); } return P; } long long int power(long long int x, long long int n, long long int M) { long long int tmp = 1; if (n > 0) { tmp = power(x, n / 2, M); if (n % 2 == 0) tmp = (tmp*tmp) % M; else tmp = (((tmp*tmp) % M)*x) % M; } return tmp; } long long int N, M, K, Q, W, H; long long int ans; int main() { ios::sync_with_stdio(false); cin >> N; set <int>s; for (int i = 0; i < N; i++) { int a; cin >> a; while (a % 2 == 0)a /= 2; s.insert(a); } cout << s.size() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | olphe |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1299 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 30 / 30 | 50 / 50 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 | subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 | subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 2 ms | 384 KB |
subtask1_1.txt | AC | 2 ms | 384 KB |
subtask1_10.txt | AC | 2 ms | 384 KB |
subtask1_11.txt | AC | 2 ms | 384 KB |
subtask1_12.txt | AC | 2 ms | 384 KB |
subtask1_13.txt | AC | 2 ms | 384 KB |
subtask1_14.txt | AC | 2 ms | 384 KB |
subtask1_15.txt | AC | 2 ms | 384 KB |
subtask1_16.txt | AC | 2 ms | 384 KB |
subtask1_17.txt | AC | 2 ms | 384 KB |
subtask1_18.txt | AC | 2 ms | 384 KB |
subtask1_19.txt | AC | 2 ms | 384 KB |
subtask1_2.txt | AC | 2 ms | 384 KB |
subtask1_3.txt | AC | 2 ms | 384 KB |
subtask1_4.txt | AC | 2 ms | 384 KB |
subtask1_5.txt | AC | 2 ms | 384 KB |
subtask1_6.txt | AC | 2 ms | 384 KB |
subtask1_7.txt | AC | 2 ms | 384 KB |
subtask1_8.txt | AC | 2 ms | 384 KB |
subtask1_9.txt | AC | 2 ms | 384 KB |
subtask2_0.txt | AC | 32 ms | 4992 KB |
subtask2_1.txt | AC | 38 ms | 4224 KB |
subtask2_2.txt | AC | 38 ms | 4224 KB |
subtask2_3.txt | AC | 38 ms | 4224 KB |
subtask2_4.txt | AC | 39 ms | 4224 KB |
subtask2_5.txt | AC | 38 ms | 4224 KB |
subtask2_6.txt | AC | 38 ms | 4224 KB |
subtask2_7.txt | AC | 38 ms | 4224 KB |
subtask2_8.txt | AC | 38 ms | 4224 KB |
subtask2_9.txt | AC | 38 ms | 4224 KB |
subtask3_0.txt | AC | 32 ms | 4992 KB |
subtask3_1.txt | AC | 42 ms | 4992 KB |
subtask3_2.txt | AC | 42 ms | 4992 KB |
subtask3_3.txt | AC | 43 ms | 4992 KB |
subtask3_4.txt | AC | 42 ms | 4992 KB |
subtask3_5.txt | AC | 43 ms | 4992 KB |
subtask3_6.txt | AC | 42 ms | 4992 KB |
subtask3_7.txt | AC | 42 ms | 4992 KB |
subtask3_8.txt | AC | 42 ms | 4992 KB |
subtask3_9.txt | AC | 42 ms | 4992 KB |