Chapter 1: sum of three factorials, graph point scanning

    long fac2 (int x) 
 {
    
    int i; 
    long p=1;
    for (i=1;i<=x;i++) 
    
    	p*=i;
    	
	
        
    return (p);
 }
   int main()
   {
    
   	
   	  int a, b, c, m,n;
     printf("  The sum of three factorials has ：");
     for (a = 1; a <= 6; a++) 
     for (b = 0; b <= 6; b++) 
     for (c=0; c <= 6; c++)
     {
    
         m = a * 100 + b * 10 + c;
         n = fac2(a) + fac2(b) + fac2(c);
         if (m==n) printf ("%d \n", m) ;
     }
   	
   	
	} 
   

result ：

// Graph point scanning   Find the map area 
 int main()
{
     
	FILE *fp;
	char fname[50]; // The length of the file name is not greater than  50
	int i, j, x, y, k, s, w, t, a[12] [12] ;
	printf (" \n input file name: ");
	gets (fname);
	if ( (fp=fopen (fname, "r")) == NULL) 
	{
     
		printf( "The file was not opened n" ) ;
		return 0;
	}
	x = 11;
	y = 11;
	for (i=0; i <=y; ++i)
	{
    
	  printf("\n ");
   		for(j=0; j<=x;++j) 
		{
     
		 	fscanf(fp, "%d", &a[i][j]); //, Read data from file to 2D a Array 
			printf("%d ",a[i][j]);
		}
	}
		 		
	for(i = 0; i <= x ;++i)
	{
    
		 if(a[0][i] == 0)
		   a[0][i] = 2;
		   if(a[y][i] == 0)
		   a[y][i] = 2; 
   }
   	for(i = 1; i <= y ;++i)
	{
    
		 if(a[i][0] == 0)
		   a[i][0] = 2;
		   if(a[i][x] == 0)
		   a[i][x] = 2; 
    }
	t = x * y;
		 
		 for (k=1;k<t; ++k) 
		 {
    
		 	w = 0;
		 	for (i = 1; i < y; ++i)
		 	for( j = 1; j < x; ++j)
		 	if((a[i][j-1] == 2 || a[i][j+1] == 2 || a[i-1][j] == 2 || a[i+ 1][j] == 2) && a[i][j] == 0)
		 	{
    
		 		a[i][j] = 2;
		 		w = 1;
		    }
	      }
	s = 0;
	printf("\n ");	
	for(i = 0; i <= y; ++i)
	{
    
			printf("\n ");
			for(j = 0; j <= x; ++j)
			{
    
				if(a[i][j] == 0)  s += 1;
				printf("%d", a[i][j]);
			}
		
	} 		
	printf("\n s = %d\n", s); 		
	fclose(fp);
	return 0;
}

result ：

File path ：

The contents of the document ：

PS： There will be garbled code without spaces