Cod sursa(job #2232188)
Utilizator | Data | 17 august 2018 18:22:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#define MAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[MAX];
int n,nr;
int i,j;
int main(){
f>>n;
nr=1;
for(i=3 ; i<=n ; i+=2)
prim[i]=1;
for(i=3 ; i<=n ; i+=2)
if(prim[i])
{
++nr;
for(j=i+i ; j<=n ; j+=i)
prim[j]=0;
}
g<<nr<<'\n';
return 0;
}