結果
問題 | No.182 新規性の虜 |
ユーザー | 👑 testestest |
提出日時 | 2016-02-16 04:00:50 |
言語 | C90 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 22 ms / 5,000 ms |
コード長 | 151 bytes |
コンパイル時間 | 1,247 ms |
コンパイル使用メモリ | 20,096 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-08 05:19:00 |
合計ジャッジ時間 | 2,396 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 0 ms
6,812 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 0 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 14 ms
6,940 KB |
testcase_09 | AC | 22 ms
6,944 KB |
testcase_10 | AC | 20 ms
6,940 KB |
testcase_11 | AC | 16 ms
6,940 KB |
testcase_12 | AC | 7 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 0 ms
6,944 KB |
testcase_16 | AC | 0 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 18 ms
6,940 KB |
testcase_19 | AC | 13 ms
6,940 KB |
testcase_20 | AC | 8 ms
6,940 KB |
testcase_21 | AC | 20 ms
6,944 KB |
testcase_22 | AC | 10 ms
6,940 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 16 ms
6,940 KB |
testcase_25 | AC | 13 ms
6,940 KB |
testcase_26 | AC | 3 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,944 KB |
evil01.txt | AC | 17 ms
6,940 KB |
evil02.txt | AC | 17 ms
6,944 KB |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] main.c:1:3: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int] 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^ main.c:1:5: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^ main.c:1:14: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^ main.c:1:42: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^~~~ main.c: In function ‘main’: main.c:1:55: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);} | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-
ソースコード
n,s,a[1<<17];c(int*a,int*b){return*a-*b;}main(){for(;~scanf("%d",a+n);n++);qsort(a+1,n,4,c);for(;--n;s+=a[n]-a[n+1]&&a[n+1]-a[n+2]);s=!printf("%d",s);}