kuangbin带你飞
[kuangbin带你飞]专题1-23
剑气扬名
这个作者很懒,什么都没留下…
展开
-
kuangbin带你飞 专题1-23 题单
kuangbin大神,对于打过ACM比赛的ACMer,无人不知无人不晓。 在此,附上vjudge平台上一位大神整理的[kuangbin带你飞]专题目录链接。[kuangbin带你飞专题目录1-23] : https://vjudge.net/article/187专题一 简单搜索POJ 1321 棋盘问题POJ 2251 Dungeon MasterPOJ 3278 Catch That...原创 2020-01-27 10:07:07 · 2758 阅读 · 0 评论 -
HDU 1213 How Many Tables
How Many Tableshttps://vjudge.net/problem/HDU-1213Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have t...原创 2020-04-16 15:41:53 · 178 阅读 · 0 评论 -
POJ 1611 The Suspects
The Suspectshttps://vjudge.net/problem/POJ-1611Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize ...原创 2020-04-16 14:33:23 · 234 阅读 · 0 评论 -
POJ 2236 Wireless Network
Wireless Networkhttps://vjudge.net/problem/POJ-2236An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an u...原创 2020-04-16 11:01:45 · 220 阅读 · 0 评论 -
HDU 1875 畅通工程再续 Kruskal
畅通工程再续http://acm.hdu.edu.cn/showproblem.php?pid=1875Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他...原创 2020-02-04 17:00:43 · 182 阅读 · 0 评论 -
HDU1233还是畅通工程 HDU1863畅通工程 HDU1879继续畅通工程 Kruskal模板题
省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。...原创 2020-02-04 11:17:35 · 258 阅读 · 0 评论 -
UVA 11624 Fire!
Fire!https://vjudge.net/problem/UVA-11624Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe esca...原创 2020-01-31 20:27:17 · 224 阅读 · 0 评论 -
FZU 2150 Fire Game
Fire GameFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then ...原创 2020-01-31 18:27:01 · 256 阅读 · 0 评论 -
HDU 2612 Find a way
Find a wayhttps://vjudge.net/problem/HDU-2612Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a goo...原创 2020-01-31 16:41:22 · 186 阅读 · 0 评论 -
HDU 1241 Oil Deposits
Oil Depositshttps://vjudge.net/problem/HDU-1241The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of l...原创 2020-01-29 20:07:20 · 231 阅读 · 0 评论 -
POJ 3984 迷宫问题
迷宫问题https://vjudge.net/problem/POJ-3984定义一个二维数组:int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序...原创 2020-01-29 19:17:15 · 338 阅读 · 1 评论 -
POJ 3414 Pots
Potshttps://vjudge.net/problem/POJ-3414You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:1.FILL(i) fill the pot i (1 ≤ i ≤ 2...原创 2020-01-29 17:16:58 · 217 阅读 · 0 评论 -
HDU 1495 非常可乐
非常可乐https://vjudge.net/problem/HDU-1495大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶...原创 2020-01-29 15:47:21 · 242 阅读 · 0 评论 -
POJ 3087 Shuffle'm Up
Shuffle’m Uphttps://vjudge.net/problem/POJ-3087A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker ch...原创 2020-01-29 10:52:56 · 240 阅读 · 0 评论 -
POJ 3126 Prime Path
Prime Pathhttps://vjudge.net/problem/POJ-3126The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room nu...原创 2020-01-28 21:37:09 · 569 阅读 · 0 评论 -
POJ 1426 Find The Multiple
Find The MultipleGiven 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 ...原创 2020-01-28 15:47:48 · 201 阅读 · 0 评论 -
POJ 3279 Fliptile
Fliptilehttps://vjudge.net/problem/POJ-3279Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they man...原创 2020-01-28 13:13:08 · 272 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That Cowhttps://vjudge.net/problem/POJ-3278Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a num...原创 2020-01-27 19:47:04 · 208 阅读 · 0 评论 -
POJ 2251 Dungeon Master
Dungeon MasterYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one un...原创 2020-01-27 17:36:59 · 235 阅读 · 0 评论 -
POJ 1321 棋盘问题
棋盘问题在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <=...原创 2020-01-27 10:17:32 · 277 阅读 · 0 评论