Submission #6909433
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,a) for(int i = 0; i < (a); i++) #define ALL(a) (a).begin(),(a).end() typedef long long ll; typedef pair<int, int> P; const int INF = 1e9; const int MOD = 1e9 + 7; signed main(){ int n; cin >> n; int a[n]; REP(i,n){ cin >> a[i]; } map<int, int> mp; int ans = 0; REP(i,n){ while(a[i] % 2 == 0){ a[i] /= 2; } if(mp[a[i]] == 0){ ans++; mp[a[i]]++; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | Dente |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 575 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 5376 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 | 3 ms | 384 KB |
subtask1_10.txt | AC | 2 ms | 384 KB |
subtask1_11.txt | AC | 3 ms | 384 KB |
subtask1_12.txt | AC | 3 ms | 384 KB |
subtask1_13.txt | AC | 3 ms | 384 KB |
subtask1_14.txt | AC | 3 ms | 384 KB |
subtask1_15.txt | AC | 3 ms | 384 KB |
subtask1_16.txt | AC | 3 ms | 384 KB |
subtask1_17.txt | AC | 3 ms | 384 KB |
subtask1_18.txt | AC | 3 ms | 384 KB |
subtask1_19.txt | AC | 3 ms | 384 KB |
subtask1_2.txt | AC | 3 ms | 384 KB |
subtask1_3.txt | AC | 3 ms | 384 KB |
subtask1_4.txt | AC | 3 ms | 384 KB |
subtask1_5.txt | AC | 3 ms | 384 KB |
subtask1_6.txt | AC | 3 ms | 384 KB |
subtask1_7.txt | AC | 3 ms | 384 KB |
subtask1_8.txt | AC | 3 ms | 384 KB |
subtask1_9.txt | AC | 3 ms | 384 KB |
subtask2_0.txt | AC | 69 ms | 5376 KB |
subtask2_1.txt | AC | 66 ms | 4480 KB |
subtask2_2.txt | AC | 66 ms | 4608 KB |
subtask2_3.txt | AC | 66 ms | 4608 KB |
subtask2_4.txt | AC | 66 ms | 4480 KB |
subtask2_5.txt | AC | 66 ms | 4608 KB |
subtask2_6.txt | AC | 66 ms | 4480 KB |
subtask2_7.txt | AC | 66 ms | 4608 KB |
subtask2_8.txt | AC | 66 ms | 4608 KB |
subtask2_9.txt | AC | 66 ms | 4608 KB |
subtask3_0.txt | AC | 70 ms | 5376 KB |
subtask3_1.txt | AC | 79 ms | 5376 KB |
subtask3_2.txt | AC | 79 ms | 5376 KB |
subtask3_3.txt | AC | 79 ms | 5376 KB |
subtask3_4.txt | AC | 79 ms | 5376 KB |
subtask3_5.txt | AC | 79 ms | 5376 KB |
subtask3_6.txt | AC | 79 ms | 5376 KB |
subtask3_7.txt | AC | 79 ms | 5376 KB |
subtask3_8.txt | AC | 79 ms | 5376 KB |
subtask3_9.txt | AC | 79 ms | 5376 KB |