Submission #1917524
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).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 chmin(x,y) (x=min(x,y)) #define chmax(x,y) (x=max(x,y)) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} int main(){ int n; cin>>n; set<int> s; rep(i, n){ int a; cin>>a; while(a%2==0) a>>=1; s.insert(a); } cout<<s.size()<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1308 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 4992 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 | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 2 ms | 384 KB |
subtask1_1.txt | AC | 2 ms | 384 KB |
subtask1_10.txt | AC | 2 ms | 384 KB |
subtask1_11.txt | AC | 3 ms | 384 KB |
subtask1_12.txt | AC | 3 ms | 384 KB |
subtask1_13.txt | AC | 3 ms | 384 KB |
subtask1_14.txt | AC | 3 ms | 384 KB |
subtask1_15.txt | AC | 3 ms | 384 KB |
subtask1_16.txt | AC | 3 ms | 384 KB |
subtask1_17.txt | AC | 3 ms | 384 KB |
subtask1_18.txt | AC | 3 ms | 384 KB |
subtask1_19.txt | AC | 3 ms | 384 KB |
subtask1_2.txt | AC | 3 ms | 384 KB |
subtask1_3.txt | AC | 3 ms | 384 KB |
subtask1_4.txt | AC | 3 ms | 384 KB |
subtask1_5.txt | AC | 3 ms | 384 KB |
subtask1_6.txt | AC | 3 ms | 384 KB |
subtask1_7.txt | AC | 3 ms | 384 KB |
subtask1_8.txt | AC | 3 ms | 384 KB |
subtask1_9.txt | AC | 3 ms | 384 KB |
subtask2_0.txt | AC | 54 ms | 4992 KB |
subtask2_1.txt | AC | 61 ms | 4096 KB |
subtask2_2.txt | AC | 62 ms | 4096 KB |
subtask2_3.txt | AC | 61 ms | 4224 KB |
subtask2_4.txt | AC | 61 ms | 4096 KB |
subtask2_5.txt | AC | 62 ms | 4096 KB |
subtask2_6.txt | AC | 61 ms | 4096 KB |
subtask2_7.txt | AC | 61 ms | 4096 KB |
subtask2_8.txt | AC | 62 ms | 4224 KB |
subtask2_9.txt | AC | 62 ms | 4096 KB |
subtask3_0.txt | AC | 55 ms | 4992 KB |
subtask3_1.txt | AC | 73 ms | 4992 KB |
subtask3_2.txt | AC | 73 ms | 4992 KB |
subtask3_3.txt | AC | 73 ms | 4992 KB |
subtask3_4.txt | AC | 73 ms | 4992 KB |
subtask3_5.txt | AC | 73 ms | 4992 KB |
subtask3_6.txt | AC | 73 ms | 4992 KB |
subtask3_7.txt | AC | 75 ms | 4992 KB |
subtask3_8.txt | AC | 73 ms | 4992 KB |
subtask3_9.txt | AC | 73 ms | 4992 KB |