結果
| 問題 | No.190 Dry Wet Moist |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2015-04-22 04:45:48 |
| 言語 | C90(gcc12) (gcc 12.4.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 287 bytes |
| 記録 | |
| コンパイル時間 | 173 ms |
| コンパイル使用メモリ | 30,280 KB |
| 最終ジャッジ日時 | 2026-02-23 18:18:13 |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 WA * 1 |
| other | AC * 5 WA * 23 |
コンパイルメッセージ
main.c:2:31: warning: multi-character character constant [-Wmultichar]
2 | c(int*a,int*b){return*a-*b;}v['abc'],N,R,l;main(h){for(;~scanf("%d",&v[N++]););qsort(v+1,--N,4,c);Z(R++|l++|h--,h--,<)Z(R++|l++|h--,l++,>)Z((v[l]+v[h]==0?R++|h--:1,l++),h--,<=)}
| ^~~~~
main.c:2:29: warning: data definition has no type or storage class
2 | c(int*a,int*b){return*a-*b;}v['abc'],N,R,l;main(h){for(;~scanf("%d",&v[N++]););qsort(v+1,--N,4,c);Z(R++|l++|h--,h--,<)Z(R++|l++|h--,l++,>)Z((v[l]+v[h]==0?R++|h--:1,l++),h--,<=)}
| ^
main.c: In function ‘main’:
main.c:2:58: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch]
2 | c(int*a,int*b){return*a-*b;}v['abc'],N,R,l;main(h){for(;~scanf("%d",&v[N++]););qsort(v+1,--N,4,c);Z(R++|l++|h--,h--,<)Z(R++|l++|h--,l++,>)Z((v[l]+v[h]==0?R++|h--:1,l++),h--,<=)}
| ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
+++ |+#include <stdio.h>
1 | #define Z(C,D,P)for(R=0,l=1,h=N-1;l<h;C){for(;l<h;D)if(v[l]+v[h]P 0)break;if(l==h)break;};l=!printf("%d ",R);
main.c:1:94: warning: incompatible implicit declaration of built-in function ‘printf’ [-Wbuiltin-declaration-mismatch]
1 | #define Z(C,D,P)for(R=0,l=1,h=N-1;l<h;C){for(;l<h;D)if(v[l]+v[h]P 0)break;if(l==h)break;};l=!printf("%d ",R);
| ^~~~~~
main.c:2:99: note: in expansion of macro ‘Z’
2 | c(int*a,int*b){return*a-*b;}v['abc'],N,R,l;main(h){for(;~scanf("%d",&v[N++]););qsort(v+1,--N,4,c);Z(R++|l++|h--,h--,<)Z(R++|l++|h--,l++,>)Z((v[l]+v[h]==0?R++|h--:1,l++),h--,<=)}
| ^
main.c:1:94: note: include ‘<stdio.h>’ or provide a declaration of ‘prin
ソースコード
#define Z(C,D,P)for(R=0,l=1,h=N-1;l<h;C){for(;l<h;D)if(v[l]+v[h]P 0)break;if(l==h)break;};l=!printf("%d ",R);
c(int*a,int*b){return*a-*b;}v['abc'],N,R,l;main(h){for(;~scanf("%d",&v[N++]););qsort(v+1,--N,4,c);Z(R++|l++|h--,h--,<)Z(R++|l++|h--,l++,>)Z((v[l]+v[h]==0?R++|h--:1,l++),h--,<=)}