POJ2545--Hamming Problem

Description

For each three prime numbers p1, p2 and p3, let's define Hamming sequence Hi(p1, p2, p3), i=1, ... as containing in increasing order all the natural numbers whose only prime divisors are p1, p2 or p3.

For example, H(2, 3, 5) = 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 25, 27, ...

So H5(2, 3, 5)=6.

Input

In the single line of input file there are space-separated integers p1 p2 p3 i.

Output

The output file must contain the single integer - Hi(p1, p2, p3). All numbers in input and output are less than 10^18.

Sample Input

7 13 19 100

Sample Output

26590291

/*此题暴力可以直接过。63MS.此题显然A[i]是在前面已推出的序列中找一个乘上p1 或p2 或p3.使其比A[i-1]大，而且要取最小的那个。循环一遍*p1，找到一个比A[i-1]大的即可以跳出循环。然后同理p2 p3.然后取最小
#include <iostream>
#include <cstdio>
using namespace std;
long long int A[10008];
inline long long int min(long long int a,long long int b)
{
	return a>b?b:a;
}
inline long long int min(long long int a,long long int b,long long int c)
{
	if(a>b)a=b;
	if(a>c)a=c;
	return a;
}
int main()
{
	long long int p1,p2,p3,n;
	long long int i1,i2,i3;
	long long int big;
	while(cin>>p1>>p2>>p3>>n)
	{
		i1=i2=i3=1;
		A[1]=min(p1,p2,p3);
		A[0]=1;
		for(long long int i=2;i<=n;i++)
		{
			big=A[i-1];
			for(long long int j=0;j<i;j++)
			{
				if(A[j]*p1>A[i-1])
				{
					big=A[j]*p1;
					break;
				}
			}
			for(long long int j=0;j<i;j++)
			{
				if(A[j]*p2>A[i-1])
				{
					big=min(big,A[j]*p2);
					break;
				}
			}
			for(long long int j=0;j<i;j++)
			{
				if(A[j]*p3>A[i-1])
				{
					big=min(big,A[j]*p3);
					break;
				}
			}
			A[i]=big;
		}
		cout<<A[n]<<endl;
	}
	return 0;
}