結果
問題 |
No.370 道路の掃除
|
ユーザー |
👑 ![]() |
提出日時 | 2016-05-14 16:30:15 |
言語 | C90 (gcc 12.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 242 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 20,224 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-06 02:38:30 |
合計ジャッジ時間 | 1,352 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 31 WA * 3 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] main.c:1:9: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:11: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:13: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:15: warning: type defaults to ‘int’ in declaration of ‘t’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:17: warning: type defaults to ‘int’ in declaration of ‘p’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:1:19: warning: type defaults to ‘int’ in declaration of ‘q’ [-Wimplicit-int] 1 | a[1010],i,n,s,t,p,q; | ^ main.c:2:1: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | c(int*a,int*b){t=*a-*b;} | ^ main.c:3:1: warning: return type defaults to ‘int’ [-Wimplicit-int] 3 | main(){ | ^~~~ main.c: In function ‘main’: main.c:4:13: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 4 | for(scanf("%d%*d",&n);~scanf("%d",a+q);q++); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | a[1010],i,n,s,t,p,q; main.c:4:13: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 4 | for(scanf("%d%*d",&n);~scanf("%d",a+q);q++); | ^~~~~ main.c:4:13: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:5:13: warning: implicit declaration of function ‘qsort’ [-Wimpli
ソースコード
a[1010],i,n,s,t,p,q; c(int*a,int*b){t=*a-*b;} main(){ for(scanf("%d%*d",&n);~scanf("%d",a+q);q++); for(qsort(a,q,4,c);q=a[i+n-1]?:!printf("%d",s);i++){ p=a[i]; t=(abs(p)<abs(q)?abs(q):abs(p)); p*q<0?t=q*2-p*2-t:0; !s|t<s?s=t:0; } }