結果
問題 |
No.247 線形計画問題もどき
|
ユーザー |
|
提出日時 | 2015-07-17 23:42:22 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 213 bytes |
コンパイル時間 | 150 ms |
コンパイル使用メモリ | 19,968 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-07 11:03:16 |
合計ジャッジ時間 | 1,049 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 23 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | a[100],b[100001],C,N,i;main(m){ | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] main.c:1:8: warning: type defaults to ‘int’ in declaration of ‘b’ [-Wimplicit-int] 1 | a[100],b[100001],C,N,i;main(m){ | ^ main.c:1:18: warning: type defaults to ‘int’ in declaration of ‘C’ [-Wimplicit-int] 1 | a[100],b[100001],C,N,i;main(m){ | ^ main.c:1:20: warning: type defaults to ‘int’ in declaration of ‘N’ [-Wimplicit-int] 1 | a[100],b[100001],C,N,i;main(m){ | ^ main.c:1:22: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] 1 | a[100],b[100001],C,N,i;main(m){ | ^ main.c:1:24: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | a[100],b[100001],C,N,i;main(m){ | ^~~~ main.c: In function ‘main’: main.c:1:24: warning: type of ‘m’ defaults to ‘int’ [-Wimplicit-int] main.c:2:9: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 2 | scanf("%d%d",&C,&N); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | a[100],b[100001],C,N,i;main(m){ main.c:2:9: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 2 | scanf("%d%d",&C,&N); | ^~~~~ main.c:2:9: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:6:12: warning: implicit declaration of function ‘printf’ [-Wimplicit-function-declaration] 6 | C=!printf("%d\n",b[C]-1); | ^~~~~~ main.c:6:12: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’ main.c:6:12: warning: incompatible implicit declaration of built-in function ‘
ソースコード
a[100],b[100001],C,N,i;main(m){ scanf("%d%d",&C,&N); for(;i<N;i++)scanf("%d",a+i); *b=1; for(i=0;i<N;i++)for(m=a[i];m<=C;m++)if(b[m-a[i]]&&(!b[m]||b[m-a[i]]<b[m]))b[m]=b[m-a[i]]+1; C=!printf("%d\n",b[C]-1); }