Cod sursa(job #1082163)
Utilizator | Data | 14 ianuarie 2014 11:36:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,k=1; bitset <2000001>V;
void Ciur()
{
for(int i=3;i<=N; i+=2)
{
if(!V[i])
{
for(int j=i; j<=N; j+=i)
V[j]=1;
k++;
}
}
}
int main()
{
fin>>N;
Ciur();
fout<<k;
}