Cod sursa(job #1011055)
Utilizator | Data | 16 octombrie 2013 09:36:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000000],n;
int main ()
{
f>>n;
for (i=2; i*i<=n;i++)
if (v[i]==0)
for (j=i*i;j<=n;j=j+i)
v[i]=1;
k=0;
for (i=2;i<=n;i++)
if (v[i]==0) k++;
g<<k;
}