Pagini recente » Cod sursa (job #125783) | Cod sursa (job #1406795) | Cod sursa (job #1282131) | Cod sursa (job #332579) | Cod sursa (job #201303)
Cod sursa(job #201303)
#include<stdio.h>
#include<math.h>
#define MAX 2000005
int a[67000];
int main(){
FILE *fin=fopen("ciur.in","r");
FILE *fout=fopen("ciur.out","w");
int N,k=0;
fscanf(fin,"%d",&N);
++k;
int i=2;
for(int j=2;(long long)i*j<=N;j++) a[i*j/30]=a[i*j/30]|(1<<((i*j)%30));
for(i=3;i<=N;i+=2)
if(a[i/30]&(1<<(i%30))==0){
k++;
for(int j=i;(long long)j*i<=N;j+=2) a[i*j/30]=a[i*j/30]|(1<<((i*j)%30));
}
fprintf(fout,"%d\n",k);
fclose(fin);
fclose(fout);
return 0;
}