Pagini recente » Cod sursa (job #440344) | Cod sursa (job #2538505) | Cod sursa (job #1507081) | clasament-arhiva-educationala | Cod sursa (job #818758)
Cod sursa(job #818758)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long prim(long x,long y)
{
int z;
while(y)
{
z=x%y;
x=y;
y=z;
}
if(x==1)
return 1;
else
return 0;
}
int main()
{
long n,i,j,nr=0;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(j==1||i==1)
nr++;
else
if(i%j!=0&&j%i!=0)
if((i%2==0&&j%2==1)||(i%2==1&&j%2==0)||(i%2==1)&&(j%2==1))
if(prim(i,j)==1)
nr++;
}
g<<nr;
return 0;
}