Cod sursa(job #505017)
| Utilizator | Data | 29 noiembrie 2010 22:38:46 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long t,i,j,n;
int euclid (int a, int b)
{if(!b)return a;
return euclid(b,a-b*(a/b));
}
int main()
{f>>n;
f.close();
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)if(euclid(i,j)==1)t=t+2;
g<<t-1;
g.close();
return 0;
}
