Cod sursa(job #3343393)
| Utilizator | Data | 27 februarie 2026 12:14:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <bitset>
#define nmax (int)(2e6+1)
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n,sol;
bitset<nmax>ciur;
int main()
{
cin>>n;
for(int i=2;i<=n;i++)
if(!ciur[i]){
sol++;
for(int j=2*i;j<=n;j+=i)
ciur[j]=1;
}
cout<<sol;
return 0;
}
