Pagini recente » Cod sursa (job #175713) | Cod sursa (job #1661380) | Cod sursa (job #2277274) | Cod sursa (job #166441) | Cod sursa (job #1346360)
//#include <iostream>
#include <fstream>
#include<vector>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
long long n,i,j,s=1;
vector<pair<long long, long long> > v[1000000];
int main(){
cin>>n;
for(i=2;i<=n;i++){
if(v[i].size()>0){
continue;
}
for(j=i;j<=n;j+=i){
long long x=j,nr=0;
while(x%i==0){
nr++;
x/=i;
}
v[j].push_back(make_pair(i,nr));
}
}
for(i=2;i<=n;i++){
long long nr=1;
for(j=0;j<v[i].size();j++){
long long a=v[i][j].first;
long long b=v[i][j].second;
while(b>1){
nr*=a;
b--;
}
nr*=(a-1);
}
s+=2*nr;
}
cout<<s;
return 0;
}