Qtt110-CSDN博客

原创 GCD and LCM HDU - 4497

Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? Note, gcd(x, y, z) means the greatest common d...

2018-09-02 20:46:40 176

原创两点 51Nod - 1416

福克斯在玩一款手机解迷游戏，这个游戏叫做”两点”。基础级别的时候是在一个n×m单元上玩的。像这样：每一个单元有包含一个有色点。我们将用不同的大写字母来表示不同的颜色。这个游戏的关键是要找出一个包含同一颜色的环。看上图中4个蓝点，形成了一个环。一般的，我们将一个序列 d1,d2,...,dk 看成一个环，当且仅当它符合下列条件时：1. 这k个点不一样，即当 i≠j时， d...

2018-09-02 20:30:23 181

原创 Stars Drawing (Hard Edition) CodeForces - 1015E2

A star is a figure of the following type: an asterisk character '*' in the center of the figure and four rays (to the left, right, top, bottom) of the same positive length. The size of a star is the l...

2018-09-02 20:15:37 706

原创 Super Jumping! Jumping! Jumping!

Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. The game ...

2018-08-26 21:07:43 143

原创传染病控制 SCU - 2118

Description 【问题背景】近来，一种新的传染病肆虐全球。蓬莱国也发现了零星感染者，为防止该病在蓬莱国大范围流行，该国政府决定不惜一切代价控制传染病的蔓延。不幸的是，由于人们尚未完全认识这种传染病，难以准确判别病毒携带者，更没有研制出疫苗以保护易感人群。于是，蓬莱国的疾病控制中心决定采取切断传播途径的方法控制疾病传播。经过 WHO（世界卫生组织）以及全球各国科研部门的努力，这种新兴传染...

2018-08-26 21:02:39 189

原创 Robot Rapping Results Report CodeForces - 645D

While Farmer John rebuilds his farm in an unfamiliar portion of Bovinia, Bessie is out trying some alternative jobs. In her new gig as a reporter, Bessie needs to know about programming competition re...

2018-08-26 20:20:35 143

原创度度熊学队列 HDU - 6375

度度熊正在学习双端队列，他对其翻转和合并产生了很大的兴趣。初始时有 NN 个空的双端队列（编号为 11 到 NN ），你要支持度度熊的 QQ 次操作。 ①11 uu ww valval 在编号为 uu 的队列里加入一个权值为 valval 的元素。（w=0w=0 表示加在最前面，w=1w=1 表示加在最后面）。 ②22 uu ww 询问编号为 uu 的队列里的某个元素并删除它。（ w=0w...

2018-08-26 19:59:27 149

原创 The Falling Leaves UVA - 699

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha...

2018-08-26 19:51:24 147

原创 Tree UVA - 548

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o...

2018-08-26 19:43:48 172

原创 Not so Mobile UVA - 839

uva 839 Not so Mobile-S.B.S.Before being an ubiquous communications gadget, a mobilewas just a structure made of strings and wires suspendingcolourfull things. This kind of mobile is usually found...

2018-08-26 19:36:37 143

原创 The order of a Tree HDU - 3999

As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely: 1. insert a key k to a empty tree, then the tree become a tree with only one node; ...

2018-08-26 19:22:51 132

原创 Trees on the level

Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental to...

2018-08-26 19:06:15 173

原创二叉搜索树 HDU - 3791

判断两序列是否为同一二叉搜索树序列Input开始一个数n，(1<=n<=20) 表示有n个需要判断，n= 0 的时候输入结束。接下去一行是一个序列，序列长度小于10，包含(0~9)的数字，没有重复数字，根据这个序列可以构造出一颗二叉搜索树。接下去的n行有n个序列，每个序列格式跟第一个序列一样，请判断这两个序列是否能组成同一颗二叉搜索树。Output如果序列相同则...

2018-08-26 18:49:25 235

原创 Elven Postman HDU - 5444

Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees. However, there is somet...

2018-08-19 20:26:09 165

原创 Military Problem CodeForces - 1006E

In this problem you will have to help Berland army with organizing their command delivery system.There are nn officers in Berland army. The first officer is the commander of the army, and he does no...

2018-08-19 19:58:57 186

原创 Functions again CodeForces - 789C

Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arr...

2018-08-19 19:24:05 216

原创 Mr. Kitayuta's Colorful Graph CodeForces - 505B

Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex a...

2018-08-19 18:27:48 232

原创 Tree Recovery POJ - 2255

Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creati...

2018-08-19 18:00:51 235

原创 Drainage Ditches HDU - 1532

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...

2018-08-16 21:31:27 131

原创 Parity 51Nod - 1204

你的朋友写下一串包含1和0的串让你猜，你可以从中选择一个连续的子串（例如其中的第3到第5个数字）问他，该子串中包含了奇数个还是偶数个1，他会回答你的问题，然后你可以继续提问......你怀疑朋友的答案可能有错，或说同他之前的答案相互矛盾，例如：1 - 2 奇数，3 - 4 奇数，那么可以确定1 - 4 一定是偶数，如果你的朋友回答是奇数，就产生了矛盾。给出所有你朋友的答案，请你找出第一个出现矛盾的...

2018-08-16 21:18:41 148

原创 Ice_cream's world I HDU - 2120

ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtower...

2018-08-16 21:03:51 111

原创 Fox And Names CodeForces - 510C

Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: "Fox"). She heard a rumor: the authors list on the paper is always sorted in the lexicographical order.After...

2018-08-16 20:49:19 176

原创 Slim Span POJ - 3522

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} and E is a set of...

2018-08-16 20:22:04 140

原创 Minimum Transport Cost HDU - 1385

These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transpor...

2018-08-16 20:01:52 159

原创 Subway POJ - 2502

You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want ...

2018-08-14 20:54:36 158

原创 Wormholes POJ - 3259

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i...

2018-08-14 20:46:06 159

原创 Play on Words POJ - 1386

Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very impo...

2018-08-14 20:32:18 146

原创确定比赛名次 HDU - 1285

有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确定排名。 Input输入有若干组，每组中的第一行为二个数N（1<=N<=500），M；其中N表...

2018-08-14 20:12:45 130

原创六度分离 HDU - 1869

1967年，美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说，大意是说，任何2个素不相识的人中间最多只隔着6个人，即只用6个人就可以将他们联系在一起，因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验，一直也有很多社会学家对其兴趣浓厚，但是在30多年的时间...

2018-08-14 20:02:46 111

原创最短路径问题 HDU - 3790

给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点。n和m为0时输入结束。 (1<n<=1000, 0<m&...

2018-08-14 19:39:09 300

原创食物链

动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话...

2018-08-14 19:25:55 381

原创数组的最大代价 51Nod - 1270

数组A包含N个元素A1, A2......AN。数组B包含N个元素B1, B2......BN。并且数组A中的每一个元素Ai，都满足1 <= Ai <= Bi。数组A的代价定义如下：（公式表示所有两个相邻元素的差的绝对值之和）给出数组B，计算可能的最大代价S。Input第1行：1个数N，表示数组的长度(1 <= N <= 50000)。第...

2018-08-09 20:56:25 103

原创 Is It A Tree? POJ - 1308

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There ...

2018-08-09 20:49:52 102

原创小希的迷宫 HDU - 1272

上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的...

2018-08-09 20:38:28 107

原创确定比赛名次

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n,m,a,b;int s[550][550],lose[550],num[550];void fun(){ int win,ans=0; for(int i=0; i<...

2018-08-07 21:16:23 142

原创 Cheapest Palindrome POJ - 3280

Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass by...

2018-08-05 20:36:51 183

原创 FatMouse's Speed HDU - 1160

FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence...

2018-08-05 20:19:58 184

原创最长公共上升子序列的DP解法及其优化

定义状态F[i][j]表示以a串的前i个整数与b串的前j个整数且以b[j]为结尾构成的LCIS的长度。状态转移方程：①F[i][j] = F[i-1][j] (a[i] != b[j])②F[i][j] = max(F[i-1][k]+1) (1 <= k <= j-1 && b[j] > b[k])现在我们来说为什么会是这样的状态转移方程呢？...

2018-08-05 19:43:39 187

原创 Greatest Common Increasing Subsequence

This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.InputEach sequence is described with M - its length (1 <= M <= 500) and M integer numbers...

2018-08-05 19:39:35 146

原创 Largest Rectangle in a Histogram HDU - 1506

A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows ...

2018-08-05 19:02:44 166

空空如也

空空如也