Pagini recente » Cod sursa (job #605206) | Cod sursa (job #1390608) | Cod sursa (job #1536861) | Cod sursa (job #1123495) | Cod sursa (job #755565)
Cod sursa(job #755565)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int prim(int a,int b)
{
while(a!=b)
if(a>b)
a=a-b;
else
b=b-a;
return a;
}
int main ()
{
int i,n,k=1,j;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
if(i%2==0 && j%2!=0 || i%2!=0 && j%2==0 || i%2!=0 && j%2!=0)
if(prim(i,j)==1)
k++;
out<<k;
}