<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[duanxian0621的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/duanxian0621</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; duanxian0621]]></copyright><item><title><![CDATA[2012 ACM-ICPC Asia Changchun Regional Contest - K：Yukari's Birthday]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8087267</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8087267</guid><author>duanxian0621</author><pubDate>Thu, 18 Oct 2012 20:38:01 +0800</pubDate><description><![CDATA[Today is Yukari's n-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday cake! But it's a big challenge for them to place
n candles on the top of th]]></description><category></category></item><item><title><![CDATA[2011 Asia Beijing Regional  B:Hou Yi's secret]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8087247</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8087247</guid><author>duanxian0621</author><pubDate>Thu, 18 Oct 2012 20:16:55 +0800</pubDate><description><![CDATA[Long long ago, in the time of Chinese emperor Yao, ten suns rose into the sky. They burned the crops and scorched the bushes and trees, leaving the people with nothing to eat.


Hou Yi was the grea]]></description><category></category></item><item><title><![CDATA[HDU 2440、HDU 3694多边形费马点]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8065068</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8065068</guid><author>duanxian0621</author><pubDate>Fri, 12 Oct 2012 16:24:56 +0800</pubDate><description><![CDATA[费马点是指求到N个点距离和最小的点。通常要求的是简单多边形的费马点。
1、http://acm.hdu.edu.cn/showproblem.php?pid=2440   按照题意知道是一个简单的多边形即凸包，但给出的点并没有按照顺序的，所以需要自己先求出凸包，然后在用随机淬火求费马点。
#include
#include
#include
#include
#include
#include]]></description><category></category></item><item><title><![CDATA[ZOJ 3645 ：BiliBili _高斯消元]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8062118</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8062118</guid><author>duanxian0621</author><pubDate>Thu, 11 Oct 2012 19:50:26 +0800</pubDate><description><![CDATA[Shirai Kuroko is a Senior One student. Almost everyone in Academy City have super powers, and
Kuroko is good at using it. Her ability is "Teleporting", which can make people to transfer in the eleven]]></description><category></category></item><item><title><![CDATA[旋转卡壳解决一类问题（程序）——未完待续]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8058074</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8058074</guid><author>duanxian0621</author><pubDate>Wed, 10 Oct 2012 21:23:10 +0800</pubDate><description><![CDATA[1、旋转卡壳求凸多边形直径（即求平面点集最远点对）
http://poj.org/problem?id=2187   本题数据较水，可以直接暴力

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace]]></description><category></category></item><item><title><![CDATA[旋转卡壳解决一类问题（资料）]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8058009</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8058009</guid><author>duanxian0621</author><pubDate>Wed, 10 Oct 2012 21:10:17 +0800</pubDate><description><![CDATA[以下所有文章均转载（ http://blog.youkuaiyun.com/acmaker/article/details/3176910） 转载请注明出处！

1、旋转卡壳——翻译说明文档 

 前一段时间看了一位国外大牛的网站，是关于旋转卡壳技术的，内容很不错，就尝试着翻译一下。
     关于旋转卡壳技术，最早是在刘汝佳、黄亮的《算法艺术与信息学竞赛》上看到的，是计算几何相关的技术，开始觉得很]]></description><category></category></item><item><title><![CDATA[一类凸包题目（未完）]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/8049684</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/8049684</guid><author>duanxian0621</author><pubDate>Mon, 08 Oct 2012 20:17:27 +0800</pubDate><description><![CDATA[注：《黑书》P392中有讲：对于通常求的凸包，输出的凸包是包括所有可能的共线点还是不包括任何共线点（即只有极点）这是取决于题目的题目要求的。在下面的程序中都会将去共线点的代码加上，视题目删除。


1、http://poj.org/problem?id=1113   简单凸包，求凸包的周长和圆周
Graham-Scan 算法

#include
#include
#include
#i]]></description><category></category></item><item><title><![CDATA[HDU 4291:A Short problem_成都赛区网络赛—矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7988996</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7988996</guid><author>duanxian0621</author><pubDate>Mon, 17 Sep 2012 19:54:40 +0800</pubDate><description><![CDATA[Problem Description

　　According to a research, VIM users tend to have shorter fingers, compared with Emacs users.
　　Hence they prefer problems short, too. Here is a short one:
　　Given n (1 18), Y]]></description><category></category></item><item><title><![CDATA[2012 Multi-University Training Contest 9__Farmer Greedy和Quadrilateral]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7897227</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7897227</guid><author>duanxian0621</author><pubDate>Wed, 22 Aug 2012 20:43:23 +0800</pubDate><description><![CDATA[Problem Description

　　Farmer Greedy is going to buy some houses for his farm. He has money only to buy three houses. The three houses can from a triangle area, which he can own as his farm.
　　Ther]]></description><category></category></item><item><title><![CDATA[POJ 2398：Toy Storage _叉积性质]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7887827</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7887827</guid><author>duanxian0621</author><pubDate>Mon, 20 Aug 2012 19:20:09 +0800</pubDate><description><![CDATA[Description
Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is]]></description><category></category></item><item><title><![CDATA[UVA - 10650 ：Determinate Prime]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7873262</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7873262</guid><author>duanxian0621</author><pubDate>Thu, 16 Aug 2012 14:58:46 +0800</pubDate><description><![CDATA[Description


 
Determinate Prime
Input: standard input
Output: standard output
Time Limit: 1 second
 
If three or more consecutive primes are uni-distance they are called Determinate Primes.]]></description><category></category></item><item><title><![CDATA[2012 Multi-University Training Contest 7：Palindrome graph]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7870663</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7870663</guid><author>duanxian0621</author><pubDate>Wed, 15 Aug 2012 20:31:58 +0800</pubDate><description><![CDATA[Problem Description

In addition fond of programing, Jack also loves painting. He likes to draw many interesting graphics on the paper.
One day,Jack found a new interesting graph called Palindrome]]></description><category></category></item><item><title><![CDATA[UESTC 1721：吴神,人类的希望_n个相同的球放进m个相同的盒子的问题]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7864791</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7864791</guid><author>duanxian0621</author><pubDate>Tue, 14 Aug 2012 14:30:22 +0800</pubDate><description><![CDATA[Description
公元18906416年，由于歌者无节制的使用二向箔，整个宇宙都将不可避免的跌入二次元。为了拯救学弟们，吴神决定使用一种叫smxrwzdx的基本粒子创造一个新的宇宙，吴神发现，用不同数量的smxrwzdx可以组合成不同的粒子，比如用两个smxrwzdx就可以组成一个魔理沙，三个smxrwzdx就可以组成一个洛天依，总之，无论怎样组合，都会产生一个好的结果（不要吐槽，吴神就是]]></description><category></category></item><item><title><![CDATA[2012 Multi-University Training Contest 3：Triangle LOVE_判断有向图中是否含有仅由三个点组成的环]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7861664</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7861664</guid><author>duanxian0621</author><pubDate>Mon, 13 Aug 2012 20:10:04 +0800</pubDate><description><![CDATA[ains a single integer t (1 
For each case, the first line contains one integer N (0 
In the next N lines contain the adjacency matrix A of the relationship (without spaces). Ai,j = 1 means i-th peop]]></description><category></category></item><item><title><![CDATA[2012 Multi-University Training Contest 3：Arcane Numbers 1]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7861509</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7861509</guid><author>duanxian0621</author><pubDate>Mon, 13 Aug 2012 19:43:42 +0800</pubDate><description><![CDATA[Problem Description

Vance and Shackler like playing games. One day, they are playing a game called "arcane numbers". The game is pretty simple, Vance writes down a finite decimal under base A, and]]></description><category></category></item><item><title><![CDATA[SPOJ—Paying in Byteland]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7853188</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7853188</guid><author>duanxian0621</author><pubDate>Fri, 10 Aug 2012 21:48:38 +0800</pubDate><description><![CDATA[Description

There are infinitely many coin denominations in the Byteland. They have values of 2^i for i=0,1,2,... . We will say that set of coins c1,c2,...,ck is perfect when it is possible to pay]]></description><category></category></item><item><title><![CDATA[SPOJ Equation :求 1/n!=1/x+1/y 的解的个数]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7853018</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7853018</guid><author>duanxian0621</author><pubDate>Fri, 10 Aug 2012 20:14:21 +0800</pubDate><description><![CDATA[Description

You are given integer positive number N. Find the number of solutions in positive integer numbers of the following equation:


1/N! = 1/X + 1/Y



Input

Each line of input fil]]></description><category></category></item><item><title><![CDATA[SPOJ Primitive Root  ：判断一个数模p的阶是否是p-1]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7850461</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7850461</guid><author>duanxian0621</author><pubDate>Fri, 10 Aug 2012 10:39:46 +0800</pubDate><description><![CDATA[Description



In the field of Cryptography, prime numbers play an important role. We are interested in a scheme called "Diffie
-Hellman" key exchange which allows two communicating parties to ex]]></description><category></category></item><item><title><![CDATA[SPOJ ：Use of Function Arctan]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7848218</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7848218</guid><author>duanxian0621</author><pubDate>Thu, 09 Aug 2012 16:44:11 +0800</pubDate><description><![CDATA[Description

It's easy to know that arctan(1/2)+arctan(1/3)=arctan(1).The problem is,to some fixed number A,you have to write a 
program to calculate the minimum sum B+C.A,B and C are all positive]]></description><category></category></item><item><title><![CDATA[FZU 1969 GCD Extreme，UESTC 1723 吴神的大脑： _数论好题(求1-n中所有数的最大公约数之和)]]></title><link>https://blog.youkuaiyun.com/duanxian0621/article/details/7847514</link><guid>https://blog.youkuaiyun.com/duanxian0621/article/details/7847514</guid><author>duanxian0621</author><pubDate>Thu, 09 Aug 2012 15:20:23 +0800</pubDate><description><![CDATA[Problem Description

Given the value of N, you will have to find the value of G. The meaning of G is given in the following code

G=0; 
for(i=1;i
    for(j=i+1;j


        G+=gcd(i,j);]]></description><category></category></item></channel></rss>