【codevs1246】丑数

problem

solution

codes

#include<cstdio> 
int p[101], a[101], k, n;
long long ans[100001], MIN;
int main(){
    ans[0]=1;
    scanf("%d%d",&k,&n);
    for (int i=1;i<=k;i++) scanf("%d",&p[i]);
    for (int i=1;i<=n;i++){
        MIN=0x7FFFFFFF;
        for (int j=1;j<=k;j++){
            while (p[j]*ans[a[j]] <= ans[i-1]) a[j]++;
            if (MIN > p[j]*ans[a[j]]) MIN=p[j]*ans[a[j]];
        }
        ans[i] = MIN;
    }
    printf("%lld",ans[n]);
    return 0;
}
  

 

  
 
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80554784