Cod sursa(job #1829602)
Utilizator | Data | 15 decembrie 2016 13:15:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <bitset>
using namespace std;
FILE *f,*g;
bitset <2000002> v;
int main()
{
int n,i,j,nrp=0;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i*2;j<=n;j+=i)
{
v[j]=1;
}
nrp++;
}
}
fprintf(g,"%d",nrp);
return 0;
}