結果
| 問題 |
No.458 異なる素数の和
|
| ユーザー |
hogeover30
|
| 提出日時 | 2016-12-28 22:21:51 |
| 言語 | C90 (gcc 12.3.0) |
| 結果 |
AC
|
| 実行時間 | 79 ms / 2,000 ms |
| コード長 | 155 bytes |
| コンパイル時間 | 190 ms |
| コンパイル使用メモリ | 21,376 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-06-26 03:14:29 |
| 合計ジャッジ時間 | 1,790 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
コンパイルメッセージ
main.c:1:3: warning: multi-character character constant [-Wmultichar]
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^~~~
main.c:1:1: warning: data definition has no type or storage class
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^
main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘d’ [-Wimplicit-int]
main.c:1:9: warning: type defaults to ‘int’ in declaration of ‘j’ [-Wimplicit-int]
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^
main.c:1:11: warning: type defaults to ‘int’ in declaration of ‘k’ [-Wimplicit-int]
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^
main.c:1:13: warning: return type defaults to ‘int’ [-Wimplicit-int]
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^~~~
main.c: In function ‘main’:
main.c:1:13: warning: type of ‘i’ defaults to ‘int’ [-Wimplicit-int]
main.c:1:13: warning: type of ‘n’ defaults to ‘int’ [-Wimplicit-int]
main.c:1:30: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration]
1 | d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
| ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
+++ |+#include <stdio.h>
1
ソースコード
d['~~'],j,k;main(i,n){for(*d=scanf("%d",&n);k=i++<=n;){for(;i%++k&&k*k<=i;);for(j=n;k*k>i&j>=i;--j)d[j-i]?d[j]=fmax(d[j],d[j-i]+1):0;}printf("%d",d[n]-1);}
hogeover30