vickey

A. Fox and Number Game n个数，She can do the following operation as many times as needed: select two different indexes i and j such that xi > xj hold, and then apply assignment xi = xi - xj. The goal

比赛时候完全想不明白该怎么做，刚刚看了大神“码年大吉”的题解原题解报告，顿时想明白，好开心 题意：      还是汉诺塔的规则，要求1，3根柱子，2，大盘子不能放在小盘子上。不同的是给了一3*3矩阵，cost[i][j] 代表从第i根到第j跟需要的花费。问n个盘子，从1号柱子搬到3号柱子的最小花费。 还是递归的思想。搬第 x个盘子时，需要考虑 上面的x-1个盘子移动的方式。   第一种

C. Restore Graph time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Valera had an undirected connected graph without self

Nearly each project of the F company has a whole team of developers working on it. They often are in different rooms of the office in different cities and even countries. To keep in touch and track th

E. Enemy is weak time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output The Romans have attacked again. This time they are m

C. Ryouko's Memory Note 题意： 给m 个数，0

题意： 给n*m 的矩阵，求

E. Domino Principle time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya is interested in arranging dominoes. He is