transform

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <limits>
#include <fstream>

using namespace std;

#define mem(A, X) memset(A, X, sizeof A)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define foreach(e,x) for(__typeof(x.begin()) e=x.begin();e!=x.end();++e)
#define sz(x) (int)((x).size())
#define sl(a) strlen(a)
#define rep(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define Rep(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define dbg(a) cout << a << endl;
#define fi first
#define se second
typedef long long int64;
int gcd(const int64 &a, const int64 &b) { return b == 0 ? a : gcd(b, a % b); }
int64 int64pow(int64 a, int64 b){ if (b == 0) return 1; int64 t = int64pow(a, b / 2); if (b % 2) return t * t * a; return t * t; }
const int inf = 1 << 30;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int MAX_N = 500005;



/*进制转换, 不支持小数.
复杂度:O(length)
输入:x, y进制数. 2 <= x,y <= 36s: x进制数, 每一位10~35 用A~Z表示.
输出:x进制数对应的y进制数, 其中每一位10~35用A~Z表示.
*/

string transform(int x, int y, string s)
{
	string res = "";
	int sum = 0;
	rep(i, 0, sz(s)) {
		if (s[i] == '-')
			continue;
		if (s[i] >= '0' && s[i] <= '9') {
			sum = sum * x + s[i] - '0';
		}
		else {
			sum = sum * x + s[i] - 'A' + 10;
		}
	}
	while (sum) {
		char tmp = sum % y;
		sum /= y;

		if (tmp <= 9) {
			tmp += '0';
		}
		else {
			tmp = tmp - 10 + 'A';
		}
		res = tmp + res;
	}
	if (sz(res) == 0)
		res = "0";
	if (s[0] == '-')
		res = '-' + res;
	return res;
}
int main()
{
	cout << transform(2, 10, "1010") << endl;
	return 0;
}