import java.util.Scanner; public class Main { /* * scale字符串对应的是十六进制以内,各个输的范围,在做加法时,用每个字符对应的index相加即可 */ static final String scale = "0123456789ABCDEF"; /* * 判断是否为回文数,是返回true,否则返回false */ public static boolean isPlindrome(String s) { String str = String.valueOf(s); for(int i=0; i<str.length()/2; i++) { if(str.charAt(i)!=str.charAt(str.length()-1-i)) { return false; } } return true; } /* * 将字符串反转,返回一个字符串 */ public static String digitalReversal(String s) { StringBuffer sb = new StringBuffer(""); for(int i=s.length()-1; i>=0; i--) { sb.append(String.valueOf(s.charAt(i))); } return sb.toString(); } /* * 高精度加法,得到一个数与其数为反转后的数的和,返回为一个字符串 */ public static String add_AB(String A, String B, int k) { int temp = 0; int len = A.length(); char[] a = A.toCharArray(); char[] b = B.toCharArray(); StringBuffer sb = new StringBuffer(""); for(int i=0; i<len; i++) { int m = scale.indexOf(String.valueOf(a[i]))+scale.indexOf(String.valueOf(b[i]))+temp; if(m>=k) { temp = m/k; m = m%k; }else { temp = 0; } sb.append(String.valueOf(scale.charAt(m))); } if(temp!=0) { sb.append(String.valueOf(scale.charAt(temp))); } return digitalReversal(sb.toString()); } public static void main(String args[]) { Scanner input = new Scanner(System.in); int k = input.nextInt(); String s = input.next(); int count = 0; while(!isPlindrome(s) && count<=30) { s = add_AB(s, digitalReversal(s),k); count++; } if(isPlindrome(s) && count<=30) { System.out.println("STEP="+count); }else { System.out.println("Impossible!"); } } }
原文:https://www.cnblogs.com/shiaguang/p/12371492.html