Submission #345310


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int INF = 1000000007;
const int MOD = 1000000007;

typedef long long ll;
typedef pair<int, int> pr;

int main(){
    int N;
    int a[100000];
    scanf("%d", &N);
    for(int i = 0; i < N; ++i) {
        scanf("%d", a + i);
        while(a[i] % 2 == 0) a[i] /= 2;
    }
    sort(a, a + N);
    int res = 0, ind = 0;
    while(ind < N) {
        ++res;
        ind = upper_bound(a, a + N, a[ind]) - a;
    }
    printf("%d\n", res);
    return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User lrmystp
Language C++ (G++ 4.6.4)
Score 100
Code Size 528 Byte
Status AC
Exec Time 68 ms
Memory 1196 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:15:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 24 ms 924 KB
subtask0_1.txt AC 23 ms 924 KB
subtask0_2.txt AC 22 ms 920 KB
subtask1_0.txt AC 25 ms 792 KB
subtask1_1.txt AC 25 ms 916 KB
subtask1_10.txt AC 25 ms 928 KB
subtask1_11.txt AC 24 ms 928 KB
subtask1_12.txt AC 26 ms 800 KB
subtask1_13.txt AC 25 ms 924 KB
subtask1_14.txt AC 25 ms 924 KB
subtask1_15.txt AC 25 ms 804 KB
subtask1_16.txt AC 25 ms 800 KB
subtask1_17.txt AC 25 ms 924 KB
subtask1_18.txt AC 24 ms 800 KB
subtask1_19.txt AC 24 ms 928 KB
subtask1_2.txt AC 24 ms 732 KB
subtask1_3.txt AC 26 ms 920 KB
subtask1_4.txt AC 26 ms 924 KB
subtask1_5.txt AC 25 ms 924 KB
subtask1_6.txt AC 24 ms 800 KB
subtask1_7.txt AC 24 ms 924 KB
subtask1_8.txt AC 25 ms 924 KB
subtask1_9.txt AC 25 ms 796 KB
subtask2_0.txt AC 52 ms 1184 KB
subtask2_1.txt AC 60 ms 1192 KB
subtask2_2.txt AC 60 ms 1060 KB
subtask2_3.txt AC 60 ms 1188 KB
subtask2_4.txt AC 60 ms 1184 KB
subtask2_5.txt AC 60 ms 1188 KB
subtask2_6.txt AC 61 ms 1196 KB
subtask2_7.txt AC 61 ms 1180 KB
subtask2_8.txt AC 61 ms 1196 KB
subtask2_9.txt AC 60 ms 1188 KB
subtask3_0.txt AC 52 ms 1188 KB
subtask3_1.txt AC 66 ms 1188 KB
subtask3_2.txt AC 67 ms 1056 KB
subtask3_3.txt AC 66 ms 1184 KB
subtask3_4.txt AC 66 ms 1180 KB
subtask3_5.txt AC 66 ms 1192 KB
subtask3_6.txt AC 68 ms 1116 KB
subtask3_7.txt AC 68 ms 1192 KB
subtask3_8.txt AC 67 ms 1184 KB
subtask3_9.txt AC 66 ms 1184 KB