Cod sursa(job #1498628)
Utilizator | Data | 8 octombrie 2015 21:04:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int main ()
{
unsigned long N,i,j,k;
bool v[2000025];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
k=0;
fin>>N;
for(i=2;i<=N;i++)
{
v[i]=1;
}
for(i=2;i<=N;i++)
{
if (v[i]!=0)
{
k++;
if(i*i>N) break;
for(int j=i*i;j<=N;j+=i)
{
v[j]=0;
}
}
}
fout<<k;
}