摘要： #includeusing namespace std;int main(void){ int n; while(cin>>n) { if (n%4==2) cout=2).InputInput consists of a seq... 阅读全文

摘要： Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k same char... 阅读全文

摘要： Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of... 阅读全文

摘要： Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then... 阅读全文

摘要： Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations o... 阅读全文

摘要： Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.... 阅读全文

摘要： Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at wh... 阅读全文

摘要： Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircl... 阅读全文

摘要： Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this ... 阅读全文

摘要： Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are... 阅读全文