Cod sursa(job #1403714)
Utilizator | Data | 27 martie 2015 15:36:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000005];
int main()
{
int n,cont=0,i,j;
f>>n;
for (i=2;i<=sqrt(n);i++)
{
if (v[i]==0)
for(j=i*2;j<=n;j=j+i)
v[j]=1;
}
for (i=2;i<=n;i++){
if(v[i]==0) cont++;
}
g<<cont;
return 0;
}