Pagini recente » Cod sursa (job #1748780) | Istoria paginii runda/ceva_ez_v2 | Cod sursa (job #2235874) | Cod sursa (job #2410218) | Cod sursa (job #2277528)
#include <iostream>
#include <fstream>
using namespace std;
ifstream intrare("fractii.in");
ofstream iesire("fractii.out");
const long int NMAX=1000001;
int i,j;
long int n;
bool a[NMAX];
void prime(){
///0-prim;
for(i=2;i<=n;i++)
if(a[i]==false)
for(j=i*i;j<=n;j+=i)
a[j]=true;
}
double long d;
double long r;
float totien(int x){
d=x;
for(j=2;j<=x/2+1;j++)
if(x%j==0 && a[j]==0){
r=1.0/double(j);
d*=1-r;
}
if(a[x]==0)
{
r=1.0/double(x);
d*=1-r;
}
return d;
}
int main()
{
long long int s=0;
intrare>>n;
prime();
for(i=2;i<=n;i++)
s+=totien(i);
s*=2;
s++;
iesire<<s;
return 0;
}