Pagini recente » Cei mai harnici utilizatori infoarena | Cod sursa (job #1883662) | Clasament arhiva | Cei mai harnici utilizatori infoarena | Cod sursa (job #2345808)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long int prim[1000005],N=4;
int euler(long int x)
{
int i,c,c1,r,s=0;
for(i=1;i<=N;i++)
{
c=i;
c1=x;
while(c)
{
r=c1%c;
c1=c;
c=r;
}
if(c1==1)
s++;
}
return s;
}
int main()
{
long int i,s;
fin>>N;
s=N;
for(i=2;i<=N;i++)
s=s+euler(i);
fout<<s;
fin.close();
fout.close();
}