Cod sursa(job #3342866)
| Utilizator | Data | 25 februarie 2026 22:23:28 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
int n;
fin>>n;
long long sum=0;
vector<long> p(n+1);
for(int i=1;i<=n;i++)
p[i]=i;
for(int i=2;i<=n;i++)
if(p[i]==i)
for(int j=i;j<=n;j+=i)
p[j]=p[j]/i*(i-1);
for(int i=1;i<=n;i++)
sum+=p[i];
fout<<2*sum-1;
return 0;
}
