Cod sursa(job #1926731)
Utilizator | Data | 14 martie 2017 17:26:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
bitset <2000003> a;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n=0, c=0;
f>>n;
a[1]=1;
for(int i=2; i<=n; ++i)
if(a[i]==0)
for(int j=i+i; j<=n; j+=i)
a[i]=1;
for(int i=2; i<=n; ++i)
if(a[i]==1) c++;
g<<c;
return 0;
}