Cod sursa(job #844410)
Utilizator | Data | 29 decembrie 2012 11:56:10 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cm(long j, long i)
{
long c;
while(j%i!=0)
{
c=j%i; j=i; i=c;
}
return i;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
long n,i,j,f=0;
in>>n;
for(i=3;i<=n;i+=2)
for(j=2;j<=i-1;j++)
{
if(cm(j,i)==1) f++;
}
for(i=4;i<=n;i+=2)
for(j=3;j<=i-1;j++)
{
if(j%2!=0) if(cm(j,i)==1) f++;
}
f=f*2+2*n-1;
out<<f;
return 0;
}