Cod sursa(job #221723)
Utilizator | Data | 17 noiembrie 2008 20:03:24 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream.h>
long divz(long i,long j)
{ int r;
r=i%j;
while(r!=0)
{
i=j;
j=r;
r=i%j;
}
return j;
}
int main()
{
long n,cnt=0;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(divz(i,j)==1)cnt++;
g<<cnt<<endl;
f.close();
g.close();
return 0;
}