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