Submission #1480630


Source Code Expand

#include <stdio.h>
static int n, a[100000];
// https://en.wikibooks.org/wiki/Algorithm_Implementation/Sorting/Quicksort#C
void qsort(int l, int r) {
    static int piv, tmp;
    int ll, rr, piv_i;
    if (r > l) {
        ll = l + 1;
        rr = r;
        piv_i = l + (r - l) / 2;
        tmp = a[l];
        a[l] = a[piv_i];
        a[piv_i] = tmp;
        piv = a[l];
        while (ll < rr) {
            if (a[ll] <= piv) {
                ++ll;
            } else {
                while (ll < --rr && a[rr] >= piv);
                tmp = a[ll];
                a[ll] = a[rr];
                a[rr] = tmp;
            }
        }
        --ll;
        tmp = a[l];
        a[l] = a[ll];
        a[ll] = tmp;
        qsort(l, ll);
        qsort(rr, r);
    }
}
int main(void) {
    int i, j, ans = 1;
    scanf("%d", &n);
    for (i = 0; i < n; ++i) {
        scanf("%d", &j);
        while (1)
            if (j & 1)
                break;
            else
                j >>= 1;
        a[i] = j;
    }
    qsort(0, n);
    for (i = 0; i < n - 1; ++i)
        if (a[i] != a[i + 1])
            ++ans;
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User test20170101
Language C (GCC 5.4.1)
Score 100
Code Size 1202 Byte
Status AC
Exec Time 21 ms
Memory 512 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:35:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ^
./Main.c:37:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &j);
         ^

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 1 ms 128 KB
subtask0_1.txt AC 1 ms 128 KB
subtask0_2.txt AC 1 ms 128 KB
subtask1_0.txt AC 1 ms 128 KB
subtask1_1.txt AC 1 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 1 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 1 ms 128 KB
subtask1_16.txt AC 1 ms 128 KB
subtask1_17.txt AC 1 ms 128 KB
subtask1_18.txt AC 1 ms 128 KB
subtask1_19.txt AC 1 ms 128 KB
subtask1_2.txt AC 1 ms 128 KB
subtask1_3.txt AC 1 ms 128 KB
subtask1_4.txt AC 1 ms 128 KB
subtask1_5.txt AC 1 ms 128 KB
subtask1_6.txt AC 1 ms 128 KB
subtask1_7.txt AC 1 ms 128 KB
subtask1_8.txt AC 1 ms 128 KB
subtask1_9.txt AC 1 ms 128 KB
subtask2_0.txt AC 13 ms 512 KB
subtask2_1.txt AC 20 ms 512 KB
subtask2_2.txt AC 19 ms 512 KB
subtask2_3.txt AC 19 ms 512 KB
subtask2_4.txt AC 20 ms 512 KB
subtask2_5.txt AC 19 ms 512 KB
subtask2_6.txt AC 19 ms 512 KB
subtask2_7.txt AC 19 ms 512 KB
subtask2_8.txt AC 20 ms 512 KB
subtask2_9.txt AC 20 ms 512 KB
subtask3_0.txt AC 13 ms 512 KB
subtask3_1.txt AC 21 ms 512 KB
subtask3_2.txt AC 21 ms 512 KB
subtask3_3.txt AC 21 ms 512 KB
subtask3_4.txt AC 21 ms 512 KB
subtask3_5.txt AC 21 ms 512 KB
subtask3_6.txt AC 21 ms 512 KB
subtask3_7.txt AC 21 ms 512 KB
subtask3_8.txt AC 21 ms 512 KB
subtask3_9.txt AC 21 ms 512 KB