Cod sursa(job #157699)
Utilizator | Data | 13 martie 2008 10:59:30 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
int euclid(int a,int b)
{
int tmp;
while(b!=0)
{
tmp=a%b;
a=b;
b=tmp;
}
return a;
}
int main()
{
int n,i,j,contor=0;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(euclid(i,j)==1)contor++;
fout<<contor;
return 0;
}