Pagini recente » Cod sursa (job #2951601) | Cod sursa (job #2584838) | Cod sursa (job #3181163) | Cod sursa (job #106658) | Cod sursa (job #1046998)
#include<iostream.h>
#include<fstream.h>
ifstream f("vraji.in");
ofstream g("vraji.out");
int n,i,p,v,c[100],k,max;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>p>>v;
k++;
c[k]=p*v;
}
for(i=1;i<=n;i++)
{
if(c[i]>max)
max=c[i];
}
for(i=1;i<=n-1;i++)
{
while(c[i]!=c[i+1])
{
if(c[i]>c[i+1])
c[i]=c[i]-c[i+1];
else
c[i+1]=c[i+1]-c[i];
}
}
g<<max<<'\n'<<c[i]<<'\n';
}