HDU 5573.Binary Tree【二进制 构造】【8月10】

Binary Tree

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 618    Accepted Submission(s): 355
Special Judge

Problem Description

The Old Frog King lives on the root of an infinite tree. According to the law, each node should connect to exactly two nodes on the next level, forming a full binary tree.

Since the king is professional in math, he sets a number to each node. Specifically, the root of the tree, where the King lives, is  1 . Say  froot=1 .

And for each node  u , labels as  fu , the left child is  fu×2  and right child is  fu×2+1 . The king looks at his tree kingdom, and feels satisfied.

Time flies, and the frog king gets sick. According to the old dark magic, there is a way for the king to live for another  N  years, only if he could collect exactly  N soul gems.

Initially the king has zero soul gems, and he is now at the root. He will walk down, choosing left or right child to continue. Each time at node  x , the number at the node is  fx  (remember  froot=1 ), he can choose to increase his number of soul gem by  fx , or decrease it by  fx .

He will walk from the root, visit exactly  K  nodes (including the root), and do the increasement or decreasement as told. If at last the number is  N , then he will succeed.

Noting as the soul gem is some kind of magic, the number of soul gems the king has could be negative.

Given  N ,  K , help the King find a way to collect exactly  N  soul gems by visiting exactly  K  nodes.

 

Input

First line contains an integer  T , which indicates the number of test cases.

Every test case contains two integers  N  and  K , which indicates soul gems the frog king want to collect and number of nodes he can visit.

⋅   1≤T≤100 .

⋅   1≤N≤109 .

⋅   N≤2K≤260 .

 

Output

For every test case, you should output " Case #x:" first, where  x  indicates the case number and counts from  1 .

Then  K  lines follows, each line is formated as 'a b', where  a  is node label of the node the frog visited, and  b  is either '+' or '-' which means he increases / decreases his number by  a .

It's guaranteed that there are at least one solution and if there are more than one solutions, you can output any of them.

 

Sample Input

  
  

   
   2
5 3
10 4
  
  

 

Sample Output

  
  

   
   Case #1:
1 +
3 -
7 +
Case #2:
1 +
3 +
6 -
12 +
  
  

 

Special Judge

因此不需要看他的样例怎么来的，只需要找到一种能够把数字构造出来的方法。

首先1.2.4.8......2^n可以构造出1~2^(n+1)所有的数。1.2.4.8......2^n的和为2^(n+1) 如果需要构造N（偶数），则有2^(n+1)-N是多余的，则需要构造一个负的(2^(n+1)-N)/2。

如样例1，.2^n=8，因为5是奇数，则用2^n-1做，7-5=2；2/2=1； 即构造一个-1，选择1的地方为-号就行了，即-1 + 2 + 4；

1二进制 为  000001， 即构造的时候1的位置选-号，0的位置选+号。

#include<iostream>
#include<cstdio>
using namespace std;
int T, kase = 1;
long long N, K;
int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%lld %lld", &N, &K);
        printf("Case #%d:\n", kase++);
        long long sum = 0, num = 1;
        for(int i = 1;i < K; ++i)
        {
            sum += num;
            num *= 2;
        }
        if(N%2 == 0) sum += (num+1);
        else sum += num;
        long long d = (sum-N)/2;
        num = 1;
        while(K-- > 1)
        {
            cout << num <<" ";
            if(d%2 == 0) cout <<"+"<< endl;
            else cout <<"-"<< endl;
            d /= 2;
            num *= 2;
        }
        if(N%2 == 0) cout << num+1 <<" ";
        else cout << num <<" ";
        if(d%2 == 0) cout <<"+"<< endl;
        else cout <<"-"<< endl;
    }
    return 0;
}