Codefroces194A Exams

最新推荐文章于 2026-03-30 09:23:34 发布

原创最新推荐文章于 2026-03-30 09:23:34 发布 · 615 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

————基本算法———— 同时被 2 个专栏收录

104 篇文章

订阅专栏

逻辑思维题（不涉及算法）

54 篇文章

订阅专栏

本文解析了一个CodeForces竞赛中的经典问题——如何通过合理安排考试成绩的分布，使得总分达到指定值的同时，尽量减少需要重考的科目数量。文中详细解释了解题思路，并提供了一段简洁的C++实现代码。

H - Exams

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 194A

Description

One day the Codeforces round author sat exams. He had n exams and he needed to get an integer from 2 to 5 for each exam. He will have to re-sit each failed exam, i.e. the exam that gets mark 2.

The author would need to spend too much time and effort to make the sum of his marks strictly more than k. That could have spoilt the Codeforces round. On the other hand, if the sum of his marks is strictly less than k, the author's mum won't be pleased at all.

The Codeforces authors are very smart and they always get the mark they choose themselves. Also, the Codeforces authors just hate re-sitting exams.

Help the author and find the minimum number of exams he will have to re-sit if he passes the exams in the way that makes the sum of marks for all n exams equal exactly k.

Input

The single input line contains space-separated integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 250) — the number of exams and the required sum of marks.

It is guaranteed that there exists a way to pass n exams in the way that makes the sum of marks equal exactly k.

Output

Print the single number — the minimum number of exams that the author will get a 2 for, considering that the sum of marks for all exams must equal k.

Sample Input

Input

4 8

Output

Input

4 10

Output

Input

1 3

Output

Hint

In the first sample the author has to get a 2 for all his exams.

In the second sample he should get a 3 for two exams and a 2 for two more.

In the third sample he should get a 3 for one exam.

题目大意就是，你有n次考试，每次考试的分数只能是2 3 4 5,如果拿到的分数是2是需要重考的。你有一个目标，要求这么多次考试分数的和是k，但是你又不想拿到太多分数2而重考，所以询问最少考2的次数是多少。

//这道题虽然是A题，但是我其实有地方一直想不懂来着，就是有没有一种数字，必须要2去参与？现在依然不是很理解。

学长给我的思路是，用k/2，如果得到的数字是2，那么就说明平均值是等于2或者2到3之间，那么此时肯定要用上2，算一算再得到答案。如果得到数字大于等于3，那就说明平均值都比2大了，也不管2了，直接输出0。其实我还是不理解为什么可以这样，怎么证明呢？

如果k/n==2，那么我就可以t=k%n，这个t就是多出来的数字，我把他平均分到每个2当中，就得到了答案 n - k % n。

我现在终于想明白了。其实这就是ACM，很多事情其实是定义好的，比如这道题，最后肯定是用到n个数字（必定是2,3,4,5,）加起来等于分数，然后比如你求得一个2.5的平均值，然后n=4，那么我们可以把问题想象为，有四个2 2 2 2，然后我现在用10对4取余等于2，然后我把这个2分下去不就肯定成立了？而且为了让2的次数最少，我采用平均分，让尽量多的数字摆脱2，所以就变成了3 3 2 2，这样想这个问题不就很好理解了吗？

所以说数学的奥妙不一定是数字，还可以是自己建立模型去理解得到证明和答案。不管平均数是多少，比如到了3.2，那么这个要求的分数k肯定是在 3 3 3 3 ……3到 4 4 4 4 …… 4之间的，所以我用1去加上去肯定是可以得到分数k的。

很好的题目啊，我思维这么差就应该多练！！

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int main()
{
	int n,k;
	scanf("%d%d", &n, &k);
	if(k / n == 2)
		printf("%d\n",n - k % n);
	else
		printf("0\n");
	return 0;
}