void 求一批整数中出现最多的数字()
{//缘由https://bbs.youkuaiyun.com/topics/600334138
int n = 0, d = 0, i = 0, m[10] = { 0 };
char s[474];
std::cin >> n;
while (n--)
{
std::cin >> s; i = 0;
while (s[i] != '\0')
{
if (s[i] >= '0'&& s[i] <= '9')
{
m[(s[i] - '0')]++;
if (m[(s[i] - '0')] > d)d = m[(s[i] - '0')];
++i;
}
}
}
i = 0;
while (++i <= 10)if (m[i - 1] == d)std::cout << (i - 1) << std::endl;
}