Cod sursa(job #2601647)
Utilizator | Data | 14 aprilie 2020 21:15:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,contprime,prim[NMAX];
int main()
{
int i,j;
fin>>n;
for(i=2; i<=n; i++)
prim[i]=1;
for(i=2; i<=n; i++)
if(prim[i]==1)
{
contprime++;
for(j=i+i; j<=n; j=j+i)
prim[j]=0;
}
fout<<contprime;
return 0;
}