Submission #801380


Source Code Expand

#include<iostream>
#include<vector>
#include<stdio.h>
#include<algorithm>
#include<map>

using namespace std;

int main(){

    int N;
    cin>> N;
    vector<int> v;
    for(int i=0; i<N; i++){
        int a;
        scanf("%d", &a);
        v.push_back(a);
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());

    map<int, int> mp;

    for(auto x: v){
        while(x%2==0){
            x /= 2;
        }
        mp[x]++;
    }

    cout<< mp.size()<< endl;

    return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User ikd
Language C++11 (GCC 4.8.1)
Score 100
Code Size 531 Byte
Status AC
Exec Time 97 ms
Memory 6088 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
                        ^

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 50 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 43
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 29 ms 912 KB
subtask0_1.txt AC 28 ms 1040 KB
subtask0_2.txt AC 27 ms 1048 KB
subtask1_0.txt AC 30 ms 1180 KB
subtask1_1.txt AC 30 ms 1172 KB
subtask1_10.txt AC 30 ms 1284 KB
subtask1_11.txt AC 30 ms 1176 KB
subtask1_12.txt AC 28 ms 1168 KB
subtask1_13.txt AC 28 ms 1172 KB
subtask1_14.txt AC 28 ms 1280 KB
subtask1_15.txt AC 30 ms 1104 KB
subtask1_16.txt AC 30 ms 1168 KB
subtask1_17.txt AC 29 ms 1168 KB
subtask1_18.txt AC 31 ms 1272 KB
subtask1_19.txt AC 31 ms 1172 KB
subtask1_2.txt AC 28 ms 1280 KB
subtask1_3.txt AC 28 ms 1168 KB
subtask1_4.txt AC 30 ms 1268 KB
subtask1_5.txt AC 28 ms 1172 KB
subtask1_6.txt AC 30 ms 1172 KB
subtask1_7.txt AC 29 ms 1072 KB
subtask1_8.txt AC 31 ms 1180 KB
subtask1_9.txt AC 29 ms 1180 KB
subtask2_0.txt AC 91 ms 6088 KB
subtask2_1.txt AC 90 ms 5260 KB
subtask2_2.txt AC 91 ms 5324 KB
subtask2_3.txt AC 92 ms 5264 KB
subtask2_4.txt AC 91 ms 5252 KB
subtask2_5.txt AC 90 ms 5256 KB
subtask2_6.txt AC 90 ms 5320 KB
subtask2_7.txt AC 89 ms 5260 KB
subtask2_8.txt AC 87 ms 5264 KB
subtask2_9.txt AC 89 ms 5264 KB
subtask3_0.txt AC 91 ms 6032 KB
subtask3_1.txt AC 95 ms 6028 KB
subtask3_2.txt AC 96 ms 6028 KB
subtask3_3.txt AC 96 ms 6032 KB
subtask3_4.txt AC 95 ms 6032 KB
subtask3_5.txt AC 97 ms 6028 KB
subtask3_6.txt AC 96 ms 6024 KB
subtask3_7.txt AC 97 ms 6028 KB
subtask3_8.txt AC 95 ms 6028 KB
subtask3_9.txt AC 95 ms 6032 KB