Pagini recente » Cod sursa (job #272283) | Cod sursa (job #1723759) | Cod sursa (job #181646) | Cod sursa (job #1274750) | Cod sursa (job #2944990)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int divizor(int a,int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
if(a==1)
return 0;
else
return 1;
}
int main()
{
int n=0,i,j,s=0;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
if(j%i!=0 || i == 1)
if(divizor(i,j)==0)
s++;
}
fout<<2*s + 1;
return 0;
}