Cod sursa(job #3038016)
Utilizator | Data | 26 martie 2023 19:01:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur");
ofstream fout("ciur");
int n,prim[2000001],cnt=0;
int main(){
fin>>n;
for(int i=2;i<=n;i++){
if(prim[i]==0){
cnt++;
for(int j=2;j<=n/i;j++)
prim[i*j]=1;
}
}
fout<<cnt;
return 0;
}