poj 2545 Hamming Problem dp

又是这种题..POJ上这种题真多

View Code

#include <stdio.h>

__int64 ar[10000000];

__int64 min(__int64 a,__int64 b,__int64 c)
{
if(a<=b&&a<=c)return a;
if(b<=a&&b<=c)return b;
if(c<=a&&c<=b)return c;
}

int main()
{
int a,b,c,n,i,j,k,l;
while (scanf("%d%d%d%d",&a,&b,&c,&n)!=EOF)
    {
        i=j=k=0;
        ar[0]=1;
for (l=1;l<=n;l++)
        {
            ar[l]=min(ar[i]*a,ar[j]*b,ar[k]*c);
if(ar[i]*a==ar[l])i++;
if(ar[j]*b==ar[l])j++;
if(ar[k]*c==ar[l])k++;
        }
        printf("%lld\n",ar[n]);
    }
return 0;
}

转载于:https://www.cnblogs.com/104-gogo/archive/2011/10/27/2226638.html