3483. 2的幂次方⭐️难度中等⭐️类型分治题目题目链接题解#define_CRT_SECURE_NO_WARNINGS#includestdio.h#includestring#includevectorusingnamespacestd;stringGet2sExponet(intn){if(n0){return0;}vectorintexp;for(inti15;i0;--i){if((n(1i))!0){exp.push_back(i);}}// n 2^(exp[0]) 2^(exp[1]) ... 2^(exp[size-1])string res;for(inti0;iexp.size();i){if(i!0){res;}if(exp[i]1){res2;}else{res2(Get2sExponet(exp[i]));}}returnres;}intmain(){intn;while(scanf(%d,n)!EOF){printf(%s\n,Get2sExponet(n).c_str());}return0;}