Cod sursa(job #1967968)
Utilizator | Data | 17 aprilie 2017 13:01:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <bitset>
using namespace std;
bitset <1000000> a;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int nrtot=0;
for (int i=2; i<=n; i++)
{
if (a[i]==0) nrtot++;
for (int j=i*2; j<=n; j+=i)
a[j]=1;
}
g << nrtot;
return 0;
}