Cod sursa(job #203239)
Utilizator | Data | 14 august 2008 20:17:51 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream.h>
long div(long i,long j)
{
long r;
do
{
r=i%j;
i=j;
j=r;
}
while (r!=0);
return i;
}
int main()
{
long n,nf,i,j;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
nf=2*n-1;
for (i=2; i<=n; i++)
for (j=2; j<=n; j++)
if (div(i,j)==1) nf++;
g<<nf;
f.close();
g.close();
return 0;
}