Pagini recente » Cod sursa (job #6087) | Cod sursa (job #1332891) | Cod sursa (job #1042953) | Cod sursa (job #1205664) | Cod sursa (job #295057)
Cod sursa(job #295057)
#include<fstream.h>
int euclid(long a,long b)
{
long tmp;
if(!(!a%2&&!b%2))
while(b!=0)
{
tmp=a%b;
a=b;
b=tmp;
}
else a=2;
return a;
}
int main()
{
long n,i,j,contor;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
contor=n;
for(i=2;i<=n;i++)
for(j=1;j<=n;j++)
if(euclid(i,j)==1)contor++;
fout<<contor;
return 0;
}