Cod sursa(job #1899090)
Utilizator | Data | 2 martie 2017 15:23:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define nmax 2000001
int n,nr;
char prim[nmax];
int main()
{
fin>>n;
for(int i=2;i<n;i++)
prim[i]=1;
for(int i=2;i<n;i++)
if(prim[i])
{nr++;
for(int j=i+1;j<=n;j+=i)
prim[j]=0;}
fout<<nr;
return 0;
}