Submission #348076
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}
int a[100000];
int main() {
int n;
while(cin >> n) {
inputs(a,n);
set<int> S;
REP(i,n) {
int x = a[i];
while(x%2==0) x>>=1;
S.insert(x);
}
cout << S.size() << endl;
}
}
Submission Info
Submission Time |
|
Task |
C - 高橋くんと魔法の箱 |
User |
sune2 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2435 Byte |
Status |
AC |
Exec Time |
136 ms |
Memory |
6880 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 |
39 ms |
1768 KB |
subtask0_1.txt |
AC |
39 ms |
1900 KB |
subtask0_2.txt |
AC |
41 ms |
1724 KB |
subtask1_0.txt |
AC |
41 ms |
1904 KB |
subtask1_1.txt |
AC |
39 ms |
1896 KB |
subtask1_10.txt |
AC |
40 ms |
1976 KB |
subtask1_11.txt |
AC |
41 ms |
1848 KB |
subtask1_12.txt |
AC |
39 ms |
1896 KB |
subtask1_13.txt |
AC |
40 ms |
1896 KB |
subtask1_14.txt |
AC |
40 ms |
1896 KB |
subtask1_15.txt |
AC |
41 ms |
1896 KB |
subtask1_16.txt |
AC |
44 ms |
2032 KB |
subtask1_17.txt |
AC |
41 ms |
1892 KB |
subtask1_18.txt |
AC |
38 ms |
1900 KB |
subtask1_19.txt |
AC |
39 ms |
2020 KB |
subtask1_2.txt |
AC |
39 ms |
1900 KB |
subtask1_3.txt |
AC |
40 ms |
1892 KB |
subtask1_4.txt |
AC |
38 ms |
1900 KB |
subtask1_5.txt |
AC |
41 ms |
1880 KB |
subtask1_6.txt |
AC |
40 ms |
1888 KB |
subtask1_7.txt |
AC |
41 ms |
1892 KB |
subtask1_8.txt |
AC |
41 ms |
1892 KB |
subtask1_9.txt |
AC |
40 ms |
1892 KB |
subtask2_0.txt |
AC |
85 ms |
6760 KB |
subtask2_1.txt |
AC |
113 ms |
5996 KB |
subtask2_2.txt |
AC |
113 ms |
5996 KB |
subtask2_3.txt |
AC |
116 ms |
5992 KB |
subtask2_4.txt |
AC |
107 ms |
5996 KB |
subtask2_5.txt |
AC |
115 ms |
5988 KB |
subtask2_6.txt |
AC |
111 ms |
5992 KB |
subtask2_7.txt |
AC |
118 ms |
5996 KB |
subtask2_8.txt |
AC |
103 ms |
5996 KB |
subtask2_9.txt |
AC |
112 ms |
5996 KB |
subtask3_0.txt |
AC |
84 ms |
6760 KB |
subtask3_1.txt |
AC |
122 ms |
6880 KB |
subtask3_2.txt |
AC |
119 ms |
6760 KB |
subtask3_3.txt |
AC |
123 ms |
6764 KB |
subtask3_4.txt |
AC |
122 ms |
6760 KB |
subtask3_5.txt |
AC |
127 ms |
6760 KB |
subtask3_6.txt |
AC |
126 ms |
6840 KB |
subtask3_7.txt |
AC |
126 ms |
6764 KB |
subtask3_8.txt |
AC |
136 ms |
6848 KB |
subtask3_9.txt |
AC |
130 ms |
6756 KB |