
搜索
J1nAB1n9
困困倦倦,浑浑噩噩
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Can you solve this equation? (二分搜索)解题报告
Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try your lucky.InputThe first line of the input contains an integer T(1Outpu原创 2017-07-31 09:49:41 · 443 阅读 · 0 评论 -
UVa 208 Firetruck 消防车
The Center City fire department collaborates with the transportation department to maintain mapsof the city which reflects the current status of the city streets. On any given day, several street原创 2017-07-31 15:15:04 · 613 阅读 · 0 评论 -
UVa 225 Golygons (黄金图型)——我有与众不同的剪枝
Imagine a country whose cities have all their streets laid out in a regular grid. Now suppose that atourist with an obsession for geometry is planning expeditions to several such cities.Starting eac原创 2017-08-01 10:05:00 · 742 阅读 · 1 评论 -
HDU 1372 骑士巡回问题
Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n原创 2017-08-05 11:32:50 · 522 阅读 · 0 评论 -
基础搜索题 最少转弯问题
最少转弯问题 时间限制: 1 Sec 内存限制: 128 MB原创 2017-07-29 21:33:21 · 1558 阅读 · 0 评论 -
UVA - 1616 Caravan Robbers (二分搜索)
Caravan Robbers题目描述: Long long ago in a far far away land there were two great cities and The Great Caravan Road between them. Many robber gangs “worked” on that road. By an old custom the i-th ba原创 2017-09-12 21:10:53 · 429 阅读 · 0 评论 -
hdu 2181 哈密顿绕行世界问题(DFS)
hdu 2181 哈密顿绕行世界问题一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每原创 2017-11-24 11:26:11 · 312 阅读 · 0 评论 -
HDU - 6386 Age of Moyu (搜索)
Mr.Quin love fishes so much and Mr.Quin’s city has a nautical system,consisiting of NN ports and MM shipping lines. The ports are numbered 11 to NN. Each line is occupied by a Weitian. Each Weitian ha...原创 2018-08-14 15:43:23 · 274 阅读 · 0 评论