简单题
代码:
#include<iostream>
#include<fstream>
using namespace std;
long long a[20001];
long long solve(long long s,long long t){
if(s<t) return s;
else return t;
}
void read(){
// ifstream cin("in.txt");
long long i,j,k;
long long p1,p2,p3,n1,n2,n3;
cin>>p1>>p2>>p3>>k;
n1=1;
n2=1;
n3=1;
a[1]=1;
for(i=2;i<=k+1;i++)
{
a[i]=solve(a[n1]*p1,solve(a[n2]*p2,a[n3]*p3));
if(a[i]==a[n1]*p1)
n1++;
if(a[i]==a[n2]*p2)
n2++;
if(a[i]==a[n3]*p3)
n3++;
}
cout<<a[k+1]<<endl;
}
int main(){
read();
return 0;
}