hqf1992的专栏

Fire NetSuppose that we have a square city withstraight streets. A map of a city is a square board with n rows and n columns,each representing a street or a piece of wall.A blockhouse is a small c

Anagrams by Stack How can anagrams result from sequences ofstack operations? There are two sequences of stack operators which can convertTROT to TORT:[i i i i o o o oi o i i o o i o]wher

FatMouse and Cheese FatMouse has stored some cheese in a city.The city can be considered as a square grid of dimension n: each grid locationis labelled (p,q) where 0 <= p < n and 0 <= q < n. At ea

Additive equationsTime Limit: 10 Seconds      Memory Limit: 32768 KB    We all understandthat an integer set is a collection of distinct integers. Now the question is:given an integer

Perfect CubesDescriptionFor hundreds ofyears Fermat's Last Theorem, which stated simply that for n > 2 there existno integers a, b, c > 1 such that a^n = b^n + c^n, has remained elusivelyunproven.

MatrixDescriptionGiven an n*nmatrix A, whose entries Ai,j are integer numbers ( 0 <= i < n, 0 <= j< n ). An operation SHIFT at row i ( 0 <= i < n ) will move theintegers in the row one position ri

SquareDescriptionGiven a set ofsticks of various lengths, is it possible to join them end-to-end to form asquare?InputThe first line ofinput contains N, the number of test cases. Each test cas