Cod sursa(job #2171851)
Utilizator | Data | 15 martie 2018 13:50:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,i,j,k;
bool ciur[2000100];
int main()
{
in>>n;
ciur[0]=ciur[1]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
for(j=2;i*j<=n;j++)
ciur[i*j]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0) k++;
out<<k;
return 0;
}