Cod sursa(job #3122156)
Utilizator | Data | 17 aprilie 2023 16:14:57 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream F("fractii.in");
ofstream G("fractii.out");
long long ciur[1000001];
long long n,nr;
int main()
{
F>>n;
for (int i=1;i<=n;i++)
ciur[i]=i;
for(int i=2; i<=n; i++)
if(ciur[i]==i)
{
for(int j=i; j<=n; j+=i)
ciur[j]=ciur[j]/i*(i-1);
}
for(int i=1; i<=n; i++)
nr+=ciur[i];
G<<nr*2-1;
}