Cod sursa(job #895221)
| Utilizator | Data | 27 februarie 2013 10:34:24 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,i,j,copa,copb;
long long s;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=2;i<n;i++)
for(j=i+1;j<=n;j++)
{
copa=i;
copb=j;
while(copb!=copa)
if(copa>copb)
copa=copa-copb;
else
copb=copb-copa;
if(copa==1)
s++;
}
g<<(s+n)*2-1;
f.close();
g.close();
return 0;
}
