Martinue

摘要： Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number seque... 阅读全文

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

摘要： Problem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can d... 阅读全文

摘要： Problem Description The well-known Fibonacci sequence is defined as following: Here we regard n as the index of the Fibonacci number F(n). ... 阅读全文

摘要： Problem Description We know the Fibonacci Sequence F1=1,F2=1,F3=2,F4=3,F5=5, ... Fx = Fx-1+Fx-2 We want to know the Mth number which has K co... 阅读全文

摘要： Problem Description In mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contracti... 阅读全文

摘要： Problem Description Without expecting, Angel replied quickly.She says: "I'v heard that you'r a very clever boy. So if you wanna me be your GF, yo... 阅读全文

摘要： Problem Description 平面上有n条直线，且无三线共点，问这些直线能有多少种不同交点数。 比如,如果n=2,则可能的交点数量为0(平行)或者1(不平行)。 Input 输入数据包含多个测试实例,每个测试实例占一行,每行包含一个正整数n（n#include#inc... 阅读全文

摘要： Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5... 阅读全文

摘要： Problem Description 给你一个m×n的整数矩阵，在上面找一个x×y的子矩阵，使子矩阵中所有元素的和最大。 Input 输入数据的第一行为一个正整数T，表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y（0#include#include#in... 阅读全文