题目不难，关键是理解题意，详细见注释。

#include <iostream>
#include <cstring>
using namespace std;
const int MAXL = 205;

int matrix[MAXL][MAXL]; //矩阵
int rule[2][MAXL]; //“规则”
int fly[2][MAXL]; //“飞数”

int main()
{
	int M, N;
	while (cin >> M >> N)
	{
		memset(matrix, 0, sizeof(matrix));
		memset(rule, 0, sizeof(rule));
		memset(fly, 0, sizeof(fly));

		//将“规则”和“飞数”存入对应数组
		for (int i = 0; i < M; i++)
			cin >> rule[0][i];
		for (int i = 0; i < M; i++)
			cin >> rule[1][i];
		for (int i = 0; i < N; i++)
			cin >> fly[0][i];
		for (int i = 0; i < N; i++)
			cin >> fly[1][i];

		int sum = 0; //第一列到最后一列移动的总距离
		for (int i = 0; i < N; i++)
		{
			sum += fly[0][i] * fly[1][i];
		}
		if (sum != 0) //距离不为0，则最后一列和第一列不同
		{
			cout << "Can not make beautilful cloth !" << endl;
			continue;
		}
		
		int row = 0; //行数
		for (int i = 0; i < M; i++) //将第一列存入矩阵
		{
			for (int j = 0; j < rule[0][i]; j++)
				matrix[row++][0] = 1;
			for (int j = 0; j < rule[1][i]; j++)
				matrix[row++][0] = 0;
		}

		int column = 0; //列数
		for (int i = 0; i < N; i++) //按照“飞数”依次生成各列
		{
			int dis = (fly[0][i] + row) % row; //当前列和上一列的“距离”
			for (int j = 0; j < fly[1][i]; j++) //该“距离”重复的列数
			{
				for (int k = 0; k < row; k++) //生成下一列
				{
					matrix[(k + dis) % row][column + 1] = matrix[k][column];
				}
				++column;
			}
		}

		for (int i = row - 1; i >= 0; i--) //输出
		{
			for (int j = 0; j < column; j++)
				cout << matrix[i][j];
			cout << endl;
		}
	}
	return 0;
}

继续加油。