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