hdu 5747Aaronson(暴力)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5747

Aaronson

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 432    Accepted Submission(s): 261

Problem Description

Recently, Peter saw the equation x0+2x1+4x2+...+2mxm=n . He wants to find a solution (x0,x1,x2,...,xm) in such a manner that ∑i=0mxi is minimum and every xi ( 0≤i≤m ) is non-negative.

 

Input

There are multiple test cases. The first line of input contains an integer T (1≤T≤105) , indicating the number of test cases. For each test case:

The first contains two integers n and m (0≤n,m≤109) .

 

Output

For each test case, output the minimum value of ∑i=0mxi .

 

Sample Input

  
  

   
   10
1 2
3 2
5 2
10 2
10 3
10 4
13 5
20 4
11 11
12 3
  
  

 

Sample Output

  
  

   
   1
2
2
3
2
2
3
2
3
2
  
  

题目大意： x0+2x1+4x2+...+2mxm=n  给m和m。求最小的x序列之和

所以预处理2 ^ 30 ，然后暴力

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int x[30];
int main()
{
    int t;
    x[0] = 1;
    for (int i = 1 ; i <= 29 ; i++ )
    {
        x[i] = x[i-1] * 2;
    }
    scanf("%d",&t);
    while (t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        int res = 0;
        if (m > 29)
        {
            m = 29;
        }
        for (int i = m ; i >= 0 ; i--)
        {
            //printf("%d\n",x[i]);
            res += n / x[i];
            n = n % x[i];

        }
        printf("%d\n",res);
    }
}