Cod sursa(job #1239120)
Utilizator | Data | 8 octombrie 2014 11:55:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
bool c[100000];
using namespace std;
int main()
{
FILE *in,*out;
in=fopen("ciur.in","r");
out=fopen("ciur.out","w");
int i,j,n,nr=0;
fscanf(in,"%d",&n);
for(i=2; i*i<=n; i++)
{
if(!c[i])
for(j=i*i; j<=n; j+=i)
c[j]=true;
}
for(i=2; i<=n; i++)
{
if(!c[i])
nr++;
}
fprintf(out,"%d",nr);
return 0;
}