首页 / HTML / CodeforcesRound#278(Div.2)B??CandyBoxes_html/css_WEB-ITnose

CodeforcesRound#278(Div.2)B??CandyBoxes_html/css_WEB-ITnose

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#278(Div.2)B??CandyBoxes_html/css_WEB-ITnose，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含6540字，纯文字阅读大概需要10分钟。

内容图文

B. Candy Boxes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There is an old tradition of keeping 4 boxes of candies in the house in Cyberland. The numbers of candies are special if their arithmetic mean, their median and their range are all equal. By definition, for a set {x1,?x2,?x3,?x4} (x1?≤?x2?≤?x3?≤?x4) arithmetic mean is , median is and range is x4?-?x1. The arithmetic mean and median are not necessary integer. It is well-known that if those three numbers are same, boxes will create a "debugging field" and codes in the field will have no bugs.

For example, 1,?1,?3,?3 is the example of 4 numbers meeting the condition because their mean, median and range are all equal to 2.

Jeff has 4 special boxes of candies. However, something bad has happened! Some of the boxes could have been lost and now there are only n (0?≤?n?≤?4) boxes remaining. The i-th remaining box contains ai candies.

Now Jeff wants to know: is there a possible way to find the number of candies of the 4?-?n missing boxes, meeting the condition above (the mean, median and range are equal)?

Input

The first line of input contains an only integer n (0?≤?n?≤?4).

The next n lines contain integers ai, denoting the number of candies in the i-th box (1?≤?ai?≤?500).

Output

In the first output line, print "YES" if a solution exists, or print "NO" if there is no solution.

If a solution exists, you should output 4?-?n more lines, each line containing an integer b, denoting the number of candies in a missing box.

All your numbers b must satisfy inequality 1?≤?b?≤?106. It is guaranteed that if there exists a positive integer solution, you can always find such b's meeting the condition. If there are multiple answers, you are allowed to print any of them.

Given numbers ai may follow in any order in the input, not necessary in non-decreasing.

ai may have stood at any positions in the original set, not necessary on lowest n first positions.

Sample test(s)

Input 

211

Output 

YES33

Input 

3111

Output 

NO

Input 

41223

Output 

YES


很麻烦的一题啊，需要分别考虑0,1,2,3,4个数的情况 

#include #include #include #include #include #include #include #include #include #include #include using namespace std;int a[5];int main(){	int n;	while (~scanf("%d", &n))	{		for (int i = 1; i <= n; ++i)		{			scanf("%d", &a[i]);		}		sort(a + 1, a + n + 1);		if (n == 4)		{			double u = (a[1] + a[2] + a[3] + a[4]) * 1.0;			u /= 4;			double v = (a[4] - a[1]);			double w = (a[2] + a[3]) * 1.0 / 2;			if (u != v || u != w || v != w)			{				printf("NO\n");			}			else			{				printf("YES\n");			}			continue;		}		else if(n == 3)		{			int u = (a[2] + a[3] - a[1]);			bool flag = false;			bool flag2 = false;			bool flag3 = false;			bool flag4 = false;			int p = u + a[1] + a[2] + a[3];			int q = u - a[1];			int r = a[2] + a[3];			if (p % 4 || r % 2)			{				flag = true;			}			else			{				p /= 4;				r /= 2;			}			if (!flag && (p != q || p != r || q != r))			{				flag = true;			}			if (!flag && u >= 1 && u <= 1000000 && u >= a[3])			{				printf("YES\n");				printf("%d\n", u);				continue;			}			u = a[1] + a[2] - a[3];			p = u + a[1] + a[2] + a[3];			q = a[3] - a[1];			r = (u + a[2]);			if (p % 4 || r % 2)			{				flag2 = true;			}			else			{				p /= 4;				r /= 2;			}			if (!flag2 && (p != q || p != r || q != r))			{				flag2 = true;			}			if (!flag2 && u >= 1 && u <= 1000000 && u >= a[2] && u <= a[3])			{				printf("YES\n");				printf("%d\n", u);				continue;			}			u = a[1] + a[3] - a[2];			p = u + a[1] + a[2] + a[3];			q = a[3] - a[1];			r = (u + a[2]);			if (p % 4 || r % 2)			{				flag3 = true;			}			else			{				p /= 4;				r /= 2;			}			if (!flag3 &&  (p != q || p != r || q != r))			{				flag3 = true;			}			if (!flag3 && u >= 1 && u <= 1000000 && u >= a[1] && u <= a[2])			{				printf("YES\n");				printf("%d\n", u);				continue;			}			u = a[1] + a[2] - a[3];   			p = u + a[1] + a[2] + a[3];			q = a[3] - u;			r = a[1] + a[2];			if (p % 4 || r % 2)			{				flag4 = true;			}			else			{				p /= 4;				r /= 2;			}			if (!flag4 && (p != q || p != r || q != r))			{				flag4 = true;			}			if (!flag4 && u >= 1 && u <= 1000000 && u <= a[1])			{				printf("YES\n");				printf("%d\n", u);				continue;			}			if (flag && flag2 &&flag3 && flag4)			{				printf("NO\n");			}					}		else if(n == 1)		{			int x4 = 3 * a[1];			int x23 = x4 + a[1];			int x2, x3;			x2 = x3 = x23 / 2;			if (a[1] <= x2 && x2 <= x3 && x3 <= x4)			{				printf("YES\n");				printf("%d\n%d\n%d\n", x2, x3, x4);			}			else			{				printf("NO\n");			}		}		else if ( n == 2)		{			int x1 = a[1], x2 = a[2];			int x4 = 3 * a[1];			int x3 = 4 * x1 - x2;			if (x1 <= x2 && x2 <= x3 && x3 <= x4)			{				printf("YES\n");				printf("%d\n%d\n", x3, x4);				continue;			}			x1 = a[1];			x3 = a[2];			x4 = 3  * a[1];			x2 = 4 * x1 - x3;			if (x1 <= x2 && x2 <= x3 && x3 <= x4)			{				printf("YES\n");				printf("%d\n%d\n", x2, x4);				continue;			}			bool flag = false;			x2 = a[1];			x3 = a[2];			x1 = x2 + x3;			if (x1 % 4)			{				flag = true;			}			else			{				x1 /= 4;				x4 = 3 * x1;				if (x1 <= x2 && x2 <= x3 && x3 <= x4)				{					printf("YES\n");					printf("%d\n%d\n", x1, x4);					continue;				}				else				{					flag = true;				}			}			bool flag2 = false;			x2 = a[1];			x4 = a[2];			x1 = x4;			if (x1 % 3)			{				flag2 = true;			}			else			{				x3 = x1 + x4 - x2;				if (x1 <= x2 && x2 <= x3 && x3 <= x4)				{					printf("YES\n");					printf("%d\n%d\n", x1, x3);					continue;				}				else				{					flag2 = true;				}			}			bool flag3 = false;			x3 = a[1];			x4 = a[2];			x1 = x4;			x2 = x1 + x4 - x3;			if (x1 % 3)			{				flag3 = true;			}			else			{				if (x1 <= x2 && x2 <= x3 && x3 <= x4)				{					printf("YES\n");					printf("%d\n%d\n", x1, x2);					continue;				}				else				{					flag3 = true;				}			}			if (flag && flag2 && flag3)			{				printf("NO\n");			}		}		else		{			printf("YES\n");			printf("1\n1\n3\n3\n");		}	}	return 0;}

内容总结

以上是互联网集市为您收集整理的CodeforcesRound#278(Div.2)B??CandyBoxes_html/css_WEB-ITnose全部内容，希望文章能够帮你解决CodeforcesRound#278(Div.2)B??CandyBoxes_html/css_WEB-ITnose所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

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

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/399330.html

来源：【匿名】