Cod sursa(job #2267999)
Utilizator | Data | 24 octombrie 2018 14:00:17 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int e[1000001];
int main() {
int n,i,j;
unsigned long long cate=0;
in>>n;
for(i=2; i<=n; i++)
e[i]=i;
for(i=2; i<=n; i++)
if(e[i]==i)
for(j=i; j<=n; j=j+i)
e[j]=e[j]/i*(i-1);
for(i=2; i<=n; i++)
cate=cate+e[i];
out<<cate*2+1;
return 0;
}