进制相关问题

const ll mod = 1e17;

#include <cstring>
#include <cstdio>
#define ll long long
using namespace std;
const ll mod = 1e17;
int n,m;
ll v[83];
struct num {
	ll x,y;
} dp[83][83],ans;
num max(num i,num j) {
	if (i.x > j.x) return i;
	if (i.x < j.x) return j;
	return i.y > j.y ? i : j;
}
num trans(ll b,int i) {
	num p; p.x = 0,p.y = b;
	for (int a = 1 ; a <= i ; ++ a)
		p.x <<= 1,p.y <<= 1,
		p.x += p.y / mod,
		p.y %= mod;
	return p;
}
num plus(num i,num j) {
	i.x += j.x,i.y +=j.y;
	i.x += i.y / mod;
	i.y %= mod;
	return i;
}
int main() {
	scanf("%d%d",&n,&m);
	ans.x = 0,ans.y = 0;
	for (int a = 1 ; a <= n ; ++ a) {
		memset(v,0,sizeof(v));
		memset(dp,0,sizeof(dp));
		for (int b = 1 ; b <= m ; ++ b) scanf("%lld",&v[b]);
		for (int i = 1 ; i < m ; ++ i) {
			for (int l = 1,r = m - i ; r <= m ; ++ l,++ r) {
				num ldp = plus(dp[l - 1][r],trans(v[l - 1],i));
				num rdp = plus(dp[l][r + 1],trans(v[r + 1],i));
				dp[l][r] = max(ldp,rdp);
			}
		}
		num j; j.x = 0,j.y = 0;
		for (int i = 1 ; i <= m ; ++ i)
			dp[i][i] = plus(dp[i][i],trans(v[i],m)),
			j = max(j,dp[i][i]);
		ans = plus(ans,j);
	}
	if (ans.x) printf("%lld",ans.x); printf("%lld\n",ans.y);
	return 0;
}
/*			for (int l = 1,r = m - i ; r <= m ; ++ l,++ r) {
			dp[l][r] = max(dp[l - 1][r] + (v[l - 1] << i),
						   dp[l][r + 1] + (v[r + 1] << i));
			}
		}
		int j = 0;
		if (m > 1) for (int i = 1 ; i <= m ; ++ i)
			dp[i][i] += (v[i] << m),
			j = dp[j][j] < dp[i][i] ? i : j;
		else j = 1,dp[1][1] = v[1] << 1;
		ans += dp[j][j];
*/