第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-95 2的次幂表示

#include <stdio.h>
int l=0;
char temp[1000]={0};
void show(int n)
{
   if(n==0) {temp[l]='0';l++;return ;}
   if(n==2)   {	temp[l]='2',l++;return ; }
   int a[15]={0},i=0,j;
   while(n!=0)	
   {
   	 a[i]=n%2;
   	 n/=2;
   	 i++;
   }	
   for(j=i-1;j>=0;j--)
   if(a[j]==1)	
    {
        if(j==1) 
		{
			if(temp[l-1]==')' || temp[l-1]=='2' ) {temp[l]='+';l++;}
			temp[l]='2';l++;
		}
         else 
		 {
		 	if(temp[l-1]==')' || temp[l-1]=='2' ) {temp[l]='+';l++;}
			temp[l]='2';l++;
			temp[l]='(';l++;
		 	show(j);
		 	temp[l]=')';l++;
		 }
    }	
}
int main()
{
	int n;
	scanf("%d",&n);
	show(n);
	printf("%s",temp);  
	return 0;
}

#include<iostream>
using namespace std;
//递归实现 思路是先转换成二进制
int fun(int n)
{
	int i=0;
	int a[20]={0};
	int m=n;
	while(m)
	{
		a[i]=m%2;
		m/=2;
		i++;
	}
	for(int j=i-1;j>=0;j--)//高位到低位排列 但是要注意每位的权改变
	{
		if(a[j]==1)
		{
			//若是最后一个1 则之后不要加号
			int flag=1;
			for(int k=j-1;k>=0;k--)
			{
				if(a[k]==1)
				{
					flag=0;
					break;
				}
			}
			if(flag)//是最后一位
			{
				if(j==1)
					cout<<"2";
				else
				{	
					if(j==0)
						cout<<"2("<<j<<")";
					else
					{
						cout<<"2(";
						fun(j);
						cout<<")";
					}
				}

			}
			else//不是最后一位
			{
				if(j==1)
					cout<<"2+";
				else
				{
					if(j==0)
						cout<<"2("<<j<<")+";
					else
					{
						cout<<"2(";
						fun(j);
						cout<<")+";
					}
				}
			}
		}
	}
	return 0;
}
int main()
{
	int n;
	cin>>n;
	fun(n);
	cout<<endl;
	return 0;

}

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int number = Integer.valueOf(br.readLine());
		toString(Integer.toBinaryString(number));
	}

	private static void toString(String binary) {
		char[] temp = binary.toCharArray();
		boolean control = false;
		for (int i = 0; i < temp.length; i++) {
			if (temp[i] == '1') {
				if (control)
					System.out.print("+");
				else
					control = true;
				System.out.print("2");
				int mi = temp.length - i - 1;
				if (mi == 0)
					System.out.print("(0)");
				else if (mi > 1) {
					System.out.print("(");
					toString(Integer.toBinaryString(mi));
					System.out.print(")");
				}

			}
		}
	}

}

def test(x):
    sd=''
    s=str(bin(x))[2:]
    s=s[::-1]
    for i in range(len(s)):
        if s[i]!='0':
            if i==0:
                sd=sd+ '2(0)'
            elif i==1:
                sd= '2'+('+'if sd!='' else '')+sd
            else:
                sd='2('+test(i)+')'+('+'if sd!='' else '')+sd
    return sd
s=int(input())
aa=test(s)
print(aa)