Cod sursa(job #2453346)
Utilizator | Data | 3 septembrie 2019 14:41:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt;
char prim[NMAX];
int main()
{
fin>>n;
int i,j;
for(i=2;i<=n;i++)
{
prim[i]=1;
}
for(i=2;i<=n;i++)
{
if(prim[i])
{
cnt++;
for(j=i+i;j<=n;j+=i) prim[j]=0;
}
}
fout<<cnt;
return 0;
}