Cod sursa(job #572217)
Utilizator | Data | 5 aprilie 2011 09:33:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
int n,i,j,p;
bool prim[2000001];
int main()
{
ifstream fi("ciur.in");
ofstream fo("ciur.out");
fi>>n;
for(i=2;i<=n;i++)
if(!prim[i])
{
p++;
for(j=i*2;j<=n;j+=i) prim[j]=1;
}
fo<<p<<"\n";
return 0;
}