Cod sursa(job #305384)
Utilizator | Data | 17 aprilie 2009 01:17:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
#define IMAX 2000000
using namespace std;
char a[IMAX];
int main()
{
ifstream f ("ciur.in");
ofstream o ("ciur.out");
long n,i,j,nrsol=0;
f>>n;
for(i=2;i<=n;i++)
a[i]='1';
a[1]='0';
for(i=2;i<=n;i++)
if(a[i]=='1')
{ nrsol ++;
for(j=i+i;j<=n;j=j+i)
a[j]='0';
}
o<<nrsol<<"\n";
return 0;}