結果
問題 | No.190 Dry Wet Moist |
ユーザー | ciel |
提出日時 | 2016-07-03 22:59:01 |
言語 | C90 (gcc 11.4.0) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 221 bytes |
コンパイル時間 | 1,408 ms |
コンパイル使用メモリ | 20,480 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-26 11:02:33 |
合計ジャッジ時間 | 6,863 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
コンパイルメッセージ
main.c:2:1: warning: data definition has no type or storage class 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)} | ^ main.c:2:1: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] main.c:2:10: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int] 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)} | ^ main.c:2:12: warning: type defaults to ‘int’ in declaration of ‘r’ [-Wimplicit-int] 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)} | ^ main.c:2:14: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)} | ^~~~ main.c: In function ‘main’: main.c:2:14: warning: type of ‘n’ defaults to ‘int’ [-Wimplicit-int] main.c:2:14: warning: type of ‘l’ defaults to ‘int’ [-Wimplicit-int] main.c:2:30: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)} | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | #define f(P,Q,R)for(l=0,r=~n;l<r;P)a[l]Q-a[r]?s++,R:0;s=!printf("%d ",s); main.c:2:30: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 2 | a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3"
ソースコード
#define f(P,Q,R)for(l=0,r=~n;l<r;P)a[l]Q-a[r]?s++,R:0;s=!printf("%d ",s); a[1<<18],s,r;main(n,l){for(;~scanf("%d",a-n--););qsort(a,-++n,4,"\x8b\7+\6\xc3");f(r--,<,l++)f(l++,>,r--)f(a[l]+a[r]<=0?r-=a[l++]==-a[r]:r--,==,0)}