Cod sursa(job #789037)
Utilizator | Data | 16 septembrie 2012 16:57:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,k,v[2000001];
int main()
{
f>>n;
for (i=2;i<=n;i++)
if (v[i]==0)
for (j=2*i;j<=n;j=j+i)
v[j]=1;
for (i=2;i<=n;i++)
if (v[i]==0) k++;
g<<k;
f.close();
g.close();
return 0;
}