AcWing 1346. 回文平方
原题链接
简单
作者:
我叫尤盖斯
,
2021-01-18 17:22:32
,
所有人可见
,
阅读 376
回文平方
python
def get(x):
return chr(x + 48) if x <= 9 else chr(x + 55)
def baseconter(num, base):
ls=[]
while num:
ls = [get(num % base)] + ls
num //= base
return ls
base = int(input())
for i in range(1, 301):
change = baseconter(i ** 2, base)
if change == change[::-1]:
print(''.join(baseconter(i, base)), ''.join(change))
c++
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
char get(int x)
{
if (x <= 9) return x + '0';
return x - 10 + 'A';
}
string base(int n, int b)
{
string num;
while (n) num += get(n % b), n /= b;
reverse(num.begin(), num.end());
return num;
}
bool check(string num)
{
for (int i = 0, j = num.size() - 1; i < j; i ++, j -- )
if (num[i] != num[j])
return false;
return true;
}
int main()
{
int b;
cin >> b;
for (int i = 1; i <= 300; i ++ )
{
auto num = base(i * i, b);
if (check(num))
cout << base(i, b) << ' ' << num << endl;
}
return 0;
}
//by y总