結果

問題 No.406 鴨等間隔の法則
ユーザー 👑 testestesttestestest
提出日時 2016-09-19 00:03:45
言語 C90
(gcc 11.4.0)
結果
AC  
実行時間 23 ms / 2,000 ms
コード長 153 bytes
コンパイル時間 93 ms
コンパイル使用メモリ 20,480 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-07 11:49:16
合計ジャッジ時間 1,394 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
6,816 KB
testcase_01 AC 0 ms
6,940 KB
testcase_02 AC 0 ms
6,940 KB
testcase_03 AC 0 ms
6,944 KB
testcase_04 AC 21 ms
6,944 KB
testcase_05 AC 8 ms
6,940 KB
testcase_06 AC 8 ms
6,940 KB
testcase_07 AC 8 ms
6,944 KB
testcase_08 AC 22 ms
6,940 KB
testcase_09 AC 23 ms
6,944 KB
testcase_10 AC 9 ms
6,940 KB
testcase_11 AC 18 ms
6,940 KB
testcase_12 AC 11 ms
6,940 KB
testcase_13 AC 11 ms
6,940 KB
testcase_14 AC 19 ms
6,944 KB
testcase_15 AC 1 ms
6,944 KB
testcase_16 AC 2 ms
6,940 KB
testcase_17 AC 1 ms
6,940 KB
testcase_18 AC 2 ms
6,940 KB
testcase_19 AC 3 ms
6,944 KB
testcase_20 AC 3 ms
6,940 KB
testcase_21 AC 3 ms
6,944 KB
testcase_22 AC 5 ms
6,940 KB
testcase_23 AC 12 ms
6,940 KB
testcase_24 AC 17 ms
6,940 KB
testcase_25 AC 22 ms
6,940 KB
testcase_26 AC 23 ms
6,940 KB
testcase_27 AC 14 ms
6,944 KB
testcase_28 AC 14 ms
6,944 KB
testcase_29 AC 23 ms
6,940 KB
testcase_30 AC 22 ms
6,940 KB
testcase_31 AC 22 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      | ^
main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘x’ [-Wimplicit-int]
main.c:1:3: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int]
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      |   ^
main.c:1:12: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int]
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      |            ^
main.c:1:14: warning: return type defaults to ‘int’ [-Wimplicit-int]
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      |              ^
main.c:1:38: warning: return type defaults to ‘int’ [-Wimplicit-int]
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      |                                      ^~~~
main.c: In function ‘main’:
main.c:1:38: warning: type of ‘i’ defaults to ‘int’ [-Wimplicit-int]
main.c:1:52: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration]
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
      |                                                    ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
  +++ |+#include <stdio.h>
    1 | x,a[1<<17],s;c(int*a,int*b){x=*a-*

ソースコード

diff #

x,a[1<<17],s;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i&&(s-(x=a[-i]-a[~i])?!s?s=x:0:s););x=!puts(i?"NO":"YES");}
0