Cod sursa(job #2089425)
Utilizator | Data | 16 decembrie 2017 15:09:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool vec[2000005];
int main()
{
int numar;
long long nr_prime=1;
in >> numar;
for(int i=3; i<=numar; i+=2)
if(vec[i]==0)
{
nr_prime++;
for(int j=i+i+i; j<=numar; j+=i+i)
vec[j]=1;
}
out << nr_prime;
return 0;
}