2016年3月22日
摘要：
Problem Description Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describ... 阅读全文
2016年3月22日
2016年3月21日
摘要：
Problem Description lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to thi... 阅读全文
摘要：
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all ... 阅读全文
摘要：
辗转相除法，又被称为欧几里德（Euclidean）算法， 是求最大公约数的算法。 当然也可以求最小公倍数。算法描述 两个数a，b的最大公约数记为GCD(a,b)。a，b的最大公约数是两个数的公共素因子的乘积。如462可以分解成2 × 3 × 7 × 11；1071可以分解成3 ×... 阅读全文
摘要：
Problem Description Given a string containing only ‘A’ - ‘Z’, we could encode it using the following method: Each sub-string containing k sam... 阅读全文
2016年3月20日
摘要：
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure trans... 阅读全文
摘要：
Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges’ favorite tim... 阅读全文
摘要：
Problem Description A simple mathematical formula for e is where n is allowed to go to infinity. This can actually yield very accurate approx... 阅读全文
摘要：
归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。归并排序，其的基本思路就是将数组分成二组A，B，如果这二组组内的数据都是有序的，那么就可以很方便的将这二组数据进行排序。如何让这二组组内数据有序了？ 可以... 阅读全文
2016年3月18日
摘要：
Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers de... 阅读全文