Cod sursa(job #2780915)
Utilizator | Data | 8 octombrie 2021 09:49:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset<2000000> a;
int main()
{
long long n, i, j, cnt=0;
in>>n;
a[0]=a[1]=1;
for(i=2; i<=n; ++i){
if(a[i]==0){
for(j=i*i; j<=n; j+=i){
a[j]=1;
}
}
}
for(i=2; i<=n; ++i){
if(a[i]==0){
cnt++;
}
}
out<<cnt;
return 0;
}