Submission #6906683


Source Code Expand

Copy
#include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>

using ll = long long;
using namespace std;

int main() {
    int n = 0;
    cin >> n;
    vector<ll> a(n);
    for (int i=0; i<n; i++) {
        cin >> a.at(i);
    }
    for (ll &x : a) {
        while (x%2 == 0) {
            x /= 2;
        }
    }
    sort(a.begin(), a.end());
    a.erase(unique(a.begin(), a.end()), a.end());
    cout << a.size() << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User shunail
Language C++14 (GCC 5.4.1)
Score 100
Code Size 616 Byte
Status
Exec Time 50 ms
Memory 1024 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 20 / 20 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 30 / 30 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 50 / 50 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 2 ms 256 KB
subtask0_1.txt 1 ms 256 KB
subtask0_2.txt 1 ms 256 KB
subtask1_0.txt 2 ms 256 KB
subtask1_1.txt 3 ms 256 KB
subtask1_10.txt 2 ms 256 KB
subtask1_11.txt 3 ms 256 KB
subtask1_12.txt 3 ms 256 KB
subtask1_13.txt 3 ms 256 KB
subtask1_14.txt 3 ms 256 KB
subtask1_15.txt 3 ms 256 KB
subtask1_16.txt 3 ms 256 KB
subtask1_17.txt 3 ms 256 KB
subtask1_18.txt 3 ms 256 KB
subtask1_19.txt 3 ms 256 KB
subtask1_2.txt 3 ms 256 KB
subtask1_3.txt 3 ms 256 KB
subtask1_4.txt 3 ms 256 KB
subtask1_5.txt 3 ms 256 KB
subtask1_6.txt 3 ms 256 KB
subtask1_7.txt 3 ms 256 KB
subtask1_8.txt 2 ms 256 KB
subtask1_9.txt 3 ms 256 KB
subtask2_0.txt 32 ms 1024 KB
subtask2_1.txt 39 ms 1024 KB
subtask2_2.txt 39 ms 1024 KB
subtask2_3.txt 39 ms 1024 KB
subtask2_4.txt 39 ms 1024 KB
subtask2_5.txt 39 ms 1024 KB
subtask2_6.txt 39 ms 1024 KB
subtask2_7.txt 39 ms 1024 KB
subtask2_8.txt 39 ms 1024 KB
subtask2_9.txt 39 ms 1024 KB
subtask3_0.txt 32 ms 1024 KB
subtask3_1.txt 47 ms 1024 KB
subtask3_2.txt 47 ms 1024 KB
subtask3_3.txt 48 ms 1024 KB
subtask3_4.txt 47 ms 1024 KB
subtask3_5.txt 47 ms 1024 KB
subtask3_6.txt 48 ms 1024 KB
subtask3_7.txt 50 ms 1024 KB
subtask3_8.txt 47 ms 1024 KB
subtask3_9.txt 47 ms 1024 KB