Cod sursa(job #1168550)
Utilizator | Data | 8 aprilie 2014 21:52:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ok[2000003];
int n,i,nr,j;
int main()
{
f>>n;
ok[2]=true;
for(i=1;i<=n;i+=2)
ok[i]=true;
ok[1]=false;
for(i=3; i*i<=n; i+=2)
if(ok[i]==true)
for(j=2*i; j<=n; j+=i)
ok[j]=false;
for(i=1;i<=n;i++)
{
if(ok[i]==true)
nr++;
}
g<<nr;
return 0;
}