Cod sursa(job #2783697)
Utilizator | Data | 14 octombrie 2021 21:26:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,k,i,j;
bitset<2000000> p;
int main()
{
f>>n;
p[1]=p[0]=1;
for(i=2;ii<=n;i++)
if(p[i]==0){
for(j=ii;j<=n;j+=i)
p[j]=1;
}
for(i=2;i<=n;i++)
if(p[i]==0)
k++;
g<<k;
return 0;
}