Cod sursa(job #451409)
Utilizator | Data | 9 mai 2010 15:16:10 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("fractii.in");
ofstream g("fractii.out");
int euclid(int a, int b)
{int c;
while(b)
{c = a % b;
a = b;
b = c;
}
return a;}
int main()
{long n,i,j,fr=0;
f>>n; fr=2*n-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
if(i!=j&&euclid(i,j)==1)
fr=fr+2;
g<<fr;
return 0;}