Painting、时光

摘要： You are givennk-digit integers. You have to rearrange the digits in the integers so that the difference between the largest and the smallest number wa... 阅读全文

摘要： /* map 向量可以存东西与数的大小无关，只与数的数目有关 */#include#include#include#includeusing namespace std;mapa;int main(){ for(int i = 0; i <= 32000; i++){ a[... 阅读全文

摘要： Right turnfrog is trapped in a maze. The maze is infinitely large and divided into grids. It also consists ofnobstacles, where thei-th obstacle lies i... 阅读全文

摘要： ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyo... 阅读全文

摘要： The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a co... 阅读全文

摘要： 操作大全：http://wiki.ubuntu.org.cn/Ubuntu%E6%A1%8C%E9%9D%A2%E5%85%A5%E9%97%A8%E6%8C%87%E5%8D%97使用终端编译方法:alt + cirl + T 打开终端 输入vim 即可打开vim再打开一个终端 输入g++ -v编... 阅读全文

摘要： Problem DescriptionPog and Szh are playing games.There is a sequence with $n$ numbers, Pog will choose a number A from the sequence. Szh will choose a... 阅读全文

摘要： DescriptionSuppose we have n ropes of equal length and we want to use them to lift some heavy object. A tear-off weight t is associated to each rope, ... 阅读全文

摘要： Description一条小溪尺寸不大，青蛙可以从左岸跳到右岸，在左岸有一石柱L，面积只容得下一只青蛙落脚，同样右岸也有一石柱R，面积也只容得下一只青蛙落脚。有一队青蛙从尺寸上一个比一个小。我们将青蛙从小到大，用1，2，…，n编号。规定初始时这队青蛙只能趴在左岸的石头L上，当然是一个落一个，小的落在... 阅读全文

摘要： You are given a non-negative integern, its decimal representation consists of at most100digits and doesn't contain leading zeroes.Your task is to dete... 阅读全文