Cod sursa(job #244879)
Utilizator | Data | 16 ianuarie 2009 11:02:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
char ciur[2000005];
int i,j,k;
long n;
int main()
{
f>>n;
for(i=2;i*i<=n;i++)
if(!ciur[i])
{
j=2;
while(i*j<=n) ciur[i*j]='1', j++;
}
for(i=2;i<=n;i++)
if(!ciur[i]) k++;
g<<k;
return 0;
}