Cod sursa(job #2778387)
Utilizator | Data | 1 octombrie 2021 11:49:17 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
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");
const int maxN=1e6+1;
int e[maxN];
int main()
{
for(int i=2;i<maxN;i++)
e[i]=i;
for(int i=2;i<maxN;i++)
if(e[i]==i)
for(int j=i;j<maxN;j+=i)
e[j]=e[j]/i*(i-1);
int n, s=0;
in>>n;
for(int i=2;i<=n;i++)
s+=e[i];
s=2*s+1;
out<<s;
return 0;
}