找出一定范围的素数和大数分解

/*
    找出素数
    $ gcc -o prime prime.c
    $ ./prime 1000
*/

#include <stdio.h>

int main( int argc,char** argv ){

    long int i,n;
    long int line = 0;
    long int num = 0;
    
    for( n = 3;n <= atoi(argv[1]); n++ ){
        if( line >= 10 ){
        
            printf("\n");	
        	  line = 0;
        }
        
        for( i = 2; i <= n; i++ ){
            	if( n%i == 0 ) break;
        }	
        
        if( i == n ){
            printf( "%ld ",n );
            num += 1;
            line += 1;	
        }
    }
    printf( "\nFind : %ld:\n",num);	
}

 大数分解

/*
   大数分解
*/
#include <stdio.h>

int fenjiezhiyinshu(long long int large);
int main ()
{
 long long large;
 printf("Large integer=");
 scanf("%lld",&large);
 fenjiezhiyinshu(large);
 puts("1");
 return 0; 
} 

int fenjiezhiyinshu(long long int large)
{
 long long i;
 for(i=2;i<=large;i++)
 {
  if(large%i==0)
  {
   printf("%lld*",i);
   fenjiezhiyinshu(large/i); 
   break;
  }
  
 }
 return 0;
}

factordb.comhttp://factordb.com/index.php?query=9998000099