Pagini recente » Istoria paginii runda/ioi_2020 | Cod sursa (job #1079663) | Cod sursa (job #1921835) | Cod sursa (job #1045377) | Cod sursa (job #1699434)
#include <cstdio>
using namespace std;
const int NMAX = 1000005;
int phi[NMAX];
int main(void) {
FILE *fi = fopen("fractii.in","r");
FILE *fo = fopen("fractii.out","w");
int n, ans;
fscanf(fi,"%d",&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]=phi[j]*(i-1)/i;
ans = 0;
for(int i=1; i<=n; ++i)
ans+=phi[i];
fprintf(fo,"%d\n",2*ans-1);
fclose(fi);
fclose(fo);
return 0;
}