Submission #7335102
Source Code Expand
// #pragma GCC target("avx2") // CPU 処理並列化 // #pragma GCC optimize("O3") // CPU 処理並列化 // #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす #include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<deque> #include<stack> #include<string> #include<string.h> #include<vector> #include<set> #include<map> #include<bitset> #include<stdlib.h> #include<cassert> #include<time.h> #include<bitset> #include<numeric> using namespace std; const long long mod=1000000007; const long long inf=mod*mod; const long long d2=(mod+1)/2; const double EPS=1e-10; const double INF=1e+10; const double PI=acos(-1.0); const int C_SIZE = 3121000; namespace{ long long fact[C_SIZE]; long long finv[C_SIZE]; long long inv[C_SIZE]; long long Comb(int a,int b){ if(a<b||b<0)return 0; return fact[a]*finv[b]%mod*finv[a-b]%mod; } void init_C(int n){ fact[0]=finv[0]=inv[1]=1; for(int i=2;i<n;i++){ inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod; } for(int i=1;i<n;i++){ fact[i]=fact[i-1]*i%mod; finv[i]=finv[i-1]*inv[i]%mod; } } long long pw(long long a,long long b){ if(a<0LL)return 0; if(b<0LL)return 0; long long ret=1; while(b){ if(b%2)ret=ret*a%mod; a=a*a%mod; b/=2; } return ret; } int ABS(int a){return max(a,-a);} long long ABS(long long a){return max(a,-a);} double ABS(double a){return max(a,-a);} int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; } } // ここから編集しろ long long tmp[5100]; int main(){ int a;scanf("%d",&a); set<int>S; for(int i=0;i<a;i++){ int p;scanf("%d",&p);while(p%2==0)p/=2; S.insert(p); } printf("%d\n",S.size()); }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | tozangezan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1753 Byte |
Status | AC |
Exec Time | 45 ms |
Memory | 4864 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:72:24: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘std::set<int>::size_type {aka long unsigned int}’ [-Wformat=] printf("%d\n",S.size()); ^ ./Main.cpp:66:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int a;scanf("%d",&a); ^ ./Main.cpp:69:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int p;scanf("%d",&p);while(p%2==0)p/=2; ^
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 | 2 ms | 384 KB |
subtask1_12.txt | AC | 2 ms | 384 KB |
subtask1_13.txt | AC | 2 ms | 384 KB |
subtask1_14.txt | AC | 2 ms | 384 KB |
subtask1_15.txt | AC | 2 ms | 384 KB |
subtask1_16.txt | AC | 2 ms | 384 KB |
subtask1_17.txt | AC | 2 ms | 384 KB |
subtask1_18.txt | AC | 2 ms | 384 KB |
subtask1_19.txt | AC | 2 ms | 384 KB |
subtask1_2.txt | AC | 2 ms | 384 KB |
subtask1_3.txt | AC | 2 ms | 384 KB |
subtask1_4.txt | AC | 2 ms | 384 KB |
subtask1_5.txt | AC | 2 ms | 384 KB |
subtask1_6.txt | AC | 2 ms | 384 KB |
subtask1_7.txt | AC | 2 ms | 384 KB |
subtask1_8.txt | AC | 2 ms | 384 KB |
subtask1_9.txt | AC | 2 ms | 384 KB |
subtask2_0.txt | AC | 34 ms | 4864 KB |
subtask2_1.txt | AC | 41 ms | 4096 KB |
subtask2_2.txt | AC | 40 ms | 4096 KB |
subtask2_3.txt | AC | 41 ms | 4096 KB |
subtask2_4.txt | AC | 40 ms | 4096 KB |
subtask2_5.txt | AC | 40 ms | 4096 KB |
subtask2_6.txt | AC | 40 ms | 4096 KB |
subtask2_7.txt | AC | 40 ms | 4096 KB |
subtask2_8.txt | AC | 40 ms | 4096 KB |
subtask2_9.txt | AC | 40 ms | 4096 KB |
subtask3_0.txt | AC | 35 ms | 4864 KB |
subtask3_1.txt | AC | 44 ms | 4864 KB |
subtask3_2.txt | AC | 44 ms | 4864 KB |
subtask3_3.txt | AC | 44 ms | 4864 KB |
subtask3_4.txt | AC | 44 ms | 4864 KB |
subtask3_5.txt | AC | 45 ms | 4864 KB |
subtask3_6.txt | AC | 45 ms | 4864 KB |
subtask3_7.txt | AC | 44 ms | 4864 KB |
subtask3_8.txt | AC | 45 ms | 4864 KB |
subtask3_9.txt | AC | 44 ms | 4864 KB |