UVa OJ 11212 - Editing a Book
Problem
你有一篇由n(2≤n≤9)个自然段组成的文章,希望将它们排列成1, 2,…, n。可以用 Ctrl+X(剪切)和Ctrl+V(粘贴)快捷键来完成任务。每次可以剪切一段连续的自然段,粘贴时按照顺序粘贴。注意,剪贴板只有一个,所以不能连续剪切两次,只能剪切和粘贴交替。
例如,为了将{2,4,1,5,3,6}变为升序,可以剪切1将其放到2前,然后剪切3将其放到4 前。再如,对于排列{3,4,5,1,2},只需一次剪切和一次粘贴即可——将{3,4,5}放在{1,2}后, 或者将{1,2}放在{3,4,5}前。
Input
The input consists of at most 20 test cases. Each case begins with a line containing a single integer n (1 < n < 10), thenumber of paragraphs. The next line contains a permutation of 1, 2, 3, . . . , n. The last case is f ...
关于博客的二三事
自从博客搭建以来,已经陆续续地将页面更新几次了。总一开始的默认的landscape主题,到hueman,再到icarus,都有过尝试,最终还是选定了landscape作为主题。主要还是这个主题的自主性更大一些,而且有一个很大的banner,看起来比较舒服。
在调整各种颜色的时候,只是觉得黑色的比较舒服,没有那么刺眼,现在再看我的博客,居然和我在第二篇文章里提到的Morris’s Blog十分的相似(摊手)。
之前在各个板块,包括图标什么的,调整过很多次了,但是没有及时的记载下来,现在才想起来要有个记录什么的。不过话说回来,在知乎上看到别人更新的时候,都会用“某年某月某日”更新了XXX…早就也想着要这样试一次了,借此机会,也算满足我的一个小愿望吧
2016-08-04
1.更新了主页右上角图标
美化了GitHub的标志,同时增加了Facebook的图标,搜索栏也能使用Google搜索了。话说回来,我的Facebook基本没加什么好友哇,求勾搭(笑)。
![](http://7xread.com1.z0.glb.clouddn.com/64a8cdb8-f204-468c- ...
无所事事的闲暇时光
博客已经开起来了,后续还会继续地完善。
不过我本身水平有限,开这样一个博客,或许更多的,是一种的自娱自乐吧。能给大家带来一点帮助的话,自然是不胜荣幸的。
嘛,既然自己现在还处在一个入门的阶段,对编程的理解也是很浅显,那就还有很多的东西需要去学,需要去尝试。有时候会感觉,写代码不光是数学层面的计算,还融合了语言的表达能力在里面。
来一个突兀的中断吧。先暂时写这么多。
来自慵懒的博主
2016年8月4日
UVa OJ 1601 - The Morning after Halloween
Problem
You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in which guests walk through narrow and dark corridors. The house is proud of their lively ghosts, which are actually robots remotely controlled by the operator, hiding here and there in the corridors. One morning, you found that the ghosts are not in the positions where they are supposed to be. Ah, yesterday was Halloween. Believe or not, paranormal spirits have moved them around the corridors i ...
UVa OJ 10603 - Fill
Problem
There are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initially empty, while the third is completely filled with water. It is allowed to pour water from one jug into another until either the first one is empty or the second one is full. This operation can be performed zero, one or more times.
You are to write a program that computes the least total amount of water that needs to be poured; so tha ...
Hello World
Welcome to Yuuki_Dach’s Blog! :D
This is my very first post. I will upload some of my learning progress in this blog. If you are interested in my projects, you can also find them in My GitHub.