Problem a: face recognition

Problem A: Face recognition
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 3853 Solved: 2258
Description
Google The company launched artificial intelligence , Baidu is not willing to fall behind , On the strongest brain show , Baidu's robot Xiaodu had a face recognition competition with Wang Feng , The result is small to 3：2 Beat Wang Feng .
Now you need to print out a face . Now the face shape is very simple , It consists of two squares , A small square was dug in the middle of a large square .

Input
Multiple sets of test data , Input for each group 2 It's an integer , Are the side lengths of the big square and the small square respectively

Output
Output the corresponding face shape

Sample Input
6 2
Sample Output

#include <stdio.h>

int main() 
{
    
	int m,n;
	while (scanf("%d%d",&m,&n) != EOF)
	{
    
		// Print in several parts 
		int i,j;
		for (i = 0;i < (m-n)/2;i++)// Print the number of lines in front of the small square 
		{
    
			for (j = 0;j < m-1;j++)
			{
    
				printf("*");
			}
			printf("*\n");
		}
		for (i = 0;i < n;i++)
		{
    
			for (j = 0;j<(m-n)/2;j++)// Print... To the left of the small square *
			{
    
				printf("*");
			}
			for (j = 0;j < n;j++)// Print small squares 
			{
    
				printf(" ");
			}
			for (j = 0;j<(m-n)/2;j++)// Print... To the right of the small square *
			{
    
				printf("*");
			}
			printf("\n");
		}
		for (i = 0;i < (m-n)/2;i++)// Print the number of lines behind the small square 
		{
    
			for (j = 0;j < m-1;j++)
			{
    
				printf("*");
			}
			printf("*\n");
		}
	}
	return 0;
}

This question , It's usually a cycle , But with 2 Dimension group is also feasible , Please refer to this article
https://blog.csdn.net/zstuyyyyccccbbbb/article/details/103827996