Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
设k从r2-1到r1+1递减变化,将k化为b1进制,结果m,再将m当作b2进制化为10进制,结果为n,若n能被k整除,则说明k是所求最大整数,否则重复这个过程,直到结束Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator