Cod sursa(job #1438529)
Utilizator | Data | 20 mai 2015 10:32:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
bool ciur[2000001];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int i,j,c=0,N;
in>>N;
for(i=2;i<=N;i++)
ciur[i]=1;
for(i=2;i<=N;i++)
if(ciur[i])
{
c++;
for(j=2*i;j<=N;j=j+i)
ciur[j]=0;
}
out<<c;
return 0;
}