Cod sursa(job #928673)
Utilizator | Data | 26 martie 2013 16:57:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n,i,k,v[2000001],nr=0,x;
bool ok;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
v[1]=2;nr=1;
for (i=3;i<=n;i+=2)
{
ok=true;
for (k=1;k<=nr&&v[i]*v[i]<=x;k++)
if (i%v[k]==0){ok=false;break;}
if (ok==true) v[++nr]=i;
}
g << nr;
return 0;
}