Submission #671415
Source Code Expand
#include <iostream> #include <set> using namespace std; int main() { int n; cin>>n; set<int> s; for(int i=0; i<n; ++i) { int a; cin>>a; s.insert(a); } set<int> f; for(int v: s) { for(int x=2*v; x<=*s.rbegin(); x*=2) if (s.count(x)) f.insert(x); } int res=0; for(int v: s) if (!f.count(v)) ++res; cout<<res<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | hogeover30 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 413 Byte |
Status | AC |
Exec Time | 196 ms |
Memory | 6428 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 | 31 ms | 1052 KB |
subtask0_1.txt | AC | 29 ms | 1048 KB |
subtask0_2.txt | AC | 27 ms | 924 KB |
subtask1_0.txt | AC | 30 ms | 1296 KB |
subtask1_1.txt | AC | 29 ms | 1180 KB |
subtask1_10.txt | AC | 29 ms | 1180 KB |
subtask1_11.txt | AC | 32 ms | 1180 KB |
subtask1_12.txt | AC | 31 ms | 1180 KB |
subtask1_13.txt | AC | 29 ms | 1176 KB |
subtask1_14.txt | AC | 31 ms | 1176 KB |
subtask1_15.txt | AC | 31 ms | 1176 KB |
subtask1_16.txt | AC | 30 ms | 1176 KB |
subtask1_17.txt | AC | 31 ms | 1180 KB |
subtask1_18.txt | AC | 29 ms | 1176 KB |
subtask1_19.txt | AC | 32 ms | 1176 KB |
subtask1_2.txt | AC | 32 ms | 1280 KB |
subtask1_3.txt | AC | 30 ms | 1176 KB |
subtask1_4.txt | AC | 31 ms | 1180 KB |
subtask1_5.txt | AC | 31 ms | 1176 KB |
subtask1_6.txt | AC | 31 ms | 1176 KB |
subtask1_7.txt | AC | 31 ms | 1180 KB |
subtask1_8.txt | AC | 29 ms | 1280 KB |
subtask1_9.txt | AC | 29 ms | 1172 KB |
subtask2_0.txt | AC | 165 ms | 5656 KB |
subtask2_1.txt | AC | 183 ms | 6424 KB |
subtask2_2.txt | AC | 185 ms | 6424 KB |
subtask2_3.txt | AC | 186 ms | 6420 KB |
subtask2_4.txt | AC | 182 ms | 6428 KB |
subtask2_5.txt | AC | 184 ms | 6428 KB |
subtask2_6.txt | AC | 192 ms | 6424 KB |
subtask2_7.txt | AC | 185 ms | 6424 KB |
subtask2_8.txt | AC | 185 ms | 6424 KB |
subtask2_9.txt | AC | 184 ms | 6428 KB |
subtask3_0.txt | AC | 159 ms | 5652 KB |
subtask3_1.txt | AC | 191 ms | 5660 KB |
subtask3_2.txt | AC | 192 ms | 5764 KB |
subtask3_3.txt | AC | 193 ms | 5660 KB |
subtask3_4.txt | AC | 191 ms | 5660 KB |
subtask3_5.txt | AC | 189 ms | 5656 KB |
subtask3_6.txt | AC | 189 ms | 5684 KB |
subtask3_7.txt | AC | 191 ms | 5656 KB |
subtask3_8.txt | AC | 193 ms | 5720 KB |
subtask3_9.txt | AC | 196 ms | 5656 KB |