Cod sursa(job #1311045)
Utilizator | Data | 7 ianuarie 2015 17:31:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long int n,nr,i,j;
bool prim[200000001];
int main(){
fin>>n;
prim[0]=1;
prim[1]=1;
for(i=2;i<=n;i++) if(prim[i]==0) for(j=2;j<=n/i;j++) prim[i*j]=1;
for(i=2;i<=n;i++) if(prim[i]==0) nr++;
fout<<nr;
}