Cod sursa(job #632055)
| Utilizator | Data | 10 noiembrie 2011 10:35:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
char v[2000000];
void parcurgere(int x,int i)
{
while(x<=n)
{
v[x]=1;
x=x+2*i;
}
}
int main()
{
int i,nr=1;
f>>n;
f.close();
for(i=1;i<=n;i++)
v[i]=0;
for(i=3;i<=n;i=i+2)
if(v[i]==0)
{
nr++;
parcurgere(i,i);
}
g<<nr;
g.close();
return 0;
}