結果
| 問題 |
No.472 平均順位
|
| コンテスト | |
| ユーザー |
tails
|
| 提出日時 | 2016-12-22 01:31:18 |
| 言語 | C90 (gcc 12.3.0) |
| 結果 |
AC
|
| 実行時間 | 190 ms / 2,000 ms |
| コード長 | 216 bytes |
| コンパイル時間 | 266 ms |
| コンパイル使用メモリ | 20,864 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-12-14 14:14:50 |
| 合計ジャッジ時間 | 1,587 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 16 |
コンパイルメッセージ
main.c:2:1: warning: data definition has no type or storage class
2 | d[16448];main(n,p,j,a,b,c){scanf("%d%d",&n,&p);for(d[p+1]=d[p+2]=d[p+3]=j=1e9;j++<p||(j=0,~scanf("%d%d%d",&a,&b,&c));F(1,b),F(2,c),F(3,1))d[j]+=a;n=!printf("%f",1.**d/n);}
| ^
main.c:2:1: warning: type defaults to ‘int’ in declaration of ‘d’ [-Wimplicit-int]
main.c:2:10: warning: return type defaults to ‘int’ [-Wimplicit-int]
2 | d[16448];main(n,p,j,a,b,c){scanf("%d%d",&n,&p);for(d[p+1]=d[p+2]=d[p+3]=j=1e9;j++<p||(j=0,~scanf("%d%d%d",&a,&b,&c));F(1,b),F(2,c),F(3,1))d[j]+=a;n=!printf("%f",1.**d/n);}
| ^~~~
main.c: In function ‘main’:
main.c:2:10: warning: type of ‘n’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:10: warning: type of ‘p’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:10: warning: type of ‘j’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:10: warning: type of ‘a’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:10: warning: type of ‘b’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:10: warning: type of ‘c’ defaults to ‘int’ [-Wimplicit-int]
main.c:2:28: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration]
2 | d[16448];main(n,p,j,a,b,c){scanf("%d%d",&n,&p);for(d[p+1]=d[p+2]=d[p+3]=j=1e9;j++<p||(j=0,~scanf("%d%d%d",&a,&b,&c));F(1,b),F(2,c),F(3,1))d[j]+=a;n=!printf("%f",1.**d/n);}
| ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
+++ |+#include <stdio.h>
1 | #define F(k,v)d[j]>d[j+k]+v&&(d[j]=d[j+k]+v)
main.c:2:28: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch]
2 | d[16448];main(n,p,j,a,b,c){scanf("%d%d",&n,&p);for(d[p+1]=d[p+2]=d[p+3]=j=1e9;j++<p||(j=0,~scanf("%d%d%d",&a,&b,&c));F(1,b),F(2,c),F(3,1))d[j]+=a;n=!printf("%f",1.**d/n);}
| ^~~~~
main.c:2:28: note: include ‘<stdio.h>’ or provide a d
ソースコード
#define F(k,v)d[j]>d[j+k]+v&&(d[j]=d[j+k]+v)
d[16448];main(n,p,j,a,b,c){scanf("%d%d",&n,&p);for(d[p+1]=d[p+2]=d[p+3]=j=1e9;j++<p||(j=0,~scanf("%d%d%d",&a,&b,&c));F(1,b),F(2,c),F(3,1))d[j]+=a;n=!printf("%f",1.**d/n);}
tails