Easy Scheduling CodeForces - 1578E（思维题）

题目链接：Easy Scheduling

Eonathan Eostar decided to learn the magic of multiprocessor systems. He has a full binary tree of tasks with height h. In the beginning, there is only one ready task in the tree — the task in the root. At each moment of time, p processes choose at most p ready tasks and perform them. After that, tasks whose parents were performed become ready for the next moment of time. Once the task becomes ready, it stays ready until it is performed.

You shall calculate the smallest number of time moments the system needs to perform all the tasks.

Input
The first line of the input contains the number of tests t (1≤t≤5⋅105). Each of the next t lines contains the description of a test. A test is described by two integers h (1≤h≤50) and p (1≤p≤104) — the height of the full binary tree and the number of processes. It is guaranteed that all the tests are different.

Output
For each test output one integer on a separate line — the smallest number of time moments the system needs to perform all the tasks.

Example
Input
3
3 1
3 2
10 6
Output
7
4
173
Note
Let us consider the second test from the sample input. There is a full binary tree of height 3 and there are two processes. At the first moment of time, there is only one ready task, 1, and p1 performs it. At the second moment of time, there are two ready tasks, 2 and 3, and the processes perform them. At the third moment of time, there are four ready tasks, 4, 5, 6, and 7, and p1 performs 6 and p2 performs 5. At the fourth moment of time, there are two ready tasks, 4 and 7, and the processes perform them. Thus, the system spends 4 moments of time to perform all the tasks.

题意：二元树的高度为h，一次最多可以操作P次，求每个测试输出一个单独的整数 - 系统执行所有任务所需的最小时间时刻数。‎

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		long long k,p,x,sum=0;
		scanf("%lld%lld",&k,&p);
		long long q=pow(2,k)-1;//总节点个数 
		for(int i=0;i<k;i++)
		{
		x=pow(2,i);//每层的节点个数 
		if(x<=p)//如果这层节点个数小于操作数 
		{
			sum++;//花费加一 
			q=q-x;//剩余的节点数 
		}	
		else
		break;//如果这层节点数大于操作数，下层的节点数都大于操作数 
		}
		sum=sum+(q/p);
		if(q%p!=0)//剩余的节点数对操作数求余不为0，花费加一 
		sum++;
		printf("%lld\n",sum);
	}
}