Cod sursa(job #2772217)
| Utilizator | Data | 31 august 2021 12:46:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
bool c[2000005];
void ciur(int x){
int i,j;
c[0]=c[1]=1;
for(i=4;i<=x;i=i+2){
c[i]=1;
}
for(i=3;i*i<=x;i=i+2){
if(c[i]==0){
for(j=i*i;j<=x;j=j+2*i){
c[j]=1;
}
}
}
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,nr=0;
fin>>n;
ciur(n);
for(i=1;i<=n;++i){
if(c[i]==0){
++nr;
}
}
fout<<nr;
return 0;
}
