Submission #66575185


Source Code Expand

#include <stdio.h>

int main (){

    int N ;
    int L;
    scanf("%d %d",&N, &L); 
    // printf("ok\n");
    int ispoint[L];
    for (int i = 0; i < L; i++){
        ispoint[i] = 0;
    }
    ispoint[0] = 1;
    int d[N+1];
    for(int i = 1; i < N; i++){
        scanf("%d", &d[i]);
        // printf("ok\n");
    }
    int now = 0;
    for(int i = 1; i < N; i++){ //ぐるぐるしながらぽいんて。
        now += d[i];
        now %= L;
        ispoint[now] += 1;
    }
    long long counter = 0;
    if(L % 3 != 0){
        printf("0\n");
        // printf("NF\n");
    }else{
        for(int i = 0; i < L / 3; i++){
            counter += (long long)ispoint[i] * ispoint[i + L/3] * ispoint[i + 2 * L/3];
        }
        printf("%lld\n", counter);
    }   
    // for(int i = 0; i < L; i++){ //ぐるぐるしながらぽいんて。
    //     printf("%d ", ispoint[i]);
    // }
    return 0;

}

Submission Info

Submission Time
Task C - Equilateral Triangle
User oinucha
Language C (gcc 12.2.0)
Score 300
Code Size 952 Byte
Status AC
Exec Time 29 ms
Memory 3944 KiB

Compile Error

Main.c: In function ‘main’:
Main.c:7:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    7 |     scanf("%d %d",&N, &L);
      |     ^~~~~~~~~~~~~~~~~~~~~
Main.c:16:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   16 |         scanf("%d", &d[i]);
      |         ^~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 37
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 0 ms 1588 KiB
00_sample_01.txt AC 1 ms 1632 KiB
00_sample_02.txt AC 0 ms 1628 KiB
01_test_00.txt AC 0 ms 1624 KiB
01_test_01.txt AC 1 ms 1724 KiB
01_test_02.txt AC 8 ms 2024 KiB
01_test_03.txt AC 20 ms 2876 KiB
01_test_04.txt AC 0 ms 1724 KiB
01_test_05.txt AC 1 ms 1720 KiB
01_test_06.txt AC 19 ms 2588 KiB
01_test_07.txt AC 23 ms 2916 KiB
01_test_08.txt AC 1 ms 2520 KiB
01_test_09.txt AC 1 ms 2264 KiB
01_test_10.txt AC 22 ms 3192 KiB
01_test_11.txt AC 27 ms 3452 KiB
01_test_12.txt AC 1 ms 2736 KiB
01_test_13.txt AC 2 ms 2924 KiB
01_test_14.txt AC 12 ms 3280 KiB
01_test_15.txt AC 27 ms 3924 KiB
01_test_16.txt AC 1 ms 2456 KiB
01_test_17.txt AC 1 ms 2028 KiB
01_test_18.txt AC 15 ms 2708 KiB
01_test_19.txt AC 27 ms 3836 KiB
01_test_20.txt AC 28 ms 3876 KiB
01_test_21.txt AC 27 ms 3740 KiB
01_test_22.txt AC 27 ms 3904 KiB
01_test_23.txt AC 27 ms 3808 KiB
01_test_24.txt AC 27 ms 3840 KiB
01_test_25.txt AC 27 ms 3892 KiB
01_test_26.txt AC 27 ms 3916 KiB
01_test_27.txt AC 29 ms 3904 KiB
01_test_28.txt AC 26 ms 3944 KiB
01_test_29.txt AC 27 ms 3728 KiB
01_test_30.txt AC 16 ms 2736 KiB
01_test_31.txt AC 16 ms 2892 KiB
01_test_32.txt AC 16 ms 2808 KiB
01_test_33.txt AC 0 ms 1628 KiB