Cod sursa(job #2004040)
Utilizator | Data | 24 iulie 2017 19:06:11 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int main()
{
long n;
in>>n;
long phi[n+1];
for(long i=1;i<=n;i++)
phi[i]=i-1;
for(long i=1;i<=n;i++)
for(long j=i*2;j<=n;j=j+i)
phi[j]=phi[j]-phi[i];
long s=0;
for(int i=1;i<=n;i++)
s=s+phi[i];
out<<s*2+1;
}