結果
問題 |
No.286 Modulo Discount Store
|
ユーザー |
👑 ![]() |
提出日時 | 2016-05-23 18:51:30 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 14 ms / 2,000 ms |
コード長 | 290 bytes |
コンパイル時間 | 149 ms |
コンパイル使用メモリ | 20,864 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-07 01:42:04 |
合計ジャッジ時間 | 1,646 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | d[99999],a[20],i,j,k,n; | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘d’ [-Wimplicit-int] main.c:1:10: warning: type defaults to ‘int’ in declaration of ‘a’ [-Wimplicit-int] 1 | d[99999],a[20],i,j,k,n; | ^ main.c:1:16: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] 1 | d[99999],a[20],i,j,k,n; | ^ main.c:1:18: warning: type defaults to ‘int’ in declaration of ‘j’ [-Wimplicit-int] 1 | d[99999],a[20],i,j,k,n; | ^ main.c:1:20: warning: type defaults to ‘int’ in declaration of ‘k’ [-Wimplicit-int] 1 | d[99999],a[20],i,j,k,n; | ^ main.c:1:22: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] 1 | d[99999],a[20],i,j,k,n; | ^ main.c:2:1: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | main(m){ | ^~~~ main.c: In function ‘main’: main.c:2:1: warning: type of ‘m’ defaults to ‘int’ [-Wimplicit-int] main.c:3:13: warning: implicit declaration of function ‘gets’ [-Wimplicit-function-declaration] 3 | for(gets(&m);~scanf("%d",a+n);n++); | ^~~~ main.c:3:23: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 3 | for(gets(&m);~scanf("%d",a+n);n++); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | d[99999],a[20],i,j,k,n; main.c:3:23: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 3 | for(gets(&m);~scanf("%d",a+n);n++); | ^~~~~ main.c:3:23: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:12:12: warning: implicit declarat
ソースコード
d[99999],a[20],i,j,k,n; main(m){ for(gets(&m);~scanf("%d",a+n);n++); for(;i<1<<n;i++){ for(j=0;j<n;j++){ if(i>>j&1)continue; for(m=k=0;k<n;k++)m=(m+(i>>k&1)*a[k])%1000; m=a[j]<m?0:a[j]-m; !d[i^1<<j]|d[i^1<<j]>d[i]+m?d[i^1<<j]=d[i]+m:0; } } i=!printf("%d",d[(1<<n)-1]); }