Cod sursa(job #2246629)
Utilizator | Data | 27 septembrie 2018 11:48:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int eprim[2000005], n, k;
int main()
{
fin>>n;
for(int i=2; i<=n; ++i)
eprim[i]=1;
for(int i=2; i<=n; ++i){
if(eprim[i]==0){
k++;
for(int j=i+i; j<=n; j+=i){
eprim[j]=0;
}
}
}
fout<<k;
return 0;
}