Cod sursa(job #1236589)
Utilizator | Data | 2 octombrie 2014 09:39:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long i,j,n,nr;
bool OK[2000000];
int main()
{
nr=0;
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;
return 0;
}