def n_to_ten(n,m): j = 0 sum =0 for i in str(m)[::-1]: sum += int(i)*n**j j += 1 return sum def ten_to_n(n,m): st='' while m!=0: st += str(m%n) m = m//n return st[::-1] n = int(input()) m = int(input()) step = 0 while step <=30: step += 1 if step == 31: print("Impossible!") break num = str(m) mun = num[::-1] ten_sum = n_to_ten(n,m)+n_to_ten(n,int(mun)) n_sum = ten_to_n(n,ten_sum) st = str(n_sum) #print(st) if st==st[::-1]: print(f"STEP={step}") break else: m = n_sum
0.0分
0 人评分
人见人爱A+B (C语言代码)浏览:787 |
C语言程序设计教程(第三版)课后习题10.3 (C语言代码)浏览:560 |
WU-蓝桥杯算法提高VIP-交换Easy (C++代码)浏览:1113 |
WU-图形输出 (C++代码)浏览:802 |
WU-陶陶摘苹果2 (C++代码)浏览:972 |
C语言程序设计教程(第三版)课后习题7.1 (C语言代码)浏览:611 |
C语言训练-自由落体问题 (C语言代码)浏览:611 |
打印十字图 (C语言代码)浏览:2708 |
简单的a+b (C语言代码)浏览:415 |
A+B for Input-Output Practice (VII) (C语言代码)浏览:523 |