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