转置运算是一种最简单的矩阵运算，对于一个m*n的矩阵M( 1 = < m < = 10000,1 = < n < = 10000 )，它的转置矩阵T是一个n*m的矩阵，且T( i , j )=M( j , i )。显然，一个稀疏矩阵的转置仍然是稀疏矩阵。你的任务是对给定一个m*...

对于一个n*n的稀疏矩阵M(1 <= n <= 1000)，采用三元组顺序表存储表示，查找从键盘输入的某个非零数据是否在稀疏矩阵中，如果存在则输出OK，不存在则输出ERROR。稀疏矩阵示例图如下：...

C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所...

Time Limit: 1000 msMemory Limit: 65536 KiB

Input3个正整数A B C，中间用空格分隔。(1 <= A,B,C <= 10^9)Output输出计算结果Sample Input

Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There ...

Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as possible. Thu...

给定两个字符串string1和string2，判断string2是否为string1的子串。

有n个小朋友，每个小朋友手里有一些糖块，现在这些小朋友排成一排，编号是由1到n。现在给出m个数，能不能唯一的确定一对值l和r(l <= r)，使得这m个数刚好是第l个小朋友到第r个小朋友手里的糖块数？...

N wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the m...