摘要: 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.. 阅读全文
posted @ 2013-07-18 23:17 Levi.duan 阅读(284) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2013-07-18 14:30 Levi.duan 阅读(189) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2013-07-18 12:54 Levi.duan 阅读(188) 评论(0) 推荐(0)
摘要: 进制转换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 阅读全文
posted @ 2013-07-18 01:19 Levi.duan 阅读(326) 评论(0) 推荐(0)
摘要: Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: NormalDescriptionA boy and a girl both like studying code in their extra-curricular. Of course, they like each other. Therefore, the boy shows his love to the girl one day. The girl smiles and leaves a series of Morse 阅读全文
posted @ 2013-07-17 21:59 Levi.duan 阅读(279) 评论(0) 推荐(0)
摘要: Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: Number Only JudgerDescriptionFrog Frank likes 30 more than likes 40, yet he likes 12 and 39 equally. This is because he likes numbers that have a lot of different prime factors. For example, 30 have 3 prime factors (2, 阅读全文
posted @ 2013-07-17 21:11 Levi.duan 阅读(272) 评论(0) 推荐(0)
摘要: 描述某校的惯例是在每学期的期末考试之后发放奖学金。发放的奖学金共有五种,获取的条件各自不同:1) 院士奖学金,每人8000元,期末平均成绩高于80分(>80),并且在本学期内发表1篇或1篇以上论文的学生均可获得;2) 五四奖学金,每人4000元,期末平均成绩高于85分(>85),并且班级评议成绩高于80分(>80)的学生均可获得;3) 成绩优秀奖,每人2000元,期末平均成绩高于90分(>90)的学生均可获得;4) 西部奖学金,每人1000元,期末平均成绩高于85分(>85)的西部省份学生均可获得;5) 班级贡献奖,每人850元,班级评议成绩高于80分(>8 阅读全文
posted @ 2013-07-17 21:03 Levi.duan 阅读(236) 评论(0) 推荐(0)
摘要: * 没有必要撒谎写简历最差的策略就是撒谎了。这种欺骗本身就自相矛盾。你到底希望和聪明人共事呢,还是笨人呢?大多数人希望和聪明人共事,但是聪明人你骗得了么, 或者说被你骗了的算是你认为的聪明人么?你要和想找好工作,基本假设就是大家都是明白人不好骗的。看简历的人也上过学,也写过简历,更清楚其中的注水手 段,以为自己能吹牛过关,大部分都是自取其辱。即便你过了简历筛选一关,也没那么容易,面试时候肯定会问你那些你写的东西,你答不上来,面试官还会觉得你 人品有问题。有的同学说多参加几次面试不好么,好,但不能用这种方式,这完全就是自毁前程。* 看你简历的那个人某种程度上他在暗你在明,他了解的信息更多,信息非 阅读全文
posted @ 2013-07-16 20:49 Levi.duan 阅读(145) 评论(0) 推荐(0)
摘要: Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: NormalDescriptionAn anagram is formed by rearranging the letters of a word. You are given a string, please find out if it is an anagram of a word or not. No word will have have more than 50 characters.InputThe input wi 阅读全文
posted @ 2013-07-14 16:02 Levi.duan 阅读(207) 评论(0) 推荐(0)
摘要: Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: Number Only JudgerDescriptionIn the kingdom of frog, the most popular sport is jumping up and down. Frog likes to jump up(go higher) or jump down(go lower) but jump at the same height(not go higher,and not go lower). T 阅读全文
posted @ 2013-07-13 08:59 Levi.duan 阅读(287) 评论(0) 推荐(0)