<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[BarisGuo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/BarisGuo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; BarisGuo]]></copyright><item><title><![CDATA[2020-11-06]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/109529615</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/109529615</guid><author>BarisGuo</author><pubDate>Fri, 06 Nov 2020 13:06:10 +0800</pubDate><description><![CDATA[MicroPython 于ESP32内的安装
一、	下载ESP32的烧录文件，地址：http://micropython.org/download/esp32/
二、	配置IDE（环境）

配置PyCraft
下载地址：http://bbs.eeworld.com.cn/thread-652153-1-1.html 或http://download3.dfrobot.com.cn/uPyCraft/
烧录教程：https://www.jianshu.com/p/a1eb27582e49
特点：纯英文界面，更]]></description><category></category></item><item><title><![CDATA[HDU ACM1085——Milk]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/89285628</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/89285628</guid><author>BarisGuo</author><pubDate>Sat, 13 Apr 2019 17:19:29 +0800</pubDate><description><![CDATA[Milk
Problem Description
Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know...]]></description><category></category></item><item><title><![CDATA[HDU ACM1008——Elevator]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/88929950</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/88929950</guid><author>BarisGuo</author><pubDate>Sun, 31 Mar 2019 15:49:04 +0800</pubDate><description><![CDATA[Elevator
Problem Description
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in sp...]]></description><category></category></item><item><title><![CDATA[HDU ACM1050——Moving Tables]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/86755078</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/86755078</guid><author>BarisGuo</author><pubDate>Sun, 03 Feb 2019 12:53:33 +0800</pubDate><description><![CDATA[Moving Tables
Problem Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.

The floor has 200 rooms each on the north s...]]></description><category></category></item><item><title><![CDATA[HDU ACM1241——Oil Deposits]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/86709581</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/86709581</guid><author>BarisGuo</author><pubDate>Thu, 31 Jan 2019 17:49:04 +0800</pubDate><description><![CDATA[Oil Deposits
Problem Description
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, a...]]></description><category></category></item><item><title><![CDATA[HDU ACM3746——Cyclic Nacklace]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/86666554</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/86666554</guid><author>BarisGuo</author><pubDate>Sun, 27 Jan 2019 15:36:46 +0800</pubDate><description><![CDATA[Cyclic Nacklace
Problem Description
CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too ...]]></description><category></category></item><item><title><![CDATA[HDU ACM1039——Easier Done Than Said?]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/84800473</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/84800473</guid><author>BarisGuo</author><pubDate>Tue, 04 Dec 2018 23:14:29 +0800</pubDate><description><![CDATA[Easier Done Than Said?
Problem Description
Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites ...]]></description><category></category></item><item><title><![CDATA[HDU ACM1035——Robot Motion]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/84729093</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/84729093</guid><author>BarisGuo</author><pubDate>Sun, 02 Dec 2018 22:38:18 +0800</pubDate><description><![CDATA[Robot Motion
Problem Description

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. The possible ins...]]></description><category></category></item><item><title><![CDATA[HDU ACM1034——Candy Sharing Game]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/84575469</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/84575469</guid><author>BarisGuo</author><pubDate>Tue, 27 Nov 2018 23:18:24 +0800</pubDate><description><![CDATA[Candy Sharing Game
Problem Description
A number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher blows a w...]]></description><category></category></item><item><title><![CDATA[HDU ACM1033——Edge]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/84202422</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/84202422</guid><author>BarisGuo</author><pubDate>Sun, 18 Nov 2018 17:27:25 +0800</pubDate><description><![CDATA[Edge
Problem Description
For products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size becomes small enough. We ass...]]></description><category></category></item><item><title><![CDATA[HDU ACM1031——Design T-Shirt]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/83761796</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/83761796</guid><author>BarisGuo</author><pubDate>Tue, 06 Nov 2018 12:02:43 +0800</pubDate><description><![CDATA[Design T-Shirt
Problem Description
Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the bo...]]></description><category></category></item><item><title><![CDATA[HDU ACM1052 —— Tian Ji -- The Horse Racing]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/83034438</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/83034438</guid><author>BarisGuo</author><pubDate>Sat, 13 Oct 2018 00:12:42 +0800</pubDate><description><![CDATA[Tian Ji – The Horse Racing
Problem Description
Here is a famous story in Chinese history.
“That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse ...]]></description><category></category></item><item><title><![CDATA[HDU ACM——整数解]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82932506</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82932506</guid><author>BarisGuo</author><pubDate>Wed, 03 Oct 2018 16:51:09 +0800</pubDate><description><![CDATA[整数解
Problem Description
有二个整数，它们加起来等于某个整数，乘起来又等于另一个整数，它们到底是真还是假，也就是这种整数到底存不存在，实在有点吃不准，你能快速回答吗？看来只能通过编程。
例如：
x + y = 9，x * y = 15 ? 找不到这样的整数x和y
1+4=5，14=4，所以，加起来等于5，乘起来等于4的二个整数为1和4
7+(-8)=-1，7（-8）=-56，...]]></description><category></category></item><item><title><![CDATA[HDU ACM2090——算菜价]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82932332</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82932332</guid><author>BarisGuo</author><pubDate>Wed, 03 Oct 2018 16:27:30 +0800</pubDate><description><![CDATA[算菜价
Problem Description
妈妈每天都要出去买菜，但是回来后，兜里的钱也懒得数一数，到底花了多少钱真是一笔糊涂帐。现在好了，作为好儿子（女儿）的你可以给她用程序算一下了，呵呵。
Input
输入含有一些数据组，每组数据包括菜种（字串），数量（计量单位不论，一律为double型数）和单价（double型数，表示人民币元数），因此，每组数据的菜价就是数量乘上单价啊。菜种、数量和单价...]]></description><category></category></item><item><title><![CDATA[HDU ACM1996——汉诺塔VI]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82915649</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82915649</guid><author>BarisGuo</author><pubDate>Mon, 01 Oct 2018 11:40:47 +0800</pubDate><description><![CDATA[汉诺塔VI
Problem Description
n个盘子的汉诺塔问题的最少移动次数是2n-1,即在移动过程中会产生2n个系列。由于
发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘放到小盘上，即各柱
子从下往上的大小仍保持如下关系 ：
n=m+p+q
a1&amp;gt;a2&amp;gt;…&amp;gt;am
b1&amp;gt;b2&amp;gt;…&amp;gt;bp
c1&amp;gt;c2&amp;gt;…&amp;gt;cq
计算所有会...]]></description><category></category></item><item><title><![CDATA[HDU ACM1995——汉诺塔V]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82830058</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82830058</guid><author>BarisGuo</author><pubDate>Mon, 24 Sep 2018 16:41:11 +0800</pubDate><description><![CDATA[汉诺塔V
Problem Description
用1,2,…,n表示n个盘子，称为1号盘，2号盘,…。号数大盘子就大。经典的汉诺塔问
题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于
印度传说的一个故事，上帝创造世界时作了三根金刚石柱子，在一根柱子上从下往上按大小
顺序摞着64片黄金圆盘。上帝命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱
子上。并且规定，...]]></description><category></category></item><item><title><![CDATA[杭电ACM1045——Fire Net]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82387509</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82387509</guid><author>BarisGuo</author><pubDate>Tue, 04 Sep 2018 17:40:25 +0800</pubDate><description><![CDATA[Fire Net



Problem Description

Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. 
...]]></description><category></category></item><item><title><![CDATA[HDU ACM2022——海选女主角]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82314592</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82314592</guid><author>BarisGuo</author><pubDate>Sun, 02 Sep 2018 12:56:29 +0800</pubDate><description><![CDATA[海选女主角



Problem Description

potato老师虽然很喜欢教书，但是迫于生活压力，不得不想办法在业余时间挣点外快以养家糊口。 
“做什么比较挣钱呢？筛沙子没力气，看大门又不够帅…”potato老师很是无奈。 
“张艺谋比你还难看，现在多有钱呀，听说还要导演奥运开幕式呢！你为什么不去娱乐圈发展呢？”lwg在一旁出主意。 
嗯，也是，为了生存，就委屈点到娱乐圈混混吧，马上就...]]></description><category></category></item><item><title><![CDATA[HDU ACM2016——数据的交换输出]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82313280</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82313280</guid><author>BarisGuo</author><pubDate>Sun, 02 Sep 2018 10:22:14 +0800</pubDate><description><![CDATA[数据的交换输出



Problem Description

输入n(n&amp;lt;100)个数，找出其中最小的数，将它与最前面的数交换后输出这些数。



Input

输入数据有多组，每组占一行，每行的开始是一个整数n，表示这个测试实例的数值的个数，跟着就是n个整数。n=0表示输入的结束，不做处理。



Output

对于每组输入数据，输出交换后的数列，每组输出占一行。



Sample ...]]></description><category></category></item><item><title><![CDATA[HDU ACM1248——寒冰王座]]></title><link>https://blog.youkuaiyun.com/BarisGuo/article/details/82288626</link><guid>https://blog.youkuaiyun.com/BarisGuo/article/details/82288626</guid><author>BarisGuo</author><pubDate>Sat, 01 Sep 2018 16:49:58 +0800</pubDate><description><![CDATA[寒冰王座



Problem Description

不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.

死亡骑士:”我要买道具!”

地精商人:”我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个.”

死亡骑士:”好的,给我一个血瓶.”

说完他掏出那张N元...]]></description><category></category></item></channel></rss>