Cod sursa(job #2087237)
| Utilizator | Data | 13 decembrie 2017 10:31:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000005];
int n,i,j,nr;
int main()
{
in>>n;
ciur[0] = ciur[1] = 1;
for(i=4;i<=2000005;i+=2) ciur[i] = 1;
for(i=3;i*i<=2000005;i+=2)
for(j=i;j*i<=2000005;j+=2)
ciur[i*j] = 1;
for(i=1;i<=n;i++)
if(ciur[i]==0) ++nr;
out<<nr;
return 0;
}
