Cod sursa(job #615596)
Utilizator | Data | 10 octombrie 2011 10:27:16 | |
---|---|---|---|
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");
bool c[2000001];
int main()
{
int n,i,j,k=0;
in>>n;
for (i=2;i*i<=n;i++)
{
if(!c[i])
{
for (j=i*i;j<=n;j+=i)
{
c[j]=true;
}
}
}
for (i=2;i<=n;i++)
{
if(!c[i])
{
k++;
}
}
out<<k;
return 0;
}