蓝桥杯第九届省赛——明码

这段信息是如下所示：(一共是个汉子)

4 0 4 0 4 0 4 32 -1 -16 4 32 4 32 4 32 4 32 4 32 8 32 8 32 16 34 16 34 32 30 -64 0
16 64 16 64 34 68 127 126 66 -124 67 4 66 4 66 -124 126 100 66 36 66 4 66 4 66 4 126 4 66 40 0 16
4 0 4 0 4 0 4 32 -1 -16 4 32 4 32 4 32 4 32 4 32 8 32 8 32 16 34 16 34 32 30 -64 0
0 -128 64 -128 48 -128 17 8 1 -4 2 8 8 80 16 64 32 64 -32 64 32 -96 32 -96 33 16 34 8 36 14 40 4
4 0 3 0 1 0 0 4 -1 -2 4 0 4 16 7 -8 4 16 4 16 4 16 8 16 8 16 16 16 32 -96 64 64
16 64 20 72 62 -4 73 32 5 16 1 0 63 -8 1 0 -1 -2 0 64 0 80 63 -8 8 64 4 64 1 64 0 -128
0 16 63 -8 1 0 1 0 1 0 1 4 -1 -2 1 0 1 0 1 0 1 0 1 0 1 0 1 0 5 0 2 0
2 0 2 0 7 -16 8 32 24 64 37 -128 2 -128 12 -128 113 -4 2 8 12 16 18 32 33 -64 1 0 14 0 112 0
1 0 1 0 1 0 9 32 9 16 17 12 17 4 33 16 65 16 1 32 1 64 0 -128 1 0 2 0 12 0 112 0
0 0 0 0 7 -16 24 24 48 12 56 12 0 56 0 -32 0 -64 0 -128 0 0 0 0 1 -128 3 -64 1 -128 0 0

求解代码：

代码可以自行简化

#include<bits/stdc++.h>
#include<algorithm>
#define ll long long
#define pii pair<int,int>
#define inf 1e9
using namespace std;
const int N = 1e6+5;
const int mod = 1e9+9;
int t, n, m;
int p[11][33];
string chan(int x){
	string s = "";
	int flag = 0;
	if(x<0){
		flag = 1;
		x = -x;
	}
	while(x){
		int m = x%2;
		x /= 2;
		s = (char)('0'+m)+s;
	}
	int l = 8-s.length();
	for(int i = 0;i < l;i++){
		if(i!=l-1)s = '0'+s;
		else {
			s = (char)('0'+flag)+s;
		}
	}
	return s;
}
ll binpow(int x, int y){
	ll res = 1;
	while(y){
		if(y&1)res = res*x;
		x *= x;
		y >>= 1;
	}
	return res;
}
void solve(){
	string c = "input.in";
	freopen(c.c_str(),"r",stdin);
	for(int i = 0;i < 10;i++){
		for(int j = 0;j < 32;j++){
			cin>>p[i][j];
		}
	}
	for(int i = 0;i < 16;i++){
		for(int j = 0;j < 10;j++){
			for(int k = i*2;k < (i+1)*2;k++){
				cout<<chan(p[j][k]);
			}
		}
		cout<<"\n";
	}
    fclose(stdin);
	cout<<binpow(9,9)<<"\n";
}
int main(){
	// std::cin>>t;
	// while(t--)
		solve();
	return 0;
}

结果我们可以得到如下午所示的汉字图形：

“九的九次方是多少？”