Cod sursa(job #1046998)
| Utilizator | Data | 3 decembrie 2013 19:54:15 | |
|---|---|---|---|
| Problema | Prefix | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#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';
}