Cod sursa(job #1241047)
| Utilizator | Data | 12 octombrie 2014 15:34:24 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,v[2000001];
void vect(int n)
{
int i;
for(i=2;i<=n;i++)
v[i]=i;
}
int ciur(int n)
{
int d=2,nr=0;
while(d<=n)
{
int m=2;
nr++;
v[d]=0;
while(m*d<=n)
{
v[m*d]=0;
m++;
}
while(d<=n&&v[d]==0)
d++;
}
return nr;
}
int main()
{
f>>n;
vect(n);
g<<ciur(n);
return 0;
}
