Pagini recente » Cod sursa (job #1124528) | Cod sursa (job #961759) | Cod sursa (job #1205960) | Cod sursa (job #76348) | Cod sursa (job #913483)
Cod sursa(job #913483)
#include <fstream>
#define nmax 1000100
#define Prime(x) (Phi[x]==x)
using namespace std;
int N,Phi[nmax];
long long Answer;
void solve() {
int i,j;
for(i=1;i<=N;Phi[i]=i++);
for(i=2;i<=N;i++)
if(Prime(i))
for(j=i;j<=N;j+=i)
Phi[j]=Phi[j]/i*(i-1);
for(i=2;i<=N;i++)
Answer+=Phi[i];
Answer=1+(Answer<<1);
}
void read() {
ifstream in("fractii.in");
in>>N;
in.close();
}
void write() {
ofstream out("fractii.out");
out<<Answer<<'\n';
out.close();
}
int main() {
read();
solve();
write();
return 0;
}