Cod sursa(job #1060755)
Utilizator | Data | 18 decembrie 2013 17:38:26 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
long phi[100000000/2/8+1];
int main()
{
freopen("fractii.in","r+",stdin);
freopen("fractii.out","w",stdout);
int i,j;
long n;
long long s=0;
cin>>n;
for(i=2; i<=n; i++)
phi[i]=i-1;
for(i=2; i<=n; i++)
{
s=s+phi[i];
for(j=2*i; j<=n; j=j+i)
{
phi[j]=phi[j]-phi[i];
}
}
cout<<2*s+1;
return 0;
}