Cod sursa(job #733018)
Utilizator | Data | 11 aprilie 2012 12:42:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
long long n,i,j,nr=1;
bool p[1001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=(n-1)/2;i++)
if(p[i]==0)
for(j=i*2*(i+1);j<=(n-1)/2;j+=i*2+1)
p[j]=1;
for(i=1;i<=(n-1)/2;i++)
if (p[i]==0)
nr++;
g<<nr;
return 0;
}