P1206 [USACO1.2]回文平方数 Palindromic Squares

R40786577

problem/P1206/P1206.cpp

@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class node {
+  private:
+    char c(int x) {
+        if (0 <= x && x <= 9) {
+            return x + '0';
+        }
+        return x - 10 + 'A';
+    }
+    int len;
+    int nums[20];
+
+  public:
+    node() {
+        len = 0;
+    }
+    node(int x, int b) {
+        len = 0;
+        while (x) {
+            nums[len] = x % b;
+            x /= b;
+            len++;
+        }
+    }
+
+    int& operator[](int x) {
+        return nums[x];
+    }
+
+    const char* c_str() {
+        string s;
+        for (int i = len - 1; i >= 0; i--) {
+            s.push_back(c(nums[i]));
+        }
+        return s.c_str();
+    }
+    string print() {
+        for (int i = len - 1; i >= 0; i--) {
+            cout << c(nums[i]);
+        }
+        return "";
+    }
+    bool check() {
+        for (int i = 0; i < len; i++) {
+            if (nums[i] != nums[len - i - 1]) {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+
+int main() {
+    int b;
+    cin >> b;
+    for (int i = 1; i <= 300; i++) {
+        node t = node(i * i, b);
+        if (t.check()) {
+            cout << node(i, b).print() << ' ' << t.print() << endl;
+        }
+    }
+    return 0;
+}