Submission #467635


Source Code Expand

#include <stdio.h>
int main(void){
  
  int n;
  int x[103];
  int a, b=0, d, e, f, g;
 
  scanf("%d", &n);
  for(a=0; a<n; a++)
    scanf("%d", &x[a]);
 
  for(a=0; a<n; a++)
    b+=x[a];
 
  if(b%n!=0){
    printf("-1\n");
    return 0;
  }
 
  d=0;
  e=0;
  f=0;
  g=0;
 
  for(a=0; a<n; a++){
    d+=x[a];
    ++f;
    if((double)(d/f)==(b/n)){
      g+=f-1;
      f=0;
      d=0;
    }
  }
 
  printf("%d\n", g);
  
    
    
  return 0;
}

Submission Info

Submission Time
Task B - 島と橋
User ogaoga
Language C++ (GCC 4.9.2)
Score 0
Code Size 483 Byte
Status WA
Exec Time 27 ms
Memory 796 KiB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 28
WA × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.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_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt
Case Name Status Exec Time Memory
sample_01.txt AC 25 ms 776 KiB
sample_02.txt AC 25 ms 776 KiB
sample_03.txt AC 25 ms 772 KiB
sample_04.txt AC 23 ms 792 KiB
subtask1_01.txt AC 25 ms 796 KiB
subtask1_02.txt AC 26 ms 780 KiB
subtask1_03.txt AC 23 ms 784 KiB
subtask1_04.txt AC 27 ms 740 KiB
subtask1_05.txt AC 25 ms 780 KiB
subtask1_06.txt AC 25 ms 724 KiB
subtask1_07.txt AC 23 ms 776 KiB
subtask1_08.txt AC 24 ms 776 KiB
subtask1_09.txt AC 26 ms 752 KiB
subtask1_10.txt WA 25 ms 768 KiB
subtask1_11.txt AC 24 ms 792 KiB
subtask1_12.txt WA 25 ms 764 KiB
subtask1_13.txt AC 23 ms 780 KiB
subtask1_14.txt AC 24 ms 780 KiB
subtask1_15.txt WA 23 ms 776 KiB
subtask1_16.txt WA 23 ms 740 KiB
subtask1_17.txt WA 24 ms 772 KiB
subtask1_18.txt AC 27 ms 776 KiB
subtask1_19.txt WA 23 ms 776 KiB
subtask1_20.txt AC 23 ms 772 KiB
subtask1_21.txt WA 23 ms 772 KiB
subtask1_22.txt AC 26 ms 796 KiB
subtask1_23.txt WA 25 ms 768 KiB
subtask1_24.txt WA 23 ms 776 KiB
subtask1_25.txt WA 23 ms 776 KiB
subtask1_26.txt AC 23 ms 772 KiB
subtask1_27.txt AC 24 ms 772 KiB
subtask1_28.txt AC 25 ms 776 KiB
subtask1_29.txt AC 24 ms 772 KiB
subtask1_30.txt AC 25 ms 772 KiB
subtask1_31.txt AC 25 ms 724 KiB
subtask1_32.txt AC 25 ms 796 KiB
subtask1_33.txt AC 25 ms 780 KiB
subtask1_34.txt AC 23 ms 768 KiB