围圈回文

----围圈回文----

#include<stdio.h>
int main()
{
	int n = 0, m = 0, x = 0;
	int i = 0, k = 1, count[100];
	char arr[8] = {'1','l','e','v','e','l','1'}, ch[100];//"1level1"
	
	scanf("%d %d", &n, &m);
	
	for( i = 0; i <= n; i++)
	{
		count[i] = i + 1;
	}
		
	while( x < 7)
	{
		
		for(i = 0; i < n; i++)
		{
			if( count[i] != 0)
			{
				if( k == m )//当整除m时进入if
				{
					count[ i ] = 0;
					ch[ i ] = arr[ x ]; //定位i与ch[i]
					k = 0;
					x++;
					if( x == 7)
					{
						goto Loop;//跳出循环
					}
				}
				k++;
			}
		}
	
	}
Loop:
	for( i = 0; i < 7 * m; i++)
	{
		if( count[i] == 0)
		{
			printf("%d %c\n", i + 1, ch[i]);
		}
		if( n < 7 * m && i == n - n % m)//当等于取出的数中最大的数就结束
			{
				return 0;
			}
	}
	return 0;
}