Cod sursa(job #2364544)
Utilizator | Data | 4 martie 2019 09:37:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, nr, i, j;
int main()
{
fin>>n;
int ciur[n+2];
for (i=2; i<=n; i++)
ciur[i]=0;
for (i=2; i<=n; i++)
if (ciur[i]==0)
{
nr++;
for (j=2; i*j<=n; j++)
ciur[i*j]=1;
}
fout<<nr;
return 0;
}