Cod sursa(job #305784)
Utilizator | Data | 18 aprilie 2009 16:22:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int nrp;
char p[2000002];
int main()
{
int n,i,j;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=1;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
{
if(p[i]==1)
{
nrp++;
for(j=i+i;j<=n;j+=i)
p[j]=0;
}
}
out<<nrp;
in.close();
out.close();
return 0;
}