Cod sursa(job #1905643)
Utilizator | Data | 6 martie 2017 09:55:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i,j;
bool ciur[2000000],n,nr;
int main()
{
fin>>n;
ciur[1]=1;
for(i=2;i<=n;i++){
if(ciur[i]==0){
nr++;
for(j=i;j<=n;j=j+i)
ciur[j]=1;
}
}
fout<<nr;
}