Cod sursa(job #2675106)

Utilizator IvanAndreiIvan Andrei IvanAndrei Data 21 noiembrie 2020 10:06:51
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int maxN=1000001;
bool notprime[maxN];
int main()
{
    int n, cnt;
    in>>n;
    for(cnt=2;cnt<=n;cnt++)
    {
        for(int div=2;div<n;div++)
        {
            if(notprime[div])
                continue;
            for(int i=2*div;i<=n;i+=div)
                notprime[i]=true;
        }
    }
    cnt=0;
    for(int i=2;i<=n;i++)
        if(notprime[i]==false)
            cnt++;
    out<<cnt;
    return 0;
}