Submission #345217
Source Code Expand
#include <string> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <queue> #include <iostream> #include <sstream> #include <cstdio> #include <cmath> #include <ctime> #include <cstring> #include <cctype> #include <cassert> #include <limits> #include <functional> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll; template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int N; scanf("%d", &N); set<int> s; rep(i, N) { int a; scanf("%d", &a); while(a % 2 == 0) a /= 2; s.insert(a); } cout << s.size() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | anta |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1400 Byte |
Status | AC |
Exec Time | 149 ms |
Memory | 5552 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:40:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ./Main.cpp:44:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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 | 40 ms | 812 KB |
subtask0_1.txt | AC | 27 ms | 920 KB |
subtask0_2.txt | AC | 26 ms | 812 KB |
subtask1_0.txt | AC | 29 ms | 1004 KB |
subtask1_1.txt | AC | 26 ms | 1052 KB |
subtask1_10.txt | AC | 27 ms | 1052 KB |
subtask1_11.txt | AC | 27 ms | 1000 KB |
subtask1_12.txt | AC | 27 ms | 1000 KB |
subtask1_13.txt | AC | 27 ms | 1048 KB |
subtask1_14.txt | AC | 27 ms | 1052 KB |
subtask1_15.txt | AC | 28 ms | 1056 KB |
subtask1_16.txt | AC | 26 ms | 1012 KB |
subtask1_17.txt | AC | 27 ms | 1012 KB |
subtask1_18.txt | AC | 26 ms | 1008 KB |
subtask1_19.txt | AC | 28 ms | 988 KB |
subtask1_2.txt | AC | 28 ms | 1052 KB |
subtask1_3.txt | AC | 28 ms | 1000 KB |
subtask1_4.txt | AC | 27 ms | 1004 KB |
subtask1_5.txt | AC | 27 ms | 1048 KB |
subtask1_6.txt | AC | 30 ms | 932 KB |
subtask1_7.txt | AC | 29 ms | 996 KB |
subtask1_8.txt | AC | 28 ms | 1016 KB |
subtask1_9.txt | AC | 29 ms | 1048 KB |
subtask2_0.txt | AC | 81 ms | 5552 KB |
subtask2_1.txt | AC | 129 ms | 4724 KB |
subtask2_2.txt | AC | 123 ms | 4708 KB |
subtask2_3.txt | AC | 113 ms | 4724 KB |
subtask2_4.txt | AC | 110 ms | 4712 KB |
subtask2_5.txt | AC | 125 ms | 4676 KB |
subtask2_6.txt | AC | 132 ms | 4704 KB |
subtask2_7.txt | AC | 123 ms | 4716 KB |
subtask2_8.txt | AC | 112 ms | 4712 KB |
subtask2_9.txt | AC | 113 ms | 4704 KB |
subtask3_0.txt | AC | 80 ms | 5468 KB |
subtask3_1.txt | AC | 129 ms | 5484 KB |
subtask3_2.txt | AC | 133 ms | 5488 KB |
subtask3_3.txt | AC | 146 ms | 5480 KB |
subtask3_4.txt | AC | 124 ms | 5464 KB |
subtask3_5.txt | AC | 128 ms | 5544 KB |
subtask3_6.txt | AC | 128 ms | 5468 KB |
subtask3_7.txt | AC | 133 ms | 5484 KB |
subtask3_8.txt | AC | 149 ms | 5548 KB |
subtask3_9.txt | AC | 133 ms | 5488 KB |