Cod sursa(job #1502691)
Utilizator | Data | 14 octombrie 2015 22:09:18 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
using namespace std;
const int MAX = 1000005;
int x[MAX],n;
long long nr=1;
int main(){
ifstream in("fractii.in");
in>>n;
for(int i=2;i<=n;++i)
x[i] = i-1;
for(int i=2;i<=n;++i)
{
nr += 2*x[i];
for(int j=2*i;j<=n;j+=i)
x[j] -= x[i];
}
ofstream out("fractii.out");
out<<nr<<'\n';
return 0;
}