Submission #347879
Source Code Expand
#include <iostream> #include <set> using namespace std; #define LL long long int main(){ set<LL> kind; int n; cin >> n; while (n--){ LL a; cin >> a; while ((a & 1) == 0) a >>= 1; kind.insert(a); } cout << kind.size() << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | b1na_3u |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 256 Byte |
Status | AC |
Exec Time | 168 ms |
Memory | 6160 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 | 51 ms | 1424 KB |
subtask0_1.txt | AC | 33 ms | 1436 KB |
subtask0_2.txt | AC | 32 ms | 1424 KB |
subtask1_0.txt | AC | 38 ms | 1552 KB |
subtask1_1.txt | AC | 34 ms | 1568 KB |
subtask1_10.txt | AC | 34 ms | 1552 KB |
subtask1_11.txt | AC | 34 ms | 1568 KB |
subtask1_12.txt | AC | 35 ms | 1640 KB |
subtask1_13.txt | AC | 34 ms | 1552 KB |
subtask1_14.txt | AC | 33 ms | 1616 KB |
subtask1_15.txt | AC | 32 ms | 1624 KB |
subtask1_16.txt | AC | 34 ms | 1512 KB |
subtask1_17.txt | AC | 35 ms | 1568 KB |
subtask1_18.txt | AC | 36 ms | 1552 KB |
subtask1_19.txt | AC | 34 ms | 1516 KB |
subtask1_2.txt | AC | 34 ms | 1572 KB |
subtask1_3.txt | AC | 34 ms | 1616 KB |
subtask1_4.txt | AC | 36 ms | 1552 KB |
subtask1_5.txt | AC | 34 ms | 1552 KB |
subtask1_6.txt | AC | 33 ms | 1616 KB |
subtask1_7.txt | AC | 33 ms | 1624 KB |
subtask1_8.txt | AC | 33 ms | 1620 KB |
subtask1_9.txt | AC | 34 ms | 1516 KB |
subtask2_0.txt | AC | 128 ms | 6116 KB |
subtask2_1.txt | AC | 142 ms | 5436 KB |
subtask2_2.txt | AC | 143 ms | 5328 KB |
subtask2_3.txt | AC | 144 ms | 5324 KB |
subtask2_4.txt | AC | 142 ms | 5268 KB |
subtask2_5.txt | AC | 143 ms | 5396 KB |
subtask2_6.txt | AC | 142 ms | 5328 KB |
subtask2_7.txt | AC | 142 ms | 5352 KB |
subtask2_8.txt | AC | 142 ms | 5352 KB |
subtask2_9.txt | AC | 142 ms | 5328 KB |
subtask3_0.txt | AC | 135 ms | 6156 KB |
subtask3_1.txt | AC | 165 ms | 6092 KB |
subtask3_2.txt | AC | 165 ms | 6156 KB |
subtask3_3.txt | AC | 165 ms | 6160 KB |
subtask3_4.txt | AC | 164 ms | 6096 KB |
subtask3_5.txt | AC | 165 ms | 6100 KB |
subtask3_6.txt | AC | 166 ms | 6160 KB |
subtask3_7.txt | AC | 166 ms | 6092 KB |
subtask3_8.txt | AC | 165 ms | 6160 KB |
subtask3_9.txt | AC | 168 ms | 6124 KB |