Cod sursa(job #3186320)
| Utilizator | Data | 22 decembrie 2023 18:34:08 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int ciur[1000001];
void implciur(){
int d, j;
ciur[1]=1;
for(j=2;j<=1000001;j++){
ciur[j]=j;
}
for(j=2;j<=1000001;j++){
if(ciur[j]==j)
for(d=j;d<=1000001;d+=j){
ciur[d]/=j;
ciur[d]*=(j-1);
}
}
}
int main()
{
int n,x,i,p,div,j,cx;
long long s=0;
implciur();
fin>>n;
for(i=1;i<=n;i++){
s=s+ciur[i];
}
fout<<s*2-1;
return 0;
}
