Cod sursa(job #712696)
Utilizator | Data | 13 martie 2012 18:42:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prime[2000005];
int main()
{
int n, contor=0, i, j;
f>>n;
for(i=2; i<=n; i++)
{
prime[i]=true;
}
for(i=2; i<=n; i++)
{
if(prime[i])
{
contor++;
for(j=i+i; j<=n; j+=i)
prime[j]=false;
}
}
g<<contor;
}