Cod sursa(job #1133015)
| Utilizator | Data | 4 martie 2014 11:42:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <iostream>
#include <bitset>
#define NMax 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
int x=0;
bitset<NMax> C;
void generareCiur()
{
C[0]=C[1]=1;
for (int i=2;i<=n;i++)
C[i]=1;
for (int i=2;i<=n;i++)
if (C[i]==1)
{
x++;
for (int j=i+i;j<=n;j+=i)
C[j]=0;
}
}
void afisare()
{
g<<x<<'\n';
g.close();
}
int main()
{
f>>n;
f.close();
generareCiur();
afisare();
return 0;
}
