Cod sursa(job #1537982)
Utilizator | Data | 28 noiembrie 2015 12:50:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main ()
{
int n,i,j, cont=0;
in>>n;
for (i=2;i<=n;i++)
{
if (v[i] == 0)
cont++;
{
for(j=i+i;j <= n;j=j+i)
v[j] = 1;
}
}
out<<cont;
}