Cod sursa(job #1959898)
Utilizator | Data | 10 aprilie 2017 00:24:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
#include <bitset>
using namespace std;
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
bitset<2000010> v;
int main()
{
int n,nr=0,d,i;
fscanf(f,"%d",&n);
for (d=2;d*d<=n;d++)
for (i=2;i*d<=n;i++)
v[i*d]=1;
for (i=2;i<=n;i++)
if (!v[i]) nr++;
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}