Submission #345773
Source Code Expand
#include <iostream> #include <array> #include <algorithm> #include <set> using namespace std; int main() { int N; cin >> N; set<int> s; for( int i = 0; i < N; i++ ) { int v; cin >> v; while ( v % 2 == 0 ) { v /= 2; } s.insert( v ); } cout << s.size() << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | xyz600 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 306 Byte |
Status | AC |
Exec Time | 181 ms |
Memory | 5420 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 | 24 ms | 792 KB |
subtask0_1.txt | AC | 23 ms | 668 KB |
subtask0_2.txt | AC | 25 ms | 920 KB |
subtask1_0.txt | AC | 27 ms | 1060 KB |
subtask1_1.txt | AC | 26 ms | 1056 KB |
subtask1_10.txt | AC | 24 ms | 1060 KB |
subtask1_11.txt | AC | 25 ms | 932 KB |
subtask1_12.txt | AC | 26 ms | 1056 KB |
subtask1_13.txt | AC | 26 ms | 920 KB |
subtask1_14.txt | AC | 28 ms | 856 KB |
subtask1_15.txt | AC | 27 ms | 868 KB |
subtask1_16.txt | AC | 26 ms | 928 KB |
subtask1_17.txt | AC | 28 ms | 940 KB |
subtask1_18.txt | AC | 27 ms | 1048 KB |
subtask1_19.txt | AC | 27 ms | 928 KB |
subtask1_2.txt | AC | 25 ms | 1048 KB |
subtask1_3.txt | AC | 27 ms | 932 KB |
subtask1_4.txt | AC | 26 ms | 932 KB |
subtask1_5.txt | AC | 25 ms | 932 KB |
subtask1_6.txt | AC | 26 ms | 860 KB |
subtask1_7.txt | AC | 26 ms | 936 KB |
subtask1_8.txt | AC | 27 ms | 1052 KB |
subtask1_9.txt | AC | 26 ms | 924 KB |
subtask2_0.txt | AC | 110 ms | 5408 KB |
subtask2_1.txt | AC | 128 ms | 4644 KB |
subtask2_2.txt | AC | 124 ms | 4636 KB |
subtask2_3.txt | AC | 151 ms | 4648 KB |
subtask2_4.txt | AC | 133 ms | 4700 KB |
subtask2_5.txt | AC | 136 ms | 4652 KB |
subtask2_6.txt | AC | 145 ms | 4648 KB |
subtask2_7.txt | AC | 143 ms | 4648 KB |
subtask2_8.txt | AC | 141 ms | 4640 KB |
subtask2_9.txt | AC | 133 ms | 4644 KB |
subtask3_0.txt | AC | 109 ms | 5416 KB |
subtask3_1.txt | AC | 167 ms | 5416 KB |
subtask3_2.txt | AC | 155 ms | 5416 KB |
subtask3_3.txt | AC | 161 ms | 5420 KB |
subtask3_4.txt | AC | 158 ms | 5420 KB |
subtask3_5.txt | AC | 150 ms | 5412 KB |
subtask3_6.txt | AC | 181 ms | 5412 KB |
subtask3_7.txt | AC | 165 ms | 5408 KB |
subtask3_8.txt | AC | 158 ms | 5416 KB |
subtask3_9.txt | AC | 158 ms | 5420 KB |