Pagini recente » Cod sursa (job #1637256) | Cod sursa (job #266061) | Cod sursa (job #822371) | Cod sursa (job #664364) | Cod sursa (job #1843798)
#include<iostream>
#include<stdio.h>
int n;
bool a[1000001];
void ciur(int n){
for(int i=2;i<=n;i++){
if(!a[i]){
for(int j=2*i;j<=n;j+=i){
a[j]=1;
}
}
}
}
int totient(int q){
int i=2,p=0;
printf("%d %d\n",q,p);
while(q!=1){
if(q%i==0){
p+=i-1;
q/=i;
}else i++;
}
printf("%d %d\n",q,p);
return p;
}
int main(){
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%d",&n);
ciur(n+1);
long long x,x2=0;
x=n+n-1;
for(int i=2;i<=n;i++){
if(!a[i]){
//printf("%d %d\n",i,i-2);
x2+=i-2;
}else{
//printf("%d %d\n",i,i/2-1);
x2+=i/2-1;
}
}
x+=2*x2;
printf("%d",x);
}