Submission #7221124
Source Code Expand
/* これを入れて実行 g++ code.cpp ./a.out */ #include <iostream> #include <vector> #include <string> #include <queue> #include <deque> #include <algorithm> #include <utility> #include <set> #include <map> #include <cmath> #include <math.h> #include <tuple> #include <iomanip> using namespace std; typedef long long ll; typedef long double ld; int dy4[4] = {-1, 0, +1, 0}; int dx4[4] = {0, +1, 0, -1}; int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1}; const long long INF = 1LL << 60; const ll MOD = 1e9 + 7; bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){ return f.second > s.second; } ll gcd(ll a, ll b){ if (b == 0)return a; return gcd(b, a % b); } ll lcm(ll a, ll b){ return a / gcd(a, b) * b; } ll nCr(ll n, ll r){ if(r == 0 || r == n){ return 1; } else if(r == 1){ return n; } return (nCr(n - 1, r) + nCr(n - 1, r - 1)); } ll nPr(ll n, ll r){ r = n - r; ll ret = 1; for (ll i = n; i >= r + 1; i--) ret *= i; return ret; } //-----------------------ここから----------- int main(void){ int n; cin >> n; vector<int> a(n); for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++){ while(a[i] % 2 == 0){ a[i] /= 2; } } set<int> ans; for(int i = 0; i < n; i++){ ans.insert(a[i]); } cout << ans.size() << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | kt88 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1532 Byte |
Status | AC |
Exec Time | 71 ms |
Memory | 5376 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 | 3 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 | 53 ms | 5376 KB |
subtask2_1.txt | AC | 59 ms | 4480 KB |
subtask2_2.txt | AC | 59 ms | 4608 KB |
subtask2_3.txt | AC | 59 ms | 4608 KB |
subtask2_4.txt | AC | 59 ms | 4480 KB |
subtask2_5.txt | AC | 59 ms | 4608 KB |
subtask2_6.txt | AC | 59 ms | 4480 KB |
subtask2_7.txt | AC | 59 ms | 4608 KB |
subtask2_8.txt | AC | 59 ms | 4608 KB |
subtask2_9.txt | AC | 59 ms | 4608 KB |
subtask3_0.txt | AC | 54 ms | 5376 KB |
subtask3_1.txt | AC | 70 ms | 5376 KB |
subtask3_2.txt | AC | 70 ms | 5376 KB |
subtask3_3.txt | AC | 71 ms | 5376 KB |
subtask3_4.txt | AC | 71 ms | 5376 KB |
subtask3_5.txt | AC | 71 ms | 5376 KB |
subtask3_6.txt | AC | 70 ms | 5376 KB |
subtask3_7.txt | AC | 71 ms | 5376 KB |
subtask3_8.txt | AC | 70 ms | 5376 KB |
subtask3_9.txt | AC | 71 ms | 5376 KB |