Cod sursa(job #1040405)
| Utilizator | Data | 24 noiembrie 2013 14:59:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
char V[2100000];
int main()
{
int i,j,n,k=0;
in>>n;
for (i=2;i<=n;i++)
{
if (V[i]==1)
continue;
k++;
for (j =i*i;j<=n;j+=i)
V[j]=1;
}
out<<k;
return 0;
}
