Cod sursa(job #2446202)
| Utilizator | Data | 7 august 2019 14:17:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
char ciur[2000001];
int n,nr=0;
fin >> n;
ciur[1]='1';
for (int i=2;i<=n;i++)
{
ciur[i]='0';
}
for (int i=2;i*i<=n;i++)
{
if (ciur[i]=='0')
{
for (int j=i*i;j<=n;j+=i)
{
ciur[j]='1';
}
}
}
for (int i=1;i<=n;i++)
{
if (ciur[i]=='0') nr++;
}
fout << nr;
}
