那些年

UVA - 10895Matrix TransposeTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit]  [Go Back]  [Status]  Description A: Matrix Transp

DescriptionCaptain Clearbeard decided to go to the harbour for a few days so his crew could inspect and repair the ship. Now, a few days later, the pirates are getting landsick(Pirates get landsic

Problem DescriptionGiven two matrices A and B of size n×n, find the product of them.bobo hates big integers. So you are only asked to find the result modulo 3. InputThe input consists of

DescriptionOn a number axis directed from the left rightwards, n marbles with coordinatesx1, x2, ..., xn are situated. Let's assume that the sizes of the marbles are infinitely small, that is

DescriptionThe Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".Nevertheless

Problem DescriptionI’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one a

Problem DescriptionKingdom Rush is a popular TD game, in which you should build some towers to protect your kingdom from monsters. And now another wave of monsters is coming and you need again to kn

Problem DescriptionOne day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a crazy problem for her.Bo

DescriptionAnton and Dasha like to play different games during breaks on checkered paper. By the 11th grade they managed to play all the games of this type and asked Vova the programmer to come up

DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind o

Problem DescriptionPM Room defines a sequence A = {A1, A2,..., AN}, each of which is either 0 or 1. In order to beat him, programmer Moor has to construct another sequence B = {B1, B2,... , BN} of

DescriptionOn Saint Valentine's Day, Alex imagined to present a special pendant to his girl friend made by K kind of pearls. The pendant is actually a string of pearls, and its length is defined a

题意：求经过所有的管道的最短路程，管道内的时间不算思路：首先BFS处理出管道出口到其他管道入口的距离，然后在队友的指导下明白了状态转移#include #include #include #include #include using namespace std;const int MAXN = 16;const int INF = 0x3f3f3f3f;struct N

DescriptionYou are not given n non-negative integersX0, X1,..., Xn-1 less than220, but they do exist, and their values never change.I'll gradually provide you some facts about them, and as

DescriptionProblem G - SummitsTime limit: 8 secondsYou recently started working for the largest map drawing company in theNetherlands. Part of your job is to determine what the summits in apar

Description  Black Box Our Black Box represents a primitive database. It can save an integer array and has a speciali variable. At the initial moment Black Box is empty and

Description Instant Complexity Analyzing the run-time complexity of algorithms is an important tool for designing efficient programs that solve a problem. An algorithm that r

DescriptionProblem G Toll! Revisited Input: Standard Input Output: Standard OutputTime Limit: 1 Second Sindbad the Sailor sold 66 silver spoons to the Sultan of Samarkand. The selling

DescriptionI IU P C2 0 06Problem G: Going in Cycle!!Input: standard input Output: standard output  You are given a weighted directed gra

DescriptionProblem D: Airport ExpressIn a small city called Iokh, a train service, Airport-Express, takes residents to the airport more quickly than other transports. There are

题意：著名的魔术师大卫科波菲尔喜欢表演下面的魔术：一个N行N列不同图片的矩阵出现在大屏幕上，我们给所有的图片这样命名: 每一个参与的观众被要求将手指放在左上方的图片上（即编号为1的图片），魔术师开始了：魔术师告诉观众在图片上移动k次（移动是把手指放到上下左右相邻的图片上，如果那儿有图片的话），然后他（魔术师）的手微微一指（指向一些图片）并说：“你不在这里”，然后……是真的！你的手指

题意：简单说就是将第i个簇号放回i,求最少的步数思路：只处理链形，和环形的情况，其他的可以不管，对于链形来说，只要倒置就行了，环形的找一个空闲的放一个，然后就是链形的情况了#include #include #include #include #include using namespace std;const int MAXN = 10005;int culsters[M

DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element

DescriptionKEY Inc., the leading company in security hardware, has developed a new kind of safe. To unlock it, you don't need a key but you are required to enter the correct n-digit code on a keyp

DescriptionProblem F: Tug of WarA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one tea

Problem DescriptionThere's a company with several projects to be done. Finish a project will get you profits. However, there are some technical problems for some specific projects. To solve the prob

Gargari is jealous that his friend Caisa won the game from the previous problem. He wants to prove that he is a genius.He has a n × n chessboard. Each cell of the chessboard has a number written on

Description Josephina is a clever girl and addicted to Machine Learning recently. She pays much attention to a method called Linear Discriminant Analysis, which has many interesting properties.I

Peter has a sequence of integers a1, a2, ..., an. Peter wants all numbers in the sequence to equalh. He can perform the operation of "adding one on the segment[l, r]": add one to all elements of t

You've got array a[1], a[2], ..., a[n], consisting ofn integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part

Paul hates palindromes. He assumes that strings is tolerable if each its character is one of the firstp letters of the English alphabet and s doesn't contain any palindrome contiguous substring

DescriptionA substring of a string T is defined as:T( i, k)= TiTi+1... Ti+k-1, 1≤ i≤ i+k-1≤| T|.Given two strings A, B and one integer K, we define S, a set of triples (i, j, k):S =

Problem DescriptionLee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it more fascinating. He drew his ideal pattern of the string o

Problem DescriptionMatt has a company, Always Cook Mushroom (ACM), which produces high-quality mushrooms. ACM has a large field to grow their mushrooms. The field can be considered as a 1000 *

Problem DescriptionIn this problem, you are given a string s and q queries.For each query, you should answer that when all distinct substrings of string s were sorted lexicographically, which

Problem DescriptionYou have an array consisting of n integers: a1=1,a2=2,a3=3,…,an=n. Then give you m operators, you should process all the operators in order. Each operator is one of four types

Description Sewing Buttons with Grandma After so many years of studying math in the Academy of Colombian Mathematics (ACM) in the tropic, Eloi has finally decided to visit hi

DescriptionA Lexicographic OrderInput: Standard Input Output: Standard Output  The alphabet of a certain alien language consists of n distinct symbols. The

DescriptionProblem H: Queuing at the doctors Due to the increasing number of weird viruses spreading around, all the members of the International Confederation of Revolver Enthusiasts (ICORE) ar

Description Problem E: Chainsaw Massacre Background As every year the Canadian Lumberjack Society has just held its annual woodcutting competition and the national forest