Cod sursa(job #2964552)
Utilizator | Data | 13 ianuarie 2023 10:41:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int C[2000005];
int n,sol;
int main()
{
int i,j;
fin >> n;
C[1]=1;
for(i=4;i<=n;i+=2) C[i]=1;
for(i=3;i<=n;i+=2){
if(C[i]==0){
for(j=i*i;j<=n;j+=2*i){
C[j]=1;
}
}
}
for(i=1;i<=n;i++) sol+=(C[i]==0);
fout << sol;
return 0;
}