Cod sursa(job #1731415)
Utilizator | Data | 18 iulie 2016 21:55:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset <2000001> A ;
ifstream fin("ciur.in") ;
ofstream fout("ciur.out") ;
int main()
{
int n ;
fin >> n ;
int cnt = 0 ;
for(int i = 2 ; i <= n ; ++ i)
{
if(A[i] == 0)
cnt ++ ;
for(int j = i + i ; j <= n; j = j + i)
A[j] = 1 ;
}
fout << cnt ;
return 0;
}