搜索
zitian246
左耳靠近心脏,甜言蜜语要说给左耳听。
展开
-
LightOJ - 1141 Number Transformation
In this problem, you are given an integer number s. You can transform any integer number A to another integer numberB by adding x to A. This x is an integer number which is a prime factor of A (plea原创 2017-07-13 16:56:38 · 343 阅读 · 0 评论 -
51Nod - 1649 齐头并进(BFS,坑~~~)
在一个叫奥斯汀的城市,有n个小镇(从1到n编号),这些小镇通过m条双向火车铁轨相连。当然某些小镇之间也有公路相连。为了保证每两个小镇之间的人可以方便的相互访问,市长就在那些没有铁轨直接相连的小镇之间建造了公路。在两个直接通过公路或者铁路相连的小镇之间移动,要花费一个小时的时间。现在有一辆火车和一辆汽车同时从小镇1出发。他们都要前往小镇n,但是他们中途不能同时停在同一个小镇(但是可以同时停在小镇原创 2017-12-09 19:17:37 · 539 阅读 · 0 评论 -
HihoCoder - 1632 Secret Poems
The Yongzheng Emperor (13 December 1678 – 8 October 1735), was the fifth emperor of the Qing dynasty of China. He was a very hard-working ruler. He cracked down on corruption and his reign was known f原创 2017-12-06 20:57:26 · 165 阅读 · 0 评论 -
hdu-1258 Sum It Up(dfs+去重)
Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], the...原创 2018-03-09 20:03:16 · 540 阅读 · 0 评论 -
POJ 1724 ROADS (dfs+剪枝+邻接表)
N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (expressed in th原创 2018-03-22 21:40:16 · 303 阅读 · 0 评论 -
2016年第七届蓝桥杯C/C++程序设计本科B组省赛 剪邮票(dfs填空)
如【图1.jpg】, 有12张连在一起的12生肖的邮票。现在你要从中剪下5张来,要求必须是连着的。(仅仅连接一个角不算相连)比如,【图2.jpg】,【图3.jpg】中,粉红色所示部分就是合格的剪取。请你计算,一共有多少种不同的剪取方法。请填写表示方案数目的整数。注意:你提交的应该是一个整数,不要填写任何多余的内容或说明性文字。思路:先用一个dfs搜五个数的组合,再用一个dfs搜是否连通,,,,首先...原创 2018-03-24 19:35:05 · 217 阅读 · 0 评论 -
POJ1376 --Robot+译文(BFS+地图转化+细心)
The Robot Moving Institute is using a robot in their local store to transport different items. Of course the robot should spend only the minimum time necessary when travelling from one place in the st...原创 2018-04-17 17:05:50 · 397 阅读 · 0 评论 -
HDU-1043 POJ -1077 Eight(A*算法)
The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed...原创 2018-04-12 17:54:03 · 591 阅读 · 1 评论 -
POJ2342 Anniversary party
链接:http://poj.org/problem?id=2342Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10326 Accepted: 5913DescriptionThere is going to be a party to celebrate the 80-th Anniversa...原创 2018-04-07 10:49:48 · 150 阅读 · 0 评论 -
UVA - 307 Sticks (dfs+剪枝)
George took sticks of the same length and cut them randomly until all parts became at most 50 unitslong. Now he wants to return sticks to the original state, but he forgot how many sticks he had ori原创 2017-11-01 21:02:51 · 184 阅读 · 0 评论 -
UVA-136 Ugly Numbers (map容器+优先队列)
题目链接:https://cn.vjudge.net/problem/UVA-136题意:如果一个数的因子只由2,3,5,组成,则这个数被称为丑数。按照惯例,1也被称为丑数。求第1500个丑数并·输出。这道题没有数据输入。思路:题意很简单,但一不小心就会超时。。。。。(但也有收获)。 为了节省时间,我们可以用优先队列来做。但你用什么来标记一个数出现过了呢。数组吗,存不下,原创 2017-11-07 20:17:11 · 140 阅读 · 0 评论 -
POJ - 1426 Find The Multiple
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there原创 2017-07-20 20:17:57 · 378 阅读 · 3 评论 -
CodeForce 825B Five-In-a-Row
Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts.In current match th原创 2017-07-21 08:27:25 · 551 阅读 · 0 评论 -
POJ 3669 Meteor Shower
Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a sa原创 2017-07-21 08:47:50 · 299 阅读 · 0 评论 -
POJ - 1753Flip Game
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's bl原创 2017-07-13 16:49:47 · 218 阅读 · 0 评论 -
HDU - 2822 Dogs (优先队列+bfs)
Prairie dog comes again! Someday one little prairie dog Tim wants to visit one of his friends on the farmland, but he is as lazy as his friend (who required Tim to come to his place instead of going t原创 2017-08-03 15:31:27 · 202 阅读 · 0 评论 -
POJ - 3021 e-Coins (BFS)
At the Department for Bills and Coins, an extension of today's monetary system has newly been proposed, in order to make it fit the new economy better. A number of new so called e-coins will be produc原创 2017-07-27 14:24:19 · 234 阅读 · 0 评论 -
POJ - 1088 滑雪(在这里dp和记忆化搜索有区别吗)
Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12原创 2017-08-14 08:54:16 · 162 阅读 · 0 评论 -
hdu-1978 How many ways
Problem Description这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下:1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。原创 2017-09-17 08:28:08 · 551 阅读 · 0 评论 -
HDU - 1078 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 location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmo原创 2017-09-17 08:09:09 · 289 阅读 · 0 评论 -
CodeForces - 540C Ice Cave 队列bfs
You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through原创 2017-09-26 20:43:43 · 306 阅读 · 0 评论