Cod sursa(job #599144)
| Utilizator | Data | 28 iunie 2011 03:39:19 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#define nmax 1000002
using namespace std;
long n, k=0;
long p[nmax];
void citire(){
ifstream in("fractii.in");
in >> n;
in.close();
}
void afis(){
for(long i=1;i<=n;++i) k+=p[i];
k*=2;
++k;
//ofstream out("fractii.out");
cout << k;
//out.close();
}
void cerne(){
for (long i = 1; i <= n; ++i)
p[i] = i-1;
for (long i = 2; i <= n; ++i)
for (long j = 2*i; j <= n; j += i)
p[j] -= p[i];
}
int main()
{
citire();
cerne();
afis();
return 0;
}
