Cod sursa(job #1610894)
Utilizator | Data | 23 februarie 2016 20:00:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
int i,nrp;
char prim[2000001];
int main()
{
fin>>n;
prim[0]=prim[1]=1;
for (i=3; i<=n; i+=2)
if (i%2!=0&&!prim[i])
{
++nrp;
for (long j=2*i; j<=n; j+=i)
prim[j]=1;
}
fout<<nrp<<'\n';
}