Cod sursa(job #2580420)
Utilizator | Data | 13 martie 2020 16:40:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset<2000000> v;
int main()
{
int n,ct=0;
in>>n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{
for(int j=2*i;j<=n;j+=i)
v[j]=1;
ct++;
}
}
out<<ct<<"\n";
return 0;
}