Pagini recente » Cod sursa (job #1684863) | Cod sursa (job #2764316) | Cod sursa (job #1676994) | Cod sursa (job #408644) | Cod sursa (job #37311)
Cod sursa(job #37311)
#include<stdio.h>
int nr[1000020],prim[90000];
int main(){
FILE*in=fopen("fractii.in","r");
FILE*out=fopen("fractii.out","w");
int n,i,j,pr,m,i1;
fscanf(in,"%d",&n);
if(n==1){
fprintf(out,"1\n");
return 0;
}
if(n==2){
fprintf(out,"3\n");
return 0;
}
i=4;
while(i<=n){
nr[i]=1;
i=i+2;
}
for(i=3;i<=n+10;i=i+2){
pr=1;
if(nr[i]==0){
for(j=3;((j*j<=i)&&(pr));j=j+2){
if(i%j==0)
pr=0;
}
if(pr){
j=i+i;
while(j<=n+10){
nr[j]=1;
j=j+i;
}
}
}
}
prim[0]=2;
j=1;
for(i=3;i<=n+10;i=i+2){
if(nr[i]==0){
prim[j]=i;
j++;
}
}
int s=0;
m=0;
for(i=2;i<=n;i++){
if(i<prim[m]){
j=0;
pr=i;
i1=i;
while((prim[j]<=i/2)&&(i1>1)){
if(i%prim[j]==0){
pr=(pr/prim[j])*(prim[j]-1);
while(i1%prim[j]==0)
i1=i1/prim[j];
}
j++;
}
s=s+pr;
}
if(i==prim[m]){
s=s+prim[m]-1;
m++;
}
}
s=1+2*s;
fprintf(out,"%d\n",s);
return 0;
}