Cod sursa(job #281652)

Utilizator moldo_razvanMoldovan Razvan moldo_razvan Data 15 martie 2009 16:26:39
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include<stdio.h>
#define NMax 10000
int main(void)
{
  freopen("ciur.in","r",stdin);
  freopen("ciur.out","w",stdout);
  
  
  long ciur[NMax],n,i,j;
  
  scanf("%ld",&n);
  for(i=2;i<n;i++)
    ciur[i]=1;
  for(i=2;i*i<=n;i++)
    if(ciur[i])
      for(j=2;j*i<n;j++)
         ciur[i*j]=0;
  for(i=2;i<n;i++)
    if(ciur[i])
    printf("%ld\n",i);
    
      
  
 return 0; 
}