Cod sursa(job #702051)
| Utilizator | Data | 1 martie 2012 19:17:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
#define _NMAX 2000010
using namespace std;
int n;
bool compus[_NMAX];
int main()
{
FILE *f=fopen("ciur.in", "r");
fscanf(f,"%d",&n);
compus[2]=0;
for(int i=2;i<=n;i++)
if (!compus[i])
for(int k=i;k<=n/i;k++)
compus[i*k]=1;
int nPrime=0;
for(int i=2;i<=n;i++)
if (!compus[i]) nPrime++;
f=fopen("ciur.out", "w");
fprintf(f,"%d", nPrime);
}
