Cod sursa(job #1236592)
Utilizator | Data | 2 octombrie 2014 09:41:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,j,nr=0;
bool ok[2000000];
int main()
{
f>>n;
for (i=2;i<=n;i++)
{
ok[i]=true;
}
for (i=2;i*i<=n;i++)
{
if (ok[i])
{
for (j=2*i;j<=n;j+=i)
{
ok[j]=false;
}
}
}
for (i=2;i<=n;i++)
{
if (ok[i]==true)
{
nr++;
}
}
g<<nr;
}