結果
| 問題 |
No.385 カップ麺生活
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2016-07-03 23:25:10 |
| 言語 | C90 (gcc 12.3.0) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 349 bytes |
| コンパイル時間 | 203 ms |
| コンパイル使用メモリ | 20,736 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-10-04 22:38:59 |
| 合計ジャッジ時間 | 1,031 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 32 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class
1 | T[10001],A[10001],B[99];main(){
| ^
main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘T’ [-Wimplicit-int]
main.c:1:10: warning: type defaults to ‘int’ in declaration of ‘A’ [-Wimplicit-int]
1 | T[10001],A[10001],B[99];main(){
| ^
main.c:1:19: warning: type defaults to ‘int’ in declaration of ‘B’ [-Wimplicit-int]
1 | T[10001],A[10001],B[99];main(){
| ^
main.c:1:25: warning: return type defaults to ‘int’ [-Wimplicit-int]
1 | T[10001],A[10001],B[99];main(){
| ^~~~
main.c: In function ‘main’:
main.c:4:9: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration]
4 | scanf("%d%d",&m,&n);
| ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
+++ |+#include <stdio.h>
1 | T[10001],A[10001],B[99];main(){
main.c:4:9: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch]
4 | scanf("%d%d",&m,&n);
| ^~~~~
main.c:4:9: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
main.c:14:13: warning: implicit declaration of function ‘printf’ [-Wimplicit-function-declaration]
14 | *B=!printf("%lld\n",r+ma);
| ^~~~~~
main.c:14:13: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’
main.c:14:13: warning: incompatible implicit declaration of built-in function ‘printf’ [-Wbuiltin-declaration-mismatch]
main.c:14:13: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’
ソースコード
T[10001],A[10001],B[99];main(){
int m,n,i,j,ma=0;
long long r=0;
scanf("%d%d",&m,&n);
for(i=0;i<n;i++)scanf("%d",B+i),A[B[i]]=1;
for(i=0;i<n;i++)for(j=0;j<=m-B[i];j++)if(A[j]&&A[j+B[i]]<=A[j])A[j+B[i]]=A[j]+1;
for(i=2;i<=m;i++){
if(ma<A[i])ma=A[i];
if(!T[i]){
r+=A[m-i];
for(j=i;j<=m;j+=i)T[j]=1;
}
}
*B=!printf("%lld\n",r+ma);
}