Cod sursa(job #154396)
Utilizator | Data | 11 martie 2008 10:12:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char ciur[2000001];
int c=0,n,i,j;
int main()
{
f>>n;
for(i=2;i<=n;ciur[i]='1',i++);
for(i=2;i<=n;i++)
if (ciur[i]=='1')
{
c++;
for(int j=2;j*i<=n;j++)
ciur[i*j]='0';
}
g<<c;
f.close();
g.close();
return 0;
}