Cod sursa(job #927124)
Utilizator | Data | 25 martie 2013 16:37:15 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
long long n,k,phi[1000010];
int main() {
in>>n;
for(int i=1;i<=n;i++) phi[i]=i;
for(int i=2;i<=n;i++)
if(phi[i]==i)
for(int j=i;j<=n;j+=i) phi[j]/=i,phi[j]*=(i-1);
for(int i=2;i<=n;i++)
k+=phi[i];
out<<2*k+1;
}