Cod sursa(job #1071796)
Utilizator | Data | 3 ianuarie 2014 14:57:09 | |
---|---|---|---|
Problema | Fractii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#define MAX 1000001
using namespace std;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
unsigned long long n,s=0,i,j,phi[MAX];
f>>n;
f.close();
for(i=1;i<=n;i++)
phi[i]=i-1;
for(i=2;i<=n;i++)
for(j=i<<1; j<=n; j+=i)
phi[j]-=phi[i];
for(i=1;i<=n;i++)
s+=phi[i];
s=(s<<1)+1;
g<<s;
g.close();
}