Cod sursa(job #1007491)
Utilizator | Data | 8 octombrie 2013 22:53:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,j,i,nr;
bool a[2000004];
int main()
{
f>>n;
nr=0;
for (i=2;i<=n;i++)
a[i]=true;
for (i=2;i<=n;i++)
if (a[i]==true)
{
nr++;
for (j=i+i;j<=n;j+=i)
a[j]=false;
}
g<<nr<<'\n';
return 0;
}