Cod sursa(job #2692597)
Utilizator | Data | 3 ianuarie 2021 12:13:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<cstring>
#include<string.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n,*ciur,nr=0;
fin >> n;
ciur = new int[n + 1];
memset(ciur, 0, sizeof(int)*(n + 1));
for (int i = 2; i <= n; i++)
if (ciur[i] == 0)
{
nr++;
for (int j = i * i; j <= n; j += i)
ciur[j] = 1;
}
delete[] ciur;
fout << nr;
}