Cod sursa(job #2088442)
Utilizator | Data | 15 decembrie 2017 10:43:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,cnt;
char prim[2000005];
int main(){
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int i,j;
fin>>N;
for(i=2;i<=N;++i)
prim[i]=1;
for(i=2;i<=N;++i)
if(prim[i])
{
++cnt;
for(j=i+i;j<=N;j+=i)
prim[j]=0;
}
fout<<cnt;
return 0;
}