Cod sursa(job #1954993)
Utilizator | Data | 5 aprilie 2017 19:26:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur [2000001];
int main()
{
int N,j,i ,cnt = 0;
in>>N;
ciur[0]=ciur[1]=1;
for(i=2; i<=N; i++)
{
if(ciur[i]==0)
{
for(j=2*i; j<=N; j=j+i)
{
ciur[j]=1;
}
cnt++;
}
}
out<<cnt;
return 0;
}