Cod sursa(job #1168625)
Utilizator | Data | 9 aprilie 2014 08:12:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 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;
for(i=3;i<=n;i+=2)
if(ok[i]==true)
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;
}