Cod sursa(job #919860)
Utilizator | Data | 19 martie 2013 21:07:47 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long n,k,phi[10000001];
int main() {
f>>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];
g<<2*k+1;
}