上一页 1 2 3 4 5 6 ··· 11 下一页
摘要: 10892 LCM CardinalityA pair of numbers has a unique LCM but a single number can be the LCM of more than one possiblepairs. For example 12 is the LCM o 阅读全文
posted @ 2016-09-04 01:03 Yan_Bin 阅读(203) 评论(0) 推荐(0) 编辑
摘要: 10780 Again Prime? No time.The problem statement is very easy. Given a number n you have to determine the largest power of m,not necessarily prime, th 阅读全文
posted @ 2016-09-04 00:28 Yan_Bin 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 10943 How do you add?Larry is very bad at math — he usually uses a calculator, which workedwell throughout college. Unforunately, he is now struck in 阅读全文
posted @ 2016-09-03 17:56 Yan_Bin 阅读(153) 评论(0) 推荐(0) 编辑
摘要: 有两种计算方式,直接计算或者递推计算: 阅读全文
posted @ 2016-09-03 17:16 Yan_Bin 阅读(157) 评论(0) 推荐(0) 编辑
摘要: 11889 BenefitRecently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, hewho never has appropriate changes, asks fo 阅读全文
posted @ 2016-09-03 16:16 Yan_Bin 阅读(226) 评论(0) 推荐(0) 编辑
摘要: 11388 GCD LCMThe GCD of two positive integers is the largest integer that divides both the integers without anyremainder. The LCM of two positive inte 阅读全文
posted @ 2016-09-03 11:40 Yan_Bin 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 通过展示STL中已存在的lowerbound和uppebound函数来展示二分查找。 阅读全文
posted @ 2016-09-02 20:04 Yan_Bin 阅读(125) 评论(0) 推荐(0) 编辑
摘要: 12096 The SetStack ComputerBackground from Wikipedia: \Set theory is a branch ofmathematics created principally by the German mathe-matician Georg Can 阅读全文
posted @ 2016-09-02 19:36 Yan_Bin 阅读(436) 评论(0) 推荐(0) 编辑
摘要: 题意: 输入一些单词,找出所有满足以下条件的单词:该单词不能通过字母重排得到输入文本中的另外一个单词。在判断是否满足条件时,字母不区分大小写,但在输出时应该保留输入中的大小写,按字典序进行排列。 分析: 将输入的单词进行“标准化”,即将单词中的每个字母化为小写并按字典序重排单词,用一个字典来统计一个 阅读全文
posted @ 2016-09-02 17:59 Yan_Bin 阅读(441) 评论(0) 推荐(0) 编辑
摘要: 400 Unix lsThe computer company you work for is introducing a brand new computer line and is developing a newUnix-like operating system to be introduc 阅读全文
posted @ 2016-09-02 17:25 Yan_Bin 阅读(241) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 ··· 11 下一页