Submission #470563

Source Code Expand

#include <stdio.h>
int main(void)
{

  int i, n;
  int x[100100];
  int count=0;
  int a, b, c, d;
  
  scanf("%d", &n);
  for(i=0; i<n; i++)
    scanf("%d", &x[i]);
  
  for(a=0; a<n; a++){
    for(b=1; b<n; b++){
      if(x[a]*2<=x[b]){
	for(c=2; c<n; c++){
	  if(x[b]*2<=x[c]){
	    for(d=3; d<n; d++){
	      if(x[c]*2<=x[d]){
		count++;
	      }
	    }
	  }
	}
      }
    }
  }

  count=count%1000000007;
  printf("%d\n", count);


  return 0;
}

Submission Info

Submission Time
Task A - 点数変換
User ogaoga
Language C++ (GCC 4.9.2)
Score 0
Code Size 485 Byte
Status WA
Exec Time 2040 ms
Memory 1200 KiB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 3
WA × 3
TLE × 39
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.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, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt WA 23 ms 792 KiB
sample_02.txt WA 23 ms 788 KiB
sample_03.txt WA 23 ms 788 KiB
subtask1_01.txt TLE 2040 ms 928 KiB
subtask1_02.txt TLE 2036 ms 1052 KiB
subtask1_03.txt TLE 2034 ms 956 KiB
subtask1_04.txt TLE 2033 ms 796 KiB
subtask1_05.txt TLE 2032 ms 1180 KiB
subtask1_06.txt TLE 2033 ms 1056 KiB
subtask1_07.txt TLE 2033 ms 1192 KiB
subtask1_08.txt TLE 2032 ms 992 KiB
subtask1_09.txt TLE 2032 ms 936 KiB
subtask1_10.txt TLE 2033 ms 932 KiB
subtask1_11.txt TLE 2033 ms 932 KiB
subtask1_12.txt TLE 2033 ms 1180 KiB
subtask1_13.txt TLE 2033 ms 924 KiB
subtask1_14.txt TLE 2033 ms 800 KiB
subtask1_15.txt TLE 2035 ms 1064 KiB
subtask1_16.txt TLE 2033 ms 1064 KiB
subtask1_17.txt TLE 2033 ms 816 KiB
subtask1_18.txt TLE 2033 ms 1064 KiB
subtask1_19.txt TLE 2031 ms 1200 KiB
subtask1_20.txt TLE 2033 ms 1188 KiB
subtask1_21.txt TLE 2033 ms 1188 KiB
subtask1_22.txt TLE 2035 ms 1172 KiB
subtask1_23.txt TLE 2033 ms 1188 KiB
subtask1_24.txt TLE 2033 ms 1184 KiB
subtask1_25.txt TLE 2034 ms 1184 KiB
subtask1_26.txt TLE 2033 ms 1188 KiB
subtask1_27.txt TLE 2031 ms 1184 KiB
subtask1_28.txt TLE 2033 ms 1188 KiB
subtask1_29.txt TLE 2033 ms 1184 KiB
subtask1_30.txt TLE 2032 ms 1192 KiB
subtask1_31.txt TLE 2035 ms 1192 KiB
subtask1_32.txt TLE 2033 ms 1188 KiB
subtask1_33.txt TLE 2033 ms 1188 KiB
subtask1_34.txt TLE 2033 ms 1184 KiB
subtask1_35.txt TLE 2033 ms 1188 KiB
subtask1_36.txt TLE 2033 ms 1188 KiB
subtask1_37.txt TLE 2033 ms 1184 KiB
subtask1_38.txt TLE 2033 ms 1184 KiB
subtask1_39.txt TLE 2033 ms 1188 KiB