Pagini recente » Cod sursa (job #1867657) | Cod sursa (job #2228060) | Cod sursa (job #343765) | Cod sursa (job #353014) | Cod sursa (job #843393)
Cod sursa(job #843393)
#include <iostream>
#include <fstream>
using namespace std;
int cm(long j, long i)
{
long c; c=i;
while(j%i!=0)
{
c=j%i; j=i; i=c;
}
return c;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
long n,i,j,nf=0,c;
in>>n; nf=2*n-1;
for(i=2;i<=n-1;i++)
for(j=i+1;j<=n;j++) {if(cm(j,i)==1) nf++;}
for(i=3;i<=n;i++)
for(j=2;j<=i-1;j++) {if(cm(i,j)==1) nf++;}
out<<nf;
return 0;
}