Cod sursa(job #1572128)
Utilizator | Data | 18 ianuarie 2016 19:28:39 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
#define MAXN 2000001
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int phi[MAXN];
int main ()
{
int n; fin>>n;
for (int i=1; i<=n; ++i)
phi[i] = i-1;
for (int i=2; i<=n; ++i)
for (int j=2*i; j<=n; j+=i)
phi[j] -= phi[i];
fout<<phi[n];
return 0;
}