Cod sursa(job #82333)
Utilizator | Data | 6 septembrie 2007 16:33:32 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#include<math>
int n,s;
ifstream f("fractii.in");
ofstream g("fractii.out");
long prim(long a,long b)
{while(a!=b)
if(a>b) a-=b;
else b-=a;
if(a==1) return 1;
else return 0;
}
int main()
{//long p;
f>>n;
s=2*n-1;
for (long i=2;i<n;i++)
for(long j=i+1;j<=n;j++)
if (prim(i,j)) s+=2;
g<<s;
g.close();
return 0;
}