Cod sursa(job #624195)
Utilizator | Data | 21 octombrie 2011 23:09:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
using namespace std;
#include <fstream>
unsigned long int n, k, i, j;
bool sir[2000000];
int main()
{
ifstream fin("ciur.in");
fin>>n;
fin.close();
//////////////////////////////
for(i=2;i<=n;i++)
{
if(sir[i]==0)
{
k++;
}
for(j=i+i;j<=n;j+=i)
sir[j]=1;
}
ofstream fout("ciur.out");
fout<<k;
fout.close();
return 0;
}