Cod sursa(job #2291120)
| Utilizator | Data | 27 noiembrie 2018 17:08:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
unsigned long k;
int n;
bool a[2000000];
void afisare()
{
for(int i=2;i<=n;i++)
{
if(i%100!=0) fout<<a[i]<<" ";
if(i%100==0) fout<<'\n';
}
}
int main()
{
fin>>n;
for(int i =2;i<sqrt(n);i++)
if(!a[i])
for(int j=i*i;j<n;j+=i)
a[j]=1;
//afisare();
for(int i=2;i<n;i++)
if(a[i]==0) k++;
fout<<k;
}
