Cod sursa(job #2476772)
| Utilizator | Data | 19 octombrie 2019 11:25:53 | |
|---|---|---|---|
| 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 fin("fractii.in");
ofstream fout("fractii.out");
long long n,rez=1;
long long dp[1000005];
void sir()
{
dp[1]=1;
for(long long i=2; i<=n; i++)
dp[i]=i-1;
for(long long i=2; i<=n; i++)
{ rez=rez+(2*dp[i]);
for(long long j=2; j*i<=n; j++)
dp[i*j]-=dp[i];
}
fout<<rez;
}
int main()
{
fin>>n;
sir();
return 0;
}
