微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦！

CF581D Three Logos 暴力

分类：大数据作者：编程之家

Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.

Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no empty space left. When you put a logo on the billboard,you should rotate it so that the sides were parallel to the sides of the billboard.

Your task is to determine if it is possible to put the logos of all the three companies on some square billboard without breaking any of the described rules.

Input

The first line of the input contains six positive integers x1,?y1,?x2,?y2,?x3,?y3 (1?≤?x1,?y3?≤?100),where xi and yi determine the length and width of the logo of the i-th company respectively.

Output

If it is impossible to place all the three logos on a square shield,print a single integer "-1" (without the quotes).

If it is possible,print in the first line the length of a side of square n,where you can place all the three logos. Each of the next n lines should contain n uppercase English letters "A","B" or "C". The sets of the same letters should form solid rectangles,provided that:

  • the sizes of the rectangle composed from letters "A" should be equal to the sizes of the logo of the first company,
  • the sizes of the rectangle composed from letters "B" should be equal to the sizes of the logo of the second company,
  • the sizes of the rectangle composed from letters "C" should be equal to the sizes of the logo of the third company,

Note that the logos of the companies can be rotated for printing on the billboard. The billboard mustn‘t have any empty space. If a square billboard can be filled with the logos in multiple ways,you are allowed to print any of them.

See the samples to better understand the statement.

Examples
Input
copy 
5 1 2 5 5 2
Output
copy 
5
AAAAA
BBBBB
BBBBB
CCCCC
CCCCC
Input
copy 
4 4 2 6 4 2
Output
copy 
6
BBBBBB
BBBBBB
AAAACC
AAAACC
AAAACC
AAAACC
暴力就完事了；
代码应该是看不下去的；
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
//#include<cctype>
//#pragma GCC optimize(2)
using namespace std;
#define maxn 1000005
#define inf 0x7fffffff
//#define INF 1e18
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
typedef long long  ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),sizeof(x))
const long long int mod = 1e9 + 7;
#define Mod 1000000000
#define sq(x) (x)*(x)
#define eps 1e-4
typedef pair<int,int> pii;
#define pi acos(-1.0)
//const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> pii;
inline ll rd() {
	ll x = 0;
	char c = getchar();
	bool f = false;
	while (!isdigit(c)) {
		if (c == ‘-‘) f = true;
		c = getchar();
	}
	while (isdigit(c)) {
		x = (x << 1) + (x << 3) + (c ^ 48);
		c = getchar();
	}
	return f ? -x : x;
}

ll gcd(ll a,ll b) {
	return b == 0 ? a : gcd(b,a%b);
}
int sqr(int x) { return x * x; }


/*ll ans;
ll exgcd(ll a,ll b,ll &x,ll &y) {
	if (!b) {
		x = 1; y = 0; return a;
	}
	ans = exgcd(b,a%b,x,y);
	ll t = x; x = y; y = t - a / b * y;
	return ans;
}
*/

int h[4],w[4];
char mp[300][300];
char ch[3] = { ‘A‘,‘B‘,‘C‘ };
int main() {
	//ios::sync_with_stdio(0);
	for (int i = 1; i <= 3; i++) {
		cin >> h[i] >> w[i]; if (h[i] > w[i])swap(h[i],w[i]);
	}
	if ((w[1] == w[2]&&w[2] == w[3]) && h[1] + h[2] + h[3] == w[1]) {
		cout << w[1] << endl;
		for (int i = 1; i <= w[1]; i++) {
			for (int j = 1; j <= h[1]; j++)mp[i][j] = ‘A‘;
		//	cout << endl;
		}
		for (int i = 1; i <= w[1]; i++) {
			for (int j = h[1] + 1; j <= h[2] + h[1]; j++)mp[i][j] = ‘B‘;
		//	cout << endl;
		}
		for (int i = 1; i <= w[1]; i++) {
			for (int j = 1 + h[1] + h[2]; j <= w[1]; j++)mp[i][j] = ‘C‘;
		//	cout << endl;
		}
		for (int i = 1; i <= w[1]; i++) {
			for (int j = 1; j <= w[1]; j++)cout << mp[i][j];
			cout << endl;
		}
		return 0;
	}
	else {
		int pos = 0;
		int maxx = 0;
		for (int i = 1; i <= 3; i++) {
			if (w[i] > maxx) {
				maxx = w[i]; pos = i;
			}
		}
		if (pos == 1) {
			if (h[2] + h[3] == w[1]) {
				if (w[3] == w[2] && w[2] + h[1] == w[1]) {
					cout << w[1] << endl;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= h[1]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1; i <= h[2]; i++) {
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1 + h[2]; i <= w[1]; i++)
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= w[1]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			else if (h[2] + w[3] == w[1]) {
				if (w[2] == h[3] && w[2] + h[1] == w[1]) {
					cout << w[1] << endl;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= h[1]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1; i <= h[2]; i++) {
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1 + h[2]; i <= w[1]; i++)
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= w[1]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			else if (w[2] + h[3] == w[1]) {
				if (h[2] == w[3] && h[2] + h[1] == w[1]) {
					cout << w[1] << endl;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= h[1]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1 + w[2]; i <= w[1]; i++)
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= w[1]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			else if (w[2] + w[3] == w[1]) {
				if (h[2] == h[3] && h[2] + h[1] == w[1]) {
					cout << w[1] << endl;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= h[1]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1 + w[2]; i <= w[1]; i++)
						for (int j = 1 + h[1]; j <= w[1]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1; j <= w[1]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
		}

		else if (pos == 2) {
			if (h[1] + h[3] == w[2]) {
				if (w[3] == w[1] && w[1] + h[2] == w[2]) {
					cout << w[2] << endl;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= h[2]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1; i <= h[1]; i++) {
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1 + h[1]; i <= w[2]; i++)
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= w[2]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			if (h[1] + w[3] == w[2]) {
				if (h[3] == w[1] && w[1] + h[2] == w[2]) {
					cout << w[2] << endl;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= h[2]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1; i <= h[1]; i++) {
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1 + h[1]; i <= w[2]; i++)
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= w[2]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			if (w[1] + h[3] == w[2]) {
				if (w[3] == h[1] && h[1] + h[2] == w[2]) {
					cout << w[2] << endl;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= h[2]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1 + w[1]; i <= w[2]; i++)
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= w[2]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
			if (w[1] + w[3] == w[2]) {
				if (h[3] == h[1] && h[1] + h[2] == w[2]) {
					cout << w[2] << endl;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= h[2]; j++)mp[i][j] = ‘B‘;
						//	cout << endl;
					}
					for (int i = 1; i <= w[1]; i++) {
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘A‘;
						//	cout << endl;
					}
					for (int i = 1 + w[1]; i <= w[2]; i++)
						for (int j = 1 + h[2]; j <= w[2]; j++)mp[i][j] = ‘C‘;
					for (int i = 1; i <= w[2]; i++) {
						for (int j = 1; j <= w[2]; j++)cout << mp[i][j];
						cout << endl;
					}
					return 0;
				}
			}
		}
		else {
		if (h[1] + h[2] == w[3]) {
			if (w[2] == w[1] && w[1] + h[3] == w[3]) {
				cout << w[3] << endl;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= h[3]; j++)mp[i][j] = ‘C‘;
					//	cout << endl;
				}
				for (int i = 1; i <= h[1]; i++) {
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘A‘;
					//	cout << endl;
				}
				for (int i = 1 + h[1]; i <= w[3]; i++)
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘B‘;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= w[3]; j++)cout << mp[i][j];
					cout << endl;
				}
				return 0;
			}
		}
		if (h[1] + w[2] == w[3]) {
			if (h[2] == w[1] && w[1] + h[3] == w[3]) {
				cout << w[3] << endl;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= h[3]; j++)mp[i][j] = ‘C‘;
					//	cout << endl;
				}
				for (int i = 1; i <= h[1]; i++) {
					for (int j = 1 + h[2]; j <= w[3]; j++)mp[i][j] = ‘A‘;
					//	cout << endl;
				}
				for (int i = 1 + h[1]; i <= w[3]; i++)
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘B‘;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= w[3]; j++)cout << mp[i][j];
					cout << endl;
				}
				return 0;
			}
		}
		if (w[1] + h[2] == w[3]) {
			if (w[2] == h[1] && h[1] + h[3] == w[3]) {
				cout << w[3] << endl;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= h[3]; j++)mp[i][j] = ‘C‘;
					//	cout << endl;
				}
				for (int i = 1; i <= w[1]; i++) {
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘A‘;
					//	cout << endl;
				}
				for (int i = 1 + w[1]; i <= w[3]; i++)
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘B‘;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= w[3]; j++)cout << mp[i][j];
					cout << endl;
				}
				return 0;
			}
		}
		if (w[1] + w[2] == w[3]) {
			if (h[2] == h[1] && h[1] + h[3] == w[3]) {
				cout << w[3] << endl;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= h[3]; j++)mp[i][j] = ‘C‘;
					//	cout << endl;
				}
				for (int i = 1; i <= w[1]; i++) {
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘A‘;
					//	cout << endl;
				}
				for (int i = 1 + w[1]; i <= w[3]; i++)
					for (int j = 1 + h[3]; j <= w[3]; j++)mp[i][j] = ‘B‘;
				for (int i = 1; i <= w[3]; i++) {
					for (int j = 1; j <= w[3]; j++)cout << mp[i][j];
					cout << endl;
				}
				return 0;
			}
		}
		}

	}
	cout << -1 << endl;
	return 0;
}

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 dio@foxmail.com 举报，一经查实，本站将立刻删除。

相关推荐

大数据分析案例-基于随机森林模型对北京房价进行预测
自1998年我国取消了福利分房的政策后，房地产市场迅速开展蓬勃起来。同时，随着社会经济的快速开展，居民的经济条件越来越好，住房条件也在不断地提升。而住房是人民根本生活的保障，也是-一个家庭最重要的资产,从一定的层面.上反映了一个家庭整体的生活水王,多方面的因素使得房地产行业在短时间开展成为我国的支柱产业之一;成为了切实关乎人民生活和利益的重要产业。然而，随着房地产行业的开展，问题也慢慢突显出来，房价一直居高不下成为了一个大问题。作为国家的支柱产业,房地产的稳定发展关乎国计民生。近几年，房
机器学习实战——房价预测完整案例建议收藏慢慢品
文章目录获取数据查看数据结构获取数据下载数据可以直接通过浏览器下载压缩包，也可以通过函数来进行。import osimport tarfileimport urllib.requestDOWNLOAD_ROOT = "https://raw.githubusercontent.com/ageron/handson-ml2/master/"HOUSING_PATH = os.path.join("datasets", "housing") # datasetstestHOUSING_
网上商城系统MySql数据库设计项目实战
网上商城系统MySql数据库设计
常见气象数据获取方式及批量下载代码汇总
26个来源的气象数据获取代码
毕业设计 基于大数据的共享单车数据分析与可视化
大数据分析案例-对电信客户流失分析预警预测
在进入21世纪以来，中国电信业告别了20世纪最后阶段的高速发展状态，转而进入稳步发展阶段。近年来，随着通信的成本逐年下降，电信市场用户覆盖率近乎100%，几乎没有可开发的新市场，移动、联通、电信三大电信企业完全占据了电信服务市场，电信行业的不断进步，使得各大电信运营商自身服务体系不断完善，目前我国的三大运营商均实现了全业务经营 ，这意味着行业内存在产品、服务、模式等方面的高度同质化，企业间难以实现差异化竞争优势。现如今的竞争环境，迫使运营商的经营重点向有利于电信消费者的方向移动，为了维持客户的保有量，对
卡尔曼滤波
目录1.卡尔曼滤波入门2.学卡尔曼滤波的必备知识2.1.状态空间表达式2.2.高斯分布2.3.方差2.4.超参数2.5.卡尔曼直观图解3.卡尔曼滤波3.1.卡尔曼公式理解3.2.调节超参数3.2.1.Q和R的取值3.2.2.P0和X0的取值3.2.3.卡尔曼滤波的使用...
Python大数据-电商产品评论情感数据分析
一、项目背景网上购物已经成为大众生活的重要组成部分。人们在电商平台上浏览商品并购物，产生了海量的用户行为数据，用户对商品的评论数据对商家具有重要的意义。利用好这些碎片化、非结构化的数据，将有利于企业在电商平台上的持续发展，同时，对这部分数据进行分析，依据评论数据来优化现有产品也是大数据在企业经营中的实际应用。 分析产品：韶音 AfterShokz Aeropex AS800骨传导蓝牙耳机运动无线耳骨传导耳机跑步骑行 环法特别版（Aeropex AS800是AfterShokz韶音的网红新品，很多国内外
大数据项目之电商数仓、Maxwell使用、 Maxwell启停脚本、增量数据同步、历史数据全量同步、采集通道Maxwell配置、通道测试
但有时只有增量数据是不够的，我们可能需要使用到MySQL数据库中从历史至今的一个完整的数据集。这就需要我们在进行增量同步之前，先进行一次历史数据的全量同步。这样就能保证得到一个完整的数据集。1）第一条type为bootstrap-start和最后一条type为bootstrap-complete的数据，是bootstrap开始和结束的标志，不包含数据，中间的type为bootstrap-insert的数据才包含数据。2）一次bootstrap输出的所有记录的ts都相同，为bootstrap开始的时间。
[Hive]一篇带你读懂Hive是什么
✅作者简介：大家好,我是Philosophy7？让我们一起共同进步吧！
苹果市值2025年有望达4万亿美元
pythonJavaScriptjavaHTMLreactjsC#AndroidCSSNode.jssqlrpython-3.xMysqLjQueryc++pandasFlutterangularIOSdjangolinuxswifttypescript路由器JSON路由器设置无线路由器h3c华三华三路由器设置华三路由器电脑软件教程arraysdocker软件图文教程Cvue.jslaravelspring-bootreact-native