Pagini recente » Cod sursa (job #2275055) | Cod sursa (job #2567784) | Cod sursa (job #1348662) | Cod sursa (job #2696993) | Cod sursa (job #110257)
Cod sursa(job #110257)
#include<fstream.h>
long int n, x[51],y[51],max=0,s=1,j=1;
void back(int k)
{for(int i=k;i<=n;i++)
if(x[i] && y[i])
{s*=x[i];
j*=y[i];
if(s%j==0 && max<(s/j)) max=s/j;
back(i+1);
s/=x[i];
j/=y[i];
} }
int main()
{int i;
ifstream f("aliens.in");
ofstream g("aliens.out");
f>>n;
for(i=1;i<=n;i++)
f>>x[i]>>y[i];
back(1);
g<<max<<'\n';
f.close();
g.close();
return 0;
}