题目描述:
Every positive number can be presented by the exponential form.For example, 137 = 2^7 + 2^3 + 2^0。Let's present a^b by the form a(b).Then 137 is presented by 2(7)+2(3)+2(0). Since 7 = 2^2 + 2 + 2^0 and 3 = 2 + 2^0 , 137 is finally presented by 2(2(2)+2 +2(0))+2(2+2(0))+2(0). Given a positive number n,your task is to present n with the exponential form which only contains the digits 0 and 2.
输入:
For each case, the input file contains a positive integer n (n<=20000).
输出:
For each case, you should output the exponential form of n an a single line.Note that,there should not be any additional white spaces in the line.
样例输出:
1315
样例输出:
2(2(2+2(0))+2)+2(2(2+2(0)))+2(2(2)+2(0))+2+2(0)
算法思想:
分治法的核心在于将问题分解为小规模问题
以该题为例
137=2(7)+2(3)+2(0)=2(2(2)+2 +2(0))+2(2+2(0))+2(0)
首先 问题的输入时137记为n 是要对137进行分解
可以将137分为 2(7) 2(3) 2(0)三部分 将问题分解为 对7 3 0三个数进行二的幂次方分解
接下来
首先输出2与( 然后递归将7作为问题输入
再输出) 此时已经对第一部分求解完毕
然后n为137-2(7) 若其不为0则继续进行分解
递归基为问题输入为2时 此时应直接输出2 而不是2(1)
当n不为0 时继续分解下一部分
算法实现:
#include <stdio.h>
#include <math.h>
int get_most_power(int n){
int ans=0;
while (pow(2,ans)<=n)
ans++;
return ans-1;
}
void calculate(int n){
int most_power=get_most_power(n);
if(most_power==1)
printf("2");
else{
printf("2(");
if(most_power!=0)
calculate(most_power);
else
printf("0");
printf(")");
}
n-=pow(2,most_power);
if(n!=0){
printf("+");
calculate(n);
}
}
int main() {
int n;
scanf("%d",&n);
calculate(n);
return 0;
}
搬运自 https://blog.nowcoder.net/n/115f35a93d0341538762b9db15b6cd76?f=comment