Cod sursa(job #738634)
| Utilizator | Data | 21 aprilie 2012 11:07:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
FILE *f = fopen("ciur.in", "r");
freopen("ciur.out", "w", stdout);
int n;
fscanf(f, "%d", &n);
short *a = new short[n+1];
for(int i = 2; i <= n; i++)
a[i] = 1;
int nr = 0;
for(int i = 2; i <= n; i++)
if(a[i] == 1)
{
for(int j = i+i; j <= n; j+=i)
a[j] = 0;
nr++;
}
cout << nr;
return 0;
}
