Cod sursa(job #1136292)
Utilizator | Data | 9 martie 2014 01:37:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
bool ciur[2000010];
long int n,i,j,k;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
{
k++;
for(j=i+i;j<=n;j+=i)
ciur[j]=1;
}
}
g<<k<<'\n';
f.close();g.close();
return 0;
}