Lee是美少女

摘要： My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F... 阅读全文

摘要： Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescriptionBefore the invention of book-printing, it was very hard to make a copy of a b... 阅读全文

摘要： Time Limit:7000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionIn this problem, you have to analyze a particular sorting algorithm. Th... 阅读全文

摘要： Let us consider sets of positive integers less than or equal to n. Note that all elements of a set are different. Also note that the order of element... 阅读全文

摘要： Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionThere is a piece of paper in front of Tom, its length and width are int... 阅读全文

摘要： Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionAndrewid the Android is a galaxy-famous detective. In his free time he... 阅读全文

摘要： Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of themaximum positive product involving consecutive ter... 阅读全文

摘要： Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription给你一个高为n ，宽为m列的网格，计算出这个网格中有多少个矩形，下图为高为2，宽为4的网格. Input第一行输入一个t, 表示有t组数据，... 阅读全文

摘要： A - Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSuDescriptionWrite a program that finds and displays all pairs of 5-digit numbers th... 阅读全文

摘要： 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 to calcul... 阅读全文