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