YunYan

  博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

随笔分类 -  暑期集训

摘要:You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For e 阅读全文
posted @ 2019-07-25 23:32 Target--fly 阅读(134) 评论(0) 推荐(0)

摘要:一所学校不久前买了第一台电脑(所以这台电脑的ID是1)。近年来,学校购买了N-1新电脑。每台新电脑都连接到一台先前安装的电脑上。学校的管理人员担心网络运行缓慢,希望知道第i台计算机需要发送信号的最大距离si(即到最远计算机的电缆长度)。您需要提供此信息。 提示:示例输入与此图对应。从图中,你可以看到 阅读全文
posted @ 2019-07-25 21:22 Target--fly 阅读(234) 评论(0) 推荐(0)

摘要:My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F 阅读全文
posted @ 2019-07-25 18:51 Target--fly 阅读(161) 评论(0) 推荐(0)

摘要:Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, whic 阅读全文
posted @ 2019-07-25 16:46 Target--fly 阅读(214) 评论(0) 推荐(0)

摘要:Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. T 阅读全文
posted @ 2019-07-25 13:22 Target--fly 阅读(175) 评论(0) 推荐(0)

摘要:Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is 阅读全文
posted @ 2019-07-25 13:19 Target--fly 阅读(266) 评论(0) 推荐(0)

摘要:After hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marath 阅读全文
posted @ 2019-07-25 13:15 Target--fly 阅读(132) 评论(0) 推荐(0)

摘要:The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either fil 阅读全文
posted @ 2019-07-25 13:04 Target--fly 阅读(146) 评论(0) 推荐(0)

摘要:Now give you an string which only contains 0, 1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 ,9.You are asked to add the sign ‘+’ or ’-’ between the characters. Just like giv 阅读全文
posted @ 2019-07-25 09:07 Target--fly 阅读(166) 评论(0) 推荐(0)

摘要:小明做了一个很久很久的梦,醒来后他竟发现自己和朋友在一个摇摇欲坠的大棋盘上,他们必须得想尽一切办法逃离这里。经过长时间的打探,小明发现,自己所在的棋盘格子上有个机关,上面写着“你只有一次机会,出发后t秒大门会为你敞开”,而他自己所在的棋盘是大小为 N*M 的长方形,他可以向上下左右四个方向移动(不可 阅读全文
posted @ 2019-07-25 08:37 Target--fly 阅读(168) 评论(0) 推荐(0)

摘要:Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this: Each cell contains 阅读全文
posted @ 2019-07-25 08:15 Target--fly 阅读(195) 评论(0) 推荐(0)

摘要: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 c 阅读全文
posted @ 2019-07-24 23:43 Target--fly 阅读(145) 评论(0) 推荐(0)

摘要:[NWUACM] 你被困在一个三维的空间中,现在要寻找最短路径逃生!空间由立方体单位构成你每次向上下前后左右移动一个单位需要一分钟你不能对角线移动并且四周封闭是否存在逃出生天的可能性?如果存在,则需要多少时间? Input - 输入 输入第一行是一个数表示空间的数量。 每个空间的描述的第一行为L,R 阅读全文
posted @ 2019-07-24 23:39 Target--fly 阅读(190) 评论(0) 推荐(0)

摘要:A 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 eac 阅读全文
posted @ 2019-07-24 23:34 Target--fly 阅读(216) 评论(0) 推荐(0)

摘要:A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. 阅读全文
posted @ 2019-07-24 17:52 Target--fly 阅读(316) 评论(0) 推荐(0)

摘要:In this problem, you are given an integer number s. You can transform any integer number A to another integer number B by adding x to A. This x is an 阅读全文
posted @ 2019-07-23 23:29 Target--fly 阅读(151) 评论(0) 推荐(0)

摘要:农夫知道一头牛的位置,想要抓住它。农夫和牛都于数轴上 ,农夫起始位于点 N(0<=N<=100000) ,牛位于点 K(0<=K<=100000) 。农夫有两种移动方式: 1、从 X移动到 X-1或X+1 ,每次移动花费一分钟 2、从 X移动到 2*X ,每次移动花费一分钟 假设牛没有意识到农夫的行 阅读全文
posted @ 2019-07-23 22:02 Target--fly 阅读(295) 评论(0) 推荐(0)

摘要:Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are discussing is 阅读全文
posted @ 2019-07-23 21:55 Target--fly 阅读(178) 评论(0) 推荐(0)

摘要:思路 : 优先队列 每次都取最小的时间,遇到了终点直接就输出#include #include #include using namespace std; const int N=200; int n,m,sa,ea,sr,er; char arr[N][N]; int bb[N][N]={0}; struct stu{ int a,b; int time; ... 阅读全文
posted @ 2019-07-23 13:26 Target--fly 阅读(167) 评论(0) 推荐(0)

摘要:我们规定一个人是复读机当且仅当他说的每一句话都是复读前一个人说的话。 我们规定一个人是复读机当且仅当他说的每一句话都是复读前一个人说的话。 我们规定一个人是复读机当且仅当他说的每一句话都是复读前一个人说的话。 规定一个复读机的熟练度为复读数量的多少。现在给你一段聊天记录,请你找出其中的复读机们。 规 阅读全文
posted @ 2019-07-22 08:52 Target--fly 阅读(206) 评论(0) 推荐(0)