Cod sursa(job #1281867)
Utilizator | Data | 3 decembrie 2014 20:04:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char prim[nmax];
int n;
int i,j ;
int nr;
int main()
{
fin>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
nr++;
for(j=i*i;j<=n;j+=i)
prim[j]=0;
}
fout<<nr;
return 0;
}