旅途

摘要： Judge InfoMemory Limit: 32768KBCase Time Limit: 1000MSTime Limit: 1000MSJudger: Number Only JudgerDescription现在假设：2进制对应的基数是0,1;3进制对应的基数是0,1,2;……10进制对应的基数是0,1,2,3,4,5,6,7,8,9.……n进制对应的基数是0,1,2,3,……,n-1;你的任务是实现进制之间的转换。Input第一行，有t（t 2 #include 3 4 char str[1000];//输入字符串 5 int start[500],ans[500],res[5.. 阅读全文

摘要： Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: Number Only JudgerDescriptionA number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes hav 阅读全文

摘要： DescriptionThere is a company that makes plastic digits which are primarily put on the front door of each house to form the house number. In order to make sure that they don’t waste any resources, they want to make the exact number of digits for the house numbers needed. You are to write a program t 阅读全文

摘要： 进制转换Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18495Accepted Submission(s): 10386Problem Description输入一个十进制数N，将它转换成R进制数输出。Input输入数据包含多个测试实例，每个测试实例包含两个整数N(32位整数)和R（210）。Output为每个测试实例输出转换后的数，每个输出占一行。如果R大于10，则对应的数字规则参考16进制（比如，10用A表示，等等）。Sample In 阅读全文