Cod sursa(job #1007430)
Utilizator | Data | 8 octombrie 2013 21:57:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,j,i,nr,a[200004];
bool ok;
int main()
{
f>>n;
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=j+i)
a[j]=false;
}
}
g<<nr<<'\n';
return 0;
}