Cod sursa(job #22907)
Utilizator | Data | 27 februarie 2007 20:07:33 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.28 kb |
#include<fstream.h>
ifstream f("fractii.in");
ofstream g("fractii.out");
long n;
int cm(long a,long b)
{while(b)
{long r=a%b; a=b; b=r;}
return a;
}
int main()
{f>>n;
long k=0;
for(long i=2;i<=n;i++)
for(long j=2;j<=n;j++)
if(cm(i,j)==1) k++;
g<<k+2*n-1;
return 0;
}