<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coder_coder_coder的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coder_coder_coder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coder_coder_coder]]></copyright><item><title><![CDATA[学习rfc 7432 多归场景]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/88754480</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/88754480</guid><author>coder_coder_coder</author><pubDate>Sat, 23 Mar 2019 00:37:04 +0800</pubDate><description><![CDATA[8. Multihoming Functions

This section discusses the functions, procedures, and associated BGP

routes used to support multihoming in EVPN. This covers both

multihomed device (MHD) and multihomed net...]]></description><category></category></item><item><title><![CDATA[hdu4544湫湫系列故事——消灭兔子 priority queue]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39508879</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39508879</guid><author>coder_coder_coder</author><pubDate>Wed, 24 Sep 2014 00:19:18 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
const int N=100009;
struct node{
    int d,p;
    friend bool operator <(const node &a,const node &b){
        return a.p>b.p;//小顶堆
    }
}]]></description><category></category></item><item><title><![CDATA[hrbust1176小陈老师、雪人 map&&priority queue]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39485451</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39485451</guid><author>coder_coder_coder</author><pubDate>Tue, 23 Sep 2014 00:28:15 +0800</pubDate><description><![CDATA[//利用map的去重性存储，很好；再用优先队列排序
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int N=100009;
map m;
struct node{
    int r,n;
    friend bool operator 重载了也没用
        return a.n]]></description><category></category></item><item><title><![CDATA[poj1017 packets]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39383659</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39383659</guid><author>coder_coder_coder</author><pubDate>Fri, 19 Sep 2014 00:34:50 +0800</pubDate><description><![CDATA[真是经典的数学思维,还有就是向上取整的]]></description><category></category></item><item><title><![CDATA[poj1230 Pass-Muraille (Greedy)]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39358671</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39358671</guid><author>coder_coder_coder</author><pubDate>Thu, 18 Sep 2014 00:49:26 +0800</pubDate><description><![CDATA[#include
#include 
#include 
#include 
//和上一题蛮像的,要先排序再搞,还有就是删区间的时候找最能靠右的删
using namespace std;
const int N=110;
struct node{
    int x1,y1,x2,y2;
}p[N];
bool cmp(node a,node b){
    return a.x1<b.x1;
]]></description><category></category></item><item><title><![CDATA[POJ1328 radar installation (Greedy)]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39328953</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39328953</guid><author>coder_coder_coder</author><pubDate>Wed, 17 Sep 2014 00:54:18 +0800</pubDate><description><![CDATA[//主要是以岛为圆心画圆求区间,还有就是区间交并的问题

#include 
#include 
#include 
#include 
#include 
using namespace std;
int n,d,cas;
struct node{
    double x,y;
    double l,r;
}p[1009];
bool cmp(node a,node b){
    //i]]></description><category></category></item><item><title><![CDATA[sgu114	 Telecasting station 三分]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39324647</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39324647</guid><author>coder_coder_coder</author><pubDate>Tue, 16 Sep 2014 22:21:32 +0800</pubDate><description><![CDATA[//sb啦,忘记可以有多种答案
#include 
#include 
#include 
#include 
using namespace std;
const double eps=1e-6;
const int N=15009;
struct node{
    double x,p;
}p[N];
int n;
double mi=50000,mx;
double cal(double ]]></description><category></category></item><item><title><![CDATA[ural1753Bookshelf 三分]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39298159</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39298159</guid><author>coder_coder_coder</author><pubDate>Mon, 15 Sep 2014 20:50:11 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
const double eps=1e-6;
double h,H,L;
double cal(double x){//已左底角为原点,向右为x轴,书的中心为书的H/2处
    return H*x/(2*sqrt(x*x+h*h))-x;
}
int main(){
    scanf("%l]]></description><category></category></item><item><title><![CDATA[hdu2438Turn the corner 三分]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39237787</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39237787</guid><author>coder_coder_coder</author><pubDate>Fri, 12 Sep 2014 23:50:36 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
const double pi=acos(-1.0);
double x,y,l,w,s;
double cal(double k){//函数的求法是个问题,变量是角度
    s=l*cos(k)+w*sin(k)-x;
    return s*tan(k)+w*cos(k]]></description><category></category></item><item><title><![CDATA[zoj 3203 Light Bulb 三分入门]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39185745</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39185745</guid><author>coder_coder_coder</author><pubDate>Wed, 10 Sep 2014 20:12:38 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
const double eps=1e-6;
double H,h,D;
double len(double x){
    return x+(x*H-D*h)/(x-D);
}
double tripartion(){
    double low=0,high=D*h/H;//x可取的最小最]]></description><category></category></item><item><title><![CDATA[生物钟揭秘]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39155589</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39155589</guid><author>coder_coder_coder</author><pubDate>Tue, 09 Sep 2014 14:14:29 +0800</pubDate><description><![CDATA[原文:http://blog.youkuaiyun.com/xiexievv/article/details/6741125
由于人体生物钟的变化，大脑皮层的不同区域的功能也在时时发生着变化，研究的结果表明： 
上午8～11点，是组织、计划、写作和进行一些创造性思维活动的最佳时间。最好把一天中最艰巨的任务放在此时完成。同时，这段时间疼痛最不敏感，此时看牙医最合适。 
上午11～12点，是开会的最佳时间，]]></description><category></category></item><item><title><![CDATA[hdu2176取(m堆)石子游戏 nim  hdu1848Fibonacci again and again sg]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39067497</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39067497</guid><author>coder_coder_coder</author><pubDate>Fri, 05 Sep 2014 00:49:13 +0800</pubDate><description><![CDATA[1Bash Game
n%(m+1)!=0,先取者win


2Wythoff Game
(a,b)
k=(b-a);
if(a==(int)(k*(1+sqrt(5.0))/2)) 后取者win


3Nimm Game
(a,b,c,d...)
if(a^b^c^d^..==0)后取者win]]></description><category></category></item><item><title><![CDATA[poj1288poj1228Grandpa's Estate poj1113Wall]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39067165</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39067165</guid><author>coder_coder_coder</author><pubDate>Fri, 05 Sep 2014 00:42:55 +0800</pubDate><description><![CDATA[poj1288
#include 
#include 
#include 
#include 
using namespace std;
const double eps=1e-10;
const int N=1005;
inline int dcmp(int x){
    if(!x) return 0;
    return x>0?1:-1;
}
struct pt{
    int x]]></description><category></category></item><item><title><![CDATA[poj2187Beauty Contest 凸包最大距离]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39066869</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/39066869</guid><author>coder_coder_coder</author><pubDate>Fri, 05 Sep 2014 00:41:19 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
const int N=60005;
inline int dcmp(int x){
	if(!x)return 0;
	return x>0?1:-1;
}
struct pt{
	int x,y;
}p[N],ans[N];
int top,n;
int]]></description><category></category></item><item><title><![CDATA[hdu3549Flow Problem  poj1273Drainage Ditches poj3281Dining sgu185     Network flow]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38886171</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38886171</guid><author>coder_coder_coder</author><pubDate>Thu, 28 Aug 2014 00:38:23 +0800</pubDate><description><![CDATA[hdu3549Flow_Problem
#include 
#include 
#include 
#include 
using namespace std;
const int N = 5005;
const int M = 30005;
struct Enode{
    int y, c, next;
} e[M * 2];
//struct Point
//{
//	int son,c]]></description><category></category></item><item><title><![CDATA[poj1254Hansel and Grethel poj1269Intersecting_Lines]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38885991</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38885991</guid><author>coder_coder_coder</author><pubDate>Thu, 28 Aug 2014 00:34:46 +0800</pubDate><description><![CDATA[poj1254Hansel and Grethel
#include 
#include 
#include 
using namespace std;
const double eps=1e-10;
const double pi=acos(-1.0);
const int inf=1e8;
inline int dcmp(double x){
    if(x < eps) return 0]]></description><category></category></item><item><title><![CDATA[hdu4195Regular Convex Polygon poj2242The Circumference of the Circle]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38885845</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38885845</guid><author>coder_coder_coder</author><pubDate>Thu, 28 Aug 2014 00:32:59 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
const double eps=1e-6;//这个错了可能wa
const double pi=acos(-1.0);
inline bool dcmp(double x){
    if(x<eps)return 0;
    return x>0?1:-1;
}
stru]]></description><category></category></item><item><title><![CDATA[poj2446Chessboard 奇偶建图]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38788109</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38788109</guid><author>coder_coder_coder</author><pubDate>Sun, 24 Aug 2014 01:04:51 +0800</pubDate><description><![CDATA[/*因为要用1*2的纸片覆盖，那么两个值（i+j）必然一个奇数一个偶数，然后分别给图中的奇数偶数点依次从1开始标号，相邻的按其标号建图，匈牙利、、比较快速，正解！
因为必然是一个奇数点对应一个相邻偶数点，那么只要求任意奇数或偶数的最大匹配就可以了。经典的建图方法。
*/
#include
#include
#include
using namespace std;
#define maxm 405]]></description><category></category></item><item><title><![CDATA[poj3692Kindergarten poj2584T-Shirt Gumbo多重匹配 拆点 poj3041Asteroids]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38785011</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38785011</guid><author>coder_coder_coder</author><pubDate>Sat, 23 Aug 2014 23:50:56 +0800</pubDate><description><![CDATA[/*
1.独立集：任意两点都不相连的顶点的集合
2.定理：最大独立集=顶点数-最大匹配边
3.完全子图：任意两点都相连的顶点的集合（最大完全子图即最大团）
4.定理：最大团=原图补图的最大独立集=顶点数-最大匹配数
*/

#include
#include
#include
using namespace std;
#define maxm 405
int n,m,s;
int map[maxm]]></description><category></category></item><item><title><![CDATA[uva10004 Bicoloring 二分图染色]]></title><link>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38784979</link><guid>https://blog.youkuaiyun.com/coder_coder_coder/article/details/38784979</guid><author>coder_coder_coder</author><pubDate>Sat, 23 Aug 2014 23:46:10 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
const int N=500;
const int M=40000;
struct List{
    int v;
    List *next;
}pool[M],*c[N],*pp;

int n,m;
int col[N];
bool flag;
inline void add_edge]]></description><category></category></item></channel></rss>