Pagini recente » Cod sursa (job #825990) | Cod sursa (job #2903301) | Cod sursa (job #3157474) | Cod sursa (job #2130790) | Cod sursa (job #2099615)
#include <iostream>
#include <fstream>
#include <list>
using namespace std;
int a[1000001];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
list<float> prim;
int n;
f>>n;
//for(int i=1; i<=1000000; i++) a[i]=1;
for(int i=2; i<=n; i++)
{
if(!a[i])
{
prim.push_back(i);
for(int j=2*i; j<=n; j+=i) a[j]=1;
}
}
/*cout<<"primek"<<endl;
for(list<float>::iterator it=prim.begin(); it!=prim.end(); it++) cout<<*it<<" ";
cout<<endl;*/
int s=0;
float phi;
for(int i=2; i<=n; i++)
{
phi=i;
for(list<float>::iterator it=prim.begin(); it!=prim.end() and *it<=i; it++)
{
if((int)i%(int)*it==0) phi*=(*it-1)/(*it);
//else cout<<i<<" nem oszthato "<<*it<<"-vel"<<endl;
}
s+=phi;
//cout<<i<<" "<<phi<<endl;
}
g<<2*s+1<<endl;
return 0;
}