Cod sursa(job #2593092)
Utilizator | Data | 2 aprilie 2020 20:31:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,i,j,k;
bool ciur[2000001];
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for (i=2; i<=n; i++)
{
if (ciur[i]==0)
{
k++;
for (j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
}
fout<<k;
return 0;
}