练习题
sky~
实习ing
展开
-
A strange lift (深搜加剪枝)
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button "UP" , you will go up Ki floor,i..原创 2020-09-28 14:01:58 · 138 阅读 · 0 评论 -
Jill‘s Tour Paths(C语言)
Every year, Jill takes a bicycle tour between two villages. There are different routes she can take between these villages, but she does have an upper limit on the distance that she wants to travel. Given a map of the region indicating the cities and the r原创 2021-01-13 21:48:10 · 443 阅读 · 0 评论 -
Lake Counting(POJ - 2386)
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would li原创 2020-08-27 16:18:18 · 145 阅读 · 0 评论 -
胜利大逃亡 (深搜加剪枝)
Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个.现在给你城堡的地图,请你计算出Ignatius能否在魔王回来前离开城堡(只要走到出口就算离开城堡,如果走到出口的时候魔王刚好回来也算逃亡成功).原创 2020-09-28 13:49:37 · 126 阅读 · 0 评论 -
Oil Deposits(POJ:1562)
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each原创 2020-09-21 22:06:06 · 170 阅读 · 0 评论 -
生日蛋糕 C语言
题目:7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时,要求Ri > Ri+1且Hi > Hi+1。由于要在蛋糕上抹奶油,为尽可能节约经费,我们希望蛋糕外表面(最下一层的下底面除外)的面积Q最小。令Q = Sπ请编程对给出的N和M,找出蛋糕的制作方案(适当的Ri和Hi的值),使S最小。(除Q外,以上所有数据皆为正整数)原创 2020-07-08 18:50:41 · 19848 阅读 · 6 评论 -
Catch That Cow (宽搜,模拟队列,c语言)
Farmer 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 number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes .原创 2020-09-29 18:56:21 · 187 阅读 · 0 评论 -
Red and Black(POJ:1979)
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.W原创 2020-09-10 15:39:17 · 126 阅读 · 0 评论 -
部分和问题
描述给定整数a1、a2、…an,判断是否可以从中选出若干数,使它们的和恰好为K。输入 首先,n和k,n表示数的个数,k表示数的和。 接着一行n个数。 (1<=n<=20,保证不超int范围)输出 如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入 4 13 1 2 4 7样例输出 YES本题就是利用深搜法从最第一个数开始判断后面的数加或不加,直到满足几个数相加等于K时结束。原创 2020-08-24 16:37:27 · 486 阅读 · 0 评论 -
Prime Ring Problem
A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first circle should always be 1.Inputn (0 < n <.原创 2020-09-23 22:50:15 · 102 阅读 · 0 评论 -
Pushing Boxes(队列,广搜)
Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. These moves are called walks.One of the empty cells contains a box which原创 2021-01-17 20:26:14 · 404 阅读 · 0 评论 -
回家 Bessie Come Home(C语言)
题目描述现在是晚餐时间,而母牛们在外面分散的牧场中。Farmer John 按响了电铃,所以她们开始向谷仓走去。 你的工作是要指出哪只母牛会最先到达谷仓(在给出的测试数据中,总会有且只有一只最快的母牛)。在挤奶的时候(晚餐前),每只母牛都在她自己的牧场上,一些牧场上可能没有母牛。每个牧场由一条条道路和一个或多个牧场连接(可能包括自己)。有时,两个牧场(可能是字母相同的)之间会有超过一条道路相连。至少有一个牧场和谷仓之间有道路连接。因此,所有的母牛最后都能到达谷仓,并且母牛总是走最短的路径。当然,母牛能原创 2020-11-29 18:38:03 · 331 阅读 · 0 评论 -
Jungle Roads C语言
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain...原创 2020-07-18 00:43:02 · 230 阅读 · 0 评论 -
最小生成树一·Prim算法
描述最近,小Hi很喜欢玩的一款游戏模拟城市开放出了新Mod,在这个Mod中,玩家可以拥有不止一个城市了!但是,问题也接踵而来——小Hi现在手上拥有N座城市,且已知这N座城市中任意两座城市之间建造道路所需要的费用,小Hi希望知道,最少花费多少就可以使得任意两座城市都可以通过所建造的道路互相到达(假设有A、B、C三座城市,只需要在AB之间和BC之间建造道路,那么AC之间也是可以通过这两条道路连通的)。提示:不知道为什么Prim算法和Dijstra算法很像呢Σ(っ °Д °;)っ 。提示:不知道为什么Pr原创 2020-10-12 18:05:00 · 158 阅读 · 0 评论 -
Arctic Network(最小生成树)
The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts w原创 2020-10-12 18:25:48 · 521 阅读 · 0 评论 -
Constructing Roads(最小生成树)(C语言)
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a villag原创 2020-10-12 18:12:59 · 549 阅读 · 0 评论 -
最小生成树二·Kruscal算法
随着小Hi拥有城市数目的增加,在之间所使用的Prim算法已经无法继续使用了——但是幸运的是,经过计算机的分析,小Hi已经筛选出了一些比较适合建造道路的路线,这个数量并没有特别的大。所以问题变成了——小Hi现在手上拥有N座城市,且已知其中一些城市间建造道路的费用,小Hi希望知道,最少花费多少就可以使得任意两座城市都可以通过所建造的道路互相到达(假设有A、B、C三座城市,只需要在AB之间和BC之间建造道路,那么AC之间也是可以通过这两条道路连通的)。提示:积累的好处在于可以可以随时从自己的知识库中提取想要的原创 2020-10-12 18:08:27 · 153 阅读 · 0 评论 -
畅通工程续(最短路)
某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。 Input本题目包含多组数据,请处理到文件结束。每组数据第一行包含两个正整数N和M(0<N<200,0<M<1000),分别代表现有城镇的数目和已修建的道路的数目。城镇分别以0~N-1编号。接下来是M行道路.原创 2020-10-04 13:38:31 · 169 阅读 · 0 评论 -
MPI Maelstrom(dijkstra算法)c语言
BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advisor, Jack Swigert, has asked her to benchmark the new sy原创 2020-10-05 17:09:30 · 370 阅读 · 0 评论 -
Highways C语言
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning to build some highways so that it will be possible原创 2020-07-13 19:57:47 · 245 阅读 · 0 评论 -
The Unique MST(判断最小生成树是否唯一)C语言
Given a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following properties:1.原创 2020-07-21 18:31:57 · 607 阅读 · 0 评论 -
Heavy Transportation(最短路的变形 Dijkstra算法)
BackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where原创 2020-10-05 16:44:01 · 467 阅读 · 0 评论 -
Persistent Numbers
The multiplicative persistence of a number is defined by Neil Sloane (Neil J.A. Sloane in The Persistence of a Number published in Journal of Recreational Mathematics 6, 1973, pp. 97-98., 1973) as the number of steps to reach a one-digit number when repeat原创 2021-01-22 19:12:00 · 186 阅读 · 1 评论 -
翻纸牌游戏
有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,纸牌有正反两面,开始的纸牌可能是一种乱的状态(有些朝正,有些朝反),现在你需要整理这些纸牌。但是麻烦的是,每当你翻一张纸牌(由正翻到反,或者有反翻到正)时,他左右两张纸牌(最左边和最右边的纸牌,只会影响附近一张)也必须跟着翻动,现在给你一个乱的状态,问你能否把他们整理好,使得每张纸牌都正面朝上,如果可以,最少需要多少次操作。Input有多个case,每个case输入一行01符号串(长度不超过20),1表示反面朝上,0表示正面朝上。Output对于每组原创 2021-05-15 16:09:10 · 1540 阅读 · 3 评论 -
Lovekey
XYZ-26进制数是一个每位都是大写字母的数字。 A、B、C、…、X、Y、Z 分别依次代表一个0 ~ 25 的数字,一个 n 位的26进制数转化成是10进制的规则如下A0A1A2A3…An-1 的每一位代表的数字为a0a1a2a3…an-1 ,则该XYZ-26进制数的10进制值就为m = a0 * 26^(n-1) + a1 * 26^(n-2) + … + an-3* 26^2 + an-2*26 + an-1一天vivi忽然玩起了浪漫,要躲在学校的一个教室,让枫冰叶子去找,当然,她也知道枫冰.原创 2021-01-19 20:42:38 · 899 阅读 · 0 评论 -
排列2(HDU1716)
Ray又对数字的列产生了兴趣:现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。Input每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数,千位数字相同的在同一行,同一行中每个四位数间用空格分隔。每组输出数据间空一行,最后一组数据后面没有空行。Sample Input1 2 3 41 1 2 30 1 2 30 0 0 .原创 2021-01-19 11:09:28 · 161 阅读 · 0 评论 -
火星A+B(C语言)
读入两个不超过25位的火星正整数A和B,计算A+B。需要注意的是:在火星上,整数不是单一进制的,第n位的进制就是第n个素数。例如:地球上的10进制数2,在火星上记为“1,0”,因为火星个位数是2进制的;地球上的10进制数38,在火星上记为“1,1,1,0”,因为火星个位数是2进制的,十位数是3进制的,百位数是5进制的,千位数是7进制的……Input测试输入包含若干测试用例,每个测试用例占一行,包含两个火星正整数A和B,火星整数的相邻两位数用逗号分隔,A和B之间有一个空格间隔。当A或B为0时输入结束,相应的原创 2021-01-12 21:33:00 · 358 阅读 · 0 评论 -
数1(C语言)
题目描述给一个整数n,数出该数本身1的个数和转化成二进制后1的个数。输入输入一个整数n,n=-1结束;输出所有1的个数sum;样例输入118-1样例输出51#include<stdio.h>#include<string.h>int main(){ char str[100];//为了防止大数, 以字符串的形式输入 int num[1000], num2[1000]; //一个数组存放输入的十进制数, 另一个存放二进制数 while (scanf原创 2020-11-05 20:02:32 · 455 阅读 · 0 评论 -
Exponentiation(C语言)
Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.This problem requires that you write a program to comp原创 2020-11-04 13:45:10 · 312 阅读 · 0 评论 -
Bull Math(C语言)
Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are correct. Help him check the bulls' answers. Read in two positive integer原创 2020-11-01 12:20:08 · 283 阅读 · 0 评论 -
循环数(C语言)
题目描述循环数是那些不包括0这个数字的没有重复数字的整数 (比如说, 81362) 并且同时具有一个有趣的性质, 就像这个例子:bullet 如果你从最左边的数字开始 ( 在这个例子中是8) 数最左边这个数字个数字到右边(回到最左边如果数到了最右边),你会停止在另一个新的数字(如果没有停在一个不同的数字上,这个数就不是循环数). 就像: 8 1 3 6 2 从最左边接下去数8个数字: 1 3 6 2 8 1 3 6 所以下一个数字是6.重复这样做 (这次从“6”开始数6个数字) 并且你会停止在一个新原创 2020-10-27 11:09:53 · 4386 阅读 · 0 评论