Cod sursa(job #2336322)
Utilizator | Data | 5 februarie 2019 00:41:03 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
using namespace std;
int cmmdc(int a,int b)
{
int r;
while (b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
pair < int , int > p[10];
int main()
{
int n;
long long prod=1,a=0;
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>p[i].first>>p[i].second;
prod=prod*p[i].second;
}
for (int i=1;i<=n;i++)
{
a=a+p[i].first*(prod/p[i].second);
}
int l=cmmdc(a,prod);
cout<<a/l<<" "<<prod/l;
return 0;
}