Pagini recente » Cod sursa (job #679419) | Cod sursa (job #2356873) | Cod sursa (job #2356872) | Cod sursa (job #2460067) | Cod sursa (job #3342866)
#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;
}