https://www.luogu.org/problemnew/show/P1206

題解：

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,q; int ans,cnt,flag,temp,sum; int a[N]; char str[25]="0123456789ABCDEFGHIJKLMN"; struct node{int a[N];int b[N];bool check(){int x=b[0]/2;for(int i=1;i<=x;i++){if(b[i]!=b[b[0]-i+1])return 0;}return 1;}node(){};void init(int x){int A=x;int cnt=0;while(A){a[++cnt]=A%n;A/=n;}a[0]=cnt;int B=x*x;cnt=0;while(B){b[++cnt]=B%n;B/=n;}b[0]=cnt;}}num; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);num.a[0]=1;for(int i=1;i<=300;i++){num.init(i);if(num.check()){for(int i=num.a[0];i>=1;i--){printf("%c",str[num.a[i]]);}printf(" ");for(int i=num.b[0];i>=1;i--){printf("%c",str[num.b[i]]);}printf("\n");}}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的[USACO1.2]回文平方数 Palindromic Squares的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。