Cod sursa(job #2913071)
Utilizator | Data | 12 iulie 2022 16:25:35 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long n, sum=1;
fin >> n;
int arr[n+1];
for(int i=1; i<=n; i++) arr[i]=i;
for(int i=2; i<=n; i++)
if(arr[i]==i)
{
arr[i]--;
for(int j=2; j*i<=n; j++)
{
arr[j*i]= arr[j*i]/i*(i-1);
}
}
for(int i=2; i<=n; i++) sum+=2*arr[i];
fout << sum;
}