Cod sursa(job #2761707)
Utilizator | Data | 3 iulie 2021 16:11:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, nr;
bool ciur[2000001];
int main()
{
fin>>n;
for(int i=2; i<=n; i++)
{
if(ciur[i]==0)
{
nr++;
for(int j=2; i*j<=n; j++)
ciur[i*j]=1;
}
}
fout<<nr;
return 0;
}