結果
問題 | No.406 鴨等間隔の法則 |
ユーザー | testestest |
提出日時 | 2016-09-18 21:17:57 |
言語 | C90 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 163 bytes |
コンパイル時間 | 195 ms |
コンパイル使用メモリ | 20,608 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-07 11:48:47 |
合計ジャッジ時間 | 1,519 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
6,812 KB |
testcase_01 | AC | 0 ms
6,944 KB |
testcase_02 | AC | 0 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 21 ms
6,940 KB |
testcase_05 | AC | 8 ms
6,940 KB |
testcase_06 | AC | 9 ms
6,944 KB |
testcase_07 | AC | 9 ms
6,940 KB |
testcase_08 | AC | 21 ms
6,940 KB |
testcase_09 | AC | 24 ms
6,940 KB |
testcase_10 | AC | 10 ms
6,940 KB |
testcase_11 | AC | 18 ms
6,944 KB |
testcase_12 | AC | 12 ms
6,940 KB |
testcase_13 | AC | 11 ms
6,944 KB |
testcase_14 | AC | 20 ms
6,944 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 3 ms
6,944 KB |
testcase_21 | AC | 3 ms
6,944 KB |
testcase_22 | AC | 5 ms
6,940 KB |
testcase_23 | AC | 13 ms
6,944 KB |
testcase_24 | AC | 17 ms
6,940 KB |
testcase_25 | AC | 24 ms
6,944 KB |
testcase_26 | AC | 24 ms
6,944 KB |
testcase_27 | AC | 15 ms
6,944 KB |
testcase_28 | AC | 16 ms
6,940 KB |
testcase_29 | AC | 24 ms
6,940 KB |
testcase_30 | AC | 24 ms
6,940 KB |
testcase_31 | AC | 24 ms
6,940 KB |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"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],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");} | ^ main.c:1:12: warning: type defaults to ‘int’ in declaration of ‘m’ [-Wimplicit-int] 1 | x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");} | ^ main.c:1:14: warning: type defaults to ‘int’ in declaration of ‘M’ [-Wimplicit-int] 1 | x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");} | ^ main.c:1:16: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");} | ^ main.c:1:40: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");} | ^~~~ main.c: In function ‘main’: main.c:1:40: warning: type of ‘i’ defaults to ‘int’ [-Wimplicit-int] main.c:1:54: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 1 | x,a[1<<17],m,M;c(int*a,int*b)
ソースコード
x,a[1<<17],m,M;c(int*a,int*b){x=*a-*b;}main(i){for(;~scanf("%d",a-i);i--);for(qsort(a,-i,4,c);++i;!m|m>x?m=x:0,M<x?M=x:0)x=a[-i]-a[~i];x=!puts(m-M|!M?"NO":"YES");}