python/GESP/灰阶图像/灰阶图像.cpp

#include <bits/stdc++.h>
using namespace std;
const int N = 256;
//Ͱ
int b[N];//0 ~ 255

//<2F><>һ<EFBFBD><D2BB>16<31><36><EFBFBD>ƵĻҽ<C4BB>תΪһ<CEAA><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>±<EFBFBD><C2B1><EFBFBD><EFBFBD><EFBFBD>ֵ
int toDec(char a, char b) {
	int res = 0;
	if (a >= 'A' && a <= 'F')
		res += (a - 'A' + 10) * 16;
	else
		res += (a - '0') * 16;

	if (b >= 'A' && b <= 'F')
		res += b - 'A' + 10;
	else
		res += b - '0';

	return res;
}

//<2F><>һ<EFBFBD><D2BB>ʮ<EFBFBD><CAAE><EFBFBD>ƵĻҽ<C4BB>ֵ[0,255]ת<><D7AA><EFBFBD><EFBFBD>ʮ<EFBFBD><CAAE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[0,FF]
string toHex(int x) {
	int a = x % 16; // 0 ~ 15
	int b = x / 16; //
	char c1;
	if (a >= 10)
		c1 = 'A' + a - 10;
	else
		c1 = '0' + a;
	char c2;
	if (b >= 10)
		c2 = 'A' + b - 10;
	else
		c2 = '0' + b;
	string res;
	res.push_back(c2);
	res.push_back(c1);
	return res;
}


//ԭʼ<D4AD><CABC><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
vector<string> q;

//<2F>ṹ<EFBFBD>壬<EFBFBD><E5A3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ͱ<EFBFBD>еĻҽװ<D2BD><D7B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD>
struct Node {
	int id;//<2F><><EFBFBD><EFBFBD><EFBFBD>±<EFBFBD>
	int cnt;//<2F><><EFBFBD><EFBFBD>
	const bool operator<(const Node &b) const {
		if (cnt == b.cnt)
			return id < b.id;
		return cnt > b.cnt;
	}
};
vector<Node> vec;//<2F><>Ҫ<EFBFBD><D2AA>b<EFBFBD><62>װ<EFBFBD><D7B0>Node<64>ŵ<EFBFBD><C5B5><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>У<EFBFBD><D0A3><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD>ýṹ<C3BD><E1B9B9><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>

int main() {
	//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
	freopen("D://HuiJie.txt", "r", stdin);
	//freopen("D://test.txt", "w",stdout);

	int n;
	cin >> n;//<2F><>n<EFBFBD><6E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><CDBC>
	for (int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		q.push_back(s);//ԭʼ<D4AD><CABC><EFBFBD><EFBFBD>

		for (int j = 0; j < s.size(); j += 2) {
			char c1 = s[j], c2 = s[j + 1];
			int k = toDec(c1, c2); //<2F>ҽ׶<D2BD>Ӧ<EFBFBD><D3A6><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>
			b[k]++;
		}
	}
	//<2F>ҳ<EFBFBD>ǰ16λʹ<CEBB><CAB9>Ƶ<EFBFBD>ʸߵĻҽ<C4BB>
	//<2F><><EFBFBD>򣬰<EFBFBD>ʲô<CAB2><C3B4><EFBFBD><EFBFBD><EFBFBD>أ<EFBFBD>
	//1<><31><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǰ
	//2<><32><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>?Ͱ<><CDB0><EFBFBD><EFBFBD><EFBFBD><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD>ǰ
	for (int i = 0; i <= 255; i++) {
		if (b[i]) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0<EFBFBD>IJ<EFBFBD><C4B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
			vec.push_back({i, b[i]});
	}
	//ʹ<><CAB9><EFBFBD>Զ<EFBFBD><D4B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD>򷽷<EFBFBD><F2B7BDB7><EFBFBD><EFBFBD><EFBFBD>
	sort(vec.begin(), vec.end());

	//<2F><>һ<EFBFBD><D2BB>
	for (int i = 0; i < min(16, (int)vec.size()); i++)
		cout << toHex(vec[i].id);
	cout << endl;

	//<2F>ڶ<EFBFBD><DAB6><EFBFBD>
	for (int i = 0; i < n; i++) { //ö<><C3B6>ÿ<EFBFBD><C3BF>ԭʼ<D4AD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD><EFBFBD>ÿ2<C3BF><32>һ<EFBFBD>飬<EFBFBD>ж<EFBFBD><D0B6><EFBFBD><EFBFBD><EFBFBD>С<EFBFBD><D0A1>Ӧ<EFBFBD><D3A6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><D0B5><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>ӽ<EFBFBD>
		for (int j = 0; j < q[0].size(); j += 2) {//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
			char c1 = q[i][j], c2 = q[i][j + 1];
			//<2F><><EFBFBD><EFBFBD>ab<61><62>װ<EFBFBD><D7B0><EFBFBD>Ķ̴<C4B6><CCB4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>vec<65>е<EFBFBD>ǰ16<31><36><EFBFBD>ĸ<EFBFBD><C4B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
			int x = toDec(c1, c2);
			int mi = INT_MAX;
			int mi_p = 0;
			for (int k = 0; k < min(16, (int)vec.size()); k++) { //16<31><36><EFBFBD>з<EFBFBD><D0B7>յģ<D5B5><C4A3><EFBFBD>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD>û<EFBFBD><C3BB>16<31><36><EFBFBD><EFBFBD>ô<EFBFBD><C3B4>
				if (mi > abs(vec[k].id - x)) {
					mi = abs(vec[k].id - x);
					mi_p = k;
				}
			}
			//mi_p [0,255] -> ʮ<><CAAE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
			//<2F><><EFBFBD><EFBFBD>ǰ<EFBFBD><C7B0>a,b<><62><EFBFBD><EFBFBD>ֵ<EFBFBD>޸<EFBFBD>Ϊmi_p<5F><70><EFBFBD><EFBFBD><EFBFBD>ҽ<EFBFBD>ֵ
			cout << toHex(mi_p)[1];
		}
		cout << endl;
	}
	return 0;
}