<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fry_guest的专栏]]></title><description><![CDATA[话多的人要吞一千根针]]></description><link>https://blog.youkuaiyun.com/Fry_guest</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fry_guest]]></copyright><item><title><![CDATA[Codeforces Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) 部分题解]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/52723401</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/52723401</guid><author>Fry_guest</author><pubDate>Sun, 02 Oct 2016 13:02:54 +0800</pubDate><description><![CDATA[昨晚打的CF，DIV1+2，一直都说混合场比较容易加分。
这场算是hack场了，全程看手速以及hack别人的能力了。当然顶尖的大牛们还是能AK顺便hack十几个人的。
尝试了一下在自己的电脑上用ubuntu做题，前面都还好啦，最后hack阶段的时候发现flash没有安装完善，还是切回到windows下继续的。







Codeforces 722A Broken Cloc]]></description><category></category></item><item><title><![CDATA[GVIM 配置 For ubuntu]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/52653227</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/52653227</guid><author>Fry_guest</author><pubDate>Sat, 24 Sep 2016 20:32:55 +0800</pubDate><description><![CDATA[最近用虚拟机安装了ubuntu
感觉相比起windows而言 linux的系统更适合写代码的样子




基础配置，和区域赛时候的配置相同。


set sw=4 ts=4 nobk ai cin nu
syn on
set mp=g++\ %\ -O2\ -s\ -o\ %
map  :w :make
map  :! ./%
colorscheme evening]]></description><category></category></item><item><title><![CDATA[Codeforces Round #368 (DIV 2)]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/52265648</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/52265648</guid><author>Fry_guest</author><pubDate>Sun, 21 Aug 2016 08:23:53 +0800</pubDate><description><![CDATA[昨晚的9点的CF，DIV2专场，为了rating change开了小号去。
说起来上一场也是DIV2专场开的小号去参加，然后第一个小号就上1900了，昨晚打完之后第二个小号也上DIV1了。蛮开心的。
最近这段时间在家里大概是参加不了12点半的CF了。毕竟补充睡眠。


部分题解：

Codeforces 707A Brain's Photos

题目链接：http://www.c]]></description><category></category></item><item><title><![CDATA[Codeforces 698B Fix a Tree 并查集]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/52023888</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/52023888</guid><author>Fry_guest</author><pubDate>Mon, 25 Jul 2016 15:16:39 +0800</pubDate><description><![CDATA[题目链接：http://www.codeforces.com/problemset/problem/698/B

题意：
    已知有向树的定义，除了根节点外每个节点都有且仅有一条边都指向它的父亲节点，而根节点有且仅有一条边指向自己。
    现在输入一张图，每个节点都有一条边指向某个点，要求修改尽量少的边，将这张图变成一颗树。


分析；
    最终形成的树中一定只有根节点指]]></description><category></category></item><item><title><![CDATA[Codeforces Round #359 (Div. 2) 部分题解]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/51755687</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/51755687</guid><author>Fry_guest</author><pubDate>Fri, 24 Jun 2016 21:45:42 +0800</pubDate><description><![CDATA[之前两场连续的崩盘让分数又回到了DIV2底层，挺难过的。
昨晚发挥的还不错，继续加油吧。



Codeforces 686A Free Ice Cream

题目链接：http://www.codeforces.com/problemset/problem/686/A
题意：N个人在排队，一开始店主有M个冰淇凌，队伍中第i个人可能是一个送冰激凌的工人，他会带给店主A[i]个冰淇凌]]></description><category></category></item><item><title><![CDATA[Gvim配置]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/51502585</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/51502585</guid><author>Fry_guest</author><pubDate>Wed, 25 May 2016 22:19:56 +0800</pubDate><description><![CDATA[set sw=4 ts=4 nobk ai cin nu
syn on
set mp=g++\ %\ -O2\ -s\ -o\ %<
map  :w :make
map  :!%
colo evening
set guifont=黑体:h14:b:cGB2312
set backspace=indent,eol,start
:cd D:\Fry\PresentSolve

inoremap  :c]]></description><category></category></item><item><title><![CDATA[关于N维的切割问题]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/51176991</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/51176991</guid><author>Fry_guest</author><pubDate>Mon, 18 Apr 2016 08:26:33 +0800</pubDate><description><![CDATA[如果是二维的切割问题，一般答案是 a*n^2+bn+c
三维的切割问题，一般答案是a*n^3+bn^2+cn+d
然后用待定系数法求解就可以了。]]></description><category></category></item><item><title><![CDATA[2016.4.17 南京理工大学校赛]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/51174779</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/51174779</guid><author>Fry_guest</author><pubDate>Sun, 17 Apr 2016 20:01:26 +0800</pubDate><description><![CDATA[题目传送门： https://icpc.njust.edu.cn/Contest/749/



A偷吃糖果 

题意：给你两个字符串，将其中的连续的相同的字符串都缩成一个，问操作完毕后这两个字符串是否相等。
分析：简单题，暴力上吧。
#include 
using namespace std;
const int N=1005;
char s1[N],s2[N];
char an]]></description><category></category></item><item><title><![CDATA[Codeforces Round #334 (Div. 1)]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/50154195</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/50154195</guid><author>Fry_guest</author><pubDate>Wed, 02 Dec 2015 23:47:29 +0800</pubDate><description><![CDATA[自从CF的rating改版以后终于回到DIV1了。打了一场还比预期好，如果C题不错的话应该可以继续上分，可惜了。



Codeforces 603A. Alternative Thinking
题目链接：http://codeforces.com/problemset/problem/603/A
题意：给你一个01串，要你选择其中一个非空的01子串，将其反转（0变成1，1变成0），要]]></description><category></category></item><item><title><![CDATA[Codeforces Round #333 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/50040753</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/50040753</guid><author>Fry_guest</author><pubDate>Wed, 25 Nov 2015 18:25:30 +0800</pubDate><description><![CDATA[应该是学ACM以来打的最好的一场了.

CF的rating改版以来第一次上DIV1.加油.


Codeforces 602A Two Bases

题目链接:http://codeforces.com/problemset/problem/602/A
题意:给你两个进制不同的数字,要求比较大小.
分析:直接把两个数用十进制求出来就好了.需要注意的是不要使用pow函数,pow的返]]></description><category></category></item><item><title><![CDATA[Codeforces 596D 区间DP]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/49915653</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/49915653</guid><author>Fry_guest</author><pubDate>Thu, 19 Nov 2015 00:12:35 +0800</pubDate><description><![CDATA[题目链接:
题意:
  有n棵树排成一排,高度都为h.
  主人公要去砍树,每次等概率地随机选择没倒的树中最左边的树或者最右边的树把它砍倒.每棵树被砍到后,有p的概率会往左边倒,(1-p)的概率往右边倒.
  树倒下后如果压到别的树,即如果那棵树倒下的方向上距离不到h的地方还有一棵树,,那么那棵树也会朝和这个树相同的方向倒下.
  问最后所有的树都被砍完后覆盖的地面的长度的期望.]]></description><category></category></item><item><title><![CDATA[Codeforces Round #331 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/49871145</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/49871145</guid><author>Fry_guest</author><pubDate>Mon, 16 Nov 2015 20:42:18 +0800</pubDate><description><![CDATA[昨晚比的CF,结束的时候RANK差不多100左右,本来想着可以上DIV1了的,今天早上起来一看还掉了10分,A题跪了,无颜面对江东父老.
还是思维不够缜密以及..实力不够.
继续加油,


Codeforces 596A
题目链接: http://codeforces.com/problemset/problem/596/A

题意:已知一个长宽都平行于坐标系的矩形,它的一些顶点被]]></description><category></category></item><item><title><![CDATA[拓扑排序简单思路O（n^2）附HDU 5154 Harry and Magical Computer]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/49849747</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/49849747</guid><author>Fry_guest</author><pubDate>Sun, 15 Nov 2015 16:03:06 +0800</pubDate><description><![CDATA[拓扑排序简单思路
首先读入整个图，扫描所有的点，找到一个入度为0的点，这就是一个可以放在拓扑序列首部的点，然后这个点的所有的直接的后继的入度-1.
反复操作直到所有的点都进入了拓扑序列。
附HDU 5154AC 代码

#include 
using namespace std;
int a[105][105];
int num[105];
int main()
{
	int n,m;
]]></description><category></category></item><item><title><![CDATA[博弈-Green Hackenbush(无向图删边)]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/47722855</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/47722855</guid><author>Fry_guest</author><pubDate>Mon, 17 Aug 2015 11:32:17 +0800</pubDate><description><![CDATA[转自:http://blog.sina.com.cn/s/blog_8f06da990101252l.html

Green Hackenbush

     Hackenbush游戏是通过移除一个有根图的某些边，直到没有与地板的相连的边。地板用虚线来表示，其中移除某一条边的时候，那条边以上所连着的所有边都会移除，就像砍树枝那样，树枝以上的部分也会被移除。

     在这节中，我们讨]]></description><category></category></item><item><title><![CDATA[2015  Multi-University Training 3 多校集训 第三场 部分题解及反思]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/47123905</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/47123905</guid><author>Fry_guest</author><pubDate>Wed, 29 Jul 2015 11:10:24 +0800</pubDate><description><![CDATA[昨天打完的第三场，相对而言发挥的还算正常，毕竟弱渣一只，不过有几道简单题都没看，如果放弃那道1010的DP的话还是可以多做两题的，DP依旧是硬伤。
最后做了5道题，勉强挤进第二页。如果能把速度提上去的话应该可以进第一页的。。DP题卡了2个小时不多说。不过赛后看官方题解说DFS就可以了，感觉有点崩溃。




部分题解：

HDU 5316 Magician
题意：
给你一个长度]]></description><category></category></item><item><title><![CDATA[HDU 1079 Calendar Game]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/47057097</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/47057097</guid><author>Fry_guest</author><pubDate>Sat, 25 Jul 2015 15:57:58 +0800</pubDate><description><![CDATA[题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1079




Problem Description

Adam and Eve enter this year’s ACM International Collegiate Programming Contest. Last night, they played the Calend]]></description><category></category></item><item><title><![CDATA[Codeforces Round #261 (Div. 2) D. Pashmak and Parmida's problem]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/47056163</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/47056163</guid><author>Fry_guest</author><pubDate>Sat, 25 Jul 2015 14:26:17 +0800</pubDate><description><![CDATA[题目传送门：http://codeforces.com/contest/459/problem/D




D. Pashmak and Parmida's problem


time limit per test
3 seconds


memory limit per test
256 megabytes


input
standard input]]></description><category></category></item><item><title><![CDATA[Codeforces Round #260 (Div. 2) E. Civilization]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/47054509</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/47054509</guid><author>Fry_guest</author><pubDate>Sat, 25 Jul 2015 11:19:27 +0800</pubDate><description><![CDATA[题目传送门：点击打开链接



Andrew plays a game called "Civilization". Dima helps him.

The game has n cities
 and m bidirectional roads. The cities are numbered from 1 to n.
 Between any pair of cities t]]></description><category></category></item><item><title><![CDATA[UVA 7146 Defeat The Enemy      2014 ACM-ICPC Asia shanghai Regional Contest]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/46914957</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/46914957</guid><author>Fry_guest</author><pubDate>Thu, 16 Jul 2015 17:22:51 +0800</pubDate><description><![CDATA[7146 Defeat The Enemy
Long long ago there is a strong tribe living on the earth. They always have wars and eonquer others. One day, there is another tribe become their target. The strong tribe has de]]></description><category></category></item><item><title><![CDATA[UVA 6859 Points]]></title><link>https://blog.youkuaiyun.com/Fry_guest/article/details/46883331</link><guid>https://blog.youkuaiyun.com/Fry_guest/article/details/46883331</guid><author>Fry_guest</author><pubDate>Tue, 14 Jul 2015 20:49:08 +0800</pubDate><description><![CDATA[Peter and Bob are playing a “Points” game on a math sheet of paper. Peter places a few points on the paper — grid nodes. Bob wants to surround them with a polygon so that all marked nodes are lying st]]></description><category></category></item></channel></rss>