Cod sursa(job #1189388)
Utilizator | Data | 22 mai 2014 18:09:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#define NMax 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int c,i,j,n;
char a[NMax];
int main()
{f>>n;
for (i=2;i*i<=n;i++)
if (!a[i])
for (j=2*i;j<=n;j+=i)
a[j]++;
for (i=2;i<=n;i++)
if (!a[i]) c++;
g<<c;
return 0;
}