<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sinat_21243261的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_21243261</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_21243261]]></copyright><item><title><![CDATA[POJ 1090 Chain]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425101</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425101</guid><author>sinat_21243261</author><pubDate>Tue, 29 Dec 2015 11:29:30 +0800</pubDate><description><![CDATA[Chain




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 3350
 
Accepted: 1104




Description

Byteland had not always been a democratic country. There were also bl]]></description><category></category></item><item><title><![CDATA[POJ 3659 Cell Phone Network]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425055</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425055</guid><author>sinat_21243261</author><pubDate>Tue, 29 Dec 2015 11:24:28 +0800</pubDate><description><![CDATA[Cell Phone Network




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 6102
 
Accepted: 2193




Description

Farmer John has decided to give each of his cows a cell ]]></description><category></category></item><item><title><![CDATA[SCU 1679 Gangsters]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425004</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/50425004</guid><author>sinat_21243261</author><pubDate>Tue, 29 Dec 2015 11:19:58 +0800</pubDate><description><![CDATA[N gangsters are going to a restaurant. The i-th gangster comes at the time Ti and has the prosperity Pi. The door of the restaurant has K+1 states of openness expressed by the integers in the range [0]]></description><category></category></item><item><title><![CDATA[UVA 10004 Bicoloring]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/50424922</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/50424922</guid><author>sinat_21243261</author><pubDate>Tue, 29 Dec 2015 11:12:55 +0800</pubDate><description><![CDATA[题目链接
二分图染色，边搜索边染0 1色就行
#include
#include
#include
#include
using namespace std;
int n,m;
const int maxn=210;
int map[maxn][maxn],vis[maxn];
bool col[maxn];
int dfs(int x)
{
    for(int i=0;i<n;i++)]]></description><category></category></item><item><title><![CDATA[UVA 10056 What is the Probability ?]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/50424875</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/50424875</guid><author>sinat_21243261</author><pubDate>Tue, 29 Dec 2015 11:09:04 +0800</pubDate><description><![CDATA[题目描述
简单的推一下就行了
#include
#include
#include
#include
using namespace std;
int n,an;
double p;
double ans,a1;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%lf%d",&n]]></description><category></category></item><item><title><![CDATA[HDU 5446 Unknown Treasure]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/48416793</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/48416793</guid><author>sinat_21243261</author><pubDate>Sun, 13 Sep 2015 16:59:10 +0800</pubDate><description><![CDATA[排列组合求模。lucas+crt 直接贴模板。比赛时候直接WA，结果是LL*LL会爆，手写一个就行。
#include
#include
#include
#include
#include
#include
#include
typedef long long LL;
using namespace std;
LL p;
LL A[12],M[12];
LL mod_mul(LL a,LL b]]></description><category></category></item><item><title><![CDATA[POJ 2186 Popular Cows]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47758329</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47758329</guid><author>sinat_21243261</author><pubDate>Tue, 18 Aug 2015 20:16:02 +0800</pubDate><description><![CDATA[Popular
 Cows
POJ - 2186





时限: 2000MS
 
内存: 65536KB
 
64位IO格式: %I64d & %I64u






提交 状态
已开启划词翻译

问题描述


Every cow's dream is to become the most popular cow in the herd. In]]></description><category></category></item><item><title><![CDATA[HDU5001 Walk]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47752683</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47752683</guid><author>sinat_21243261</author><pubDate>Tue, 18 Aug 2015 15:29:40 +0800</pubDate><description><![CDATA[E - Walk
时限:15000MS     内存:65536KB     64位IO格式:%I64d
 & %I64u
提交 状态 练习 HDU
 5001



问题描述

I used to think I could be anything, but now I know that I couldn't do anything. So I started travel]]></description><category></category></item><item><title><![CDATA[HDU4283 You Are the One 动态规划]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47065853</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47065853</guid><author>sinat_21243261</author><pubDate>Sun, 26 Jul 2015 10:26:19 +0800</pubDate><description><![CDATA[题目描述：
The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in
 the Small hall, so it attrac]]></description><category></category></item><item><title><![CDATA[HDU4282 A very hard mathematic problem 快速幂]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47061875</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47061875</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 23:36:16 +0800</pubDate><description><![CDATA[问题描述：


Haoren is very good at solving mathematic problems. Today he is working a problem like this: 
　　Find three positive integers X, Y and Z (X  1) that holds 
　　 X^Z + Y^Z + XYZ = K 
　　where]]></description><category></category></item><item><title><![CDATA[HDU4745 Two Rabbits 动态规划]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47061365</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47061365</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 22:50:39 +0800</pubDate><description><![CDATA[问题描述：
Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the
 ground and they were arrange]]></description><category></category></item><item><title><![CDATA[HDU4740 The Donkey of Gui Zhou 暴力模拟]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059983</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059983</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 21:00:16 +0800</pubDate><description><![CDATA[问题描述：




The donkey lived happily until it saw a tiger far away. The donkey had never seen a tiger ,and the tiger had never seen a donkey. Both of them were frightened and wanted
 to escape fro]]></description><category></category></item><item><title><![CDATA[HDU 4738 Caocao's Bridges(tarjan算法)]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059805</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059805</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 20:45:06 +0800</pubDate><description><![CDATA[问题描述：

Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another idea. He built ma]]></description><category></category></item><item><title><![CDATA[UVA 12904 Load Balancing （暴力）]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059629</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47059629</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 20:22:30 +0800</pubDate><description><![CDATA[题目描述
The infamous University of Kala Jadu (UKJ) have been operating underground for the last fourteencenturies training very select few students the dangerous art of black magic. However, with the re]]></description><category></category></item><item><title><![CDATA[uva 12898 And Or]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058833</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058833</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 18:24:19 +0800</pubDate><description><![CDATA[题目：  
Given A and B, 1 ≤ A ≤ B ≤ 1018, find the result of A|(A + 1)|(A + 2)| . . . |B and A&(A + 1)&(A +2)& . . . &B.| operator represents bitwise OR (inclusive)& operator represents bitwise AND
Inp]]></description><category></category></item><item><title><![CDATA[UVA 12897 Decoding Baby Boos]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058547</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058547</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 17:51:27 +0800</pubDate><description><![CDATA[Osantu has been tagged as the best Bangladeshi contestant of present time by many and now he ismostly busy with the sweetest problem of his life — a baby boy. But Osantu often struggles to decodethe s]]></description><category></category></item><item><title><![CDATA[FZU2141  Sub-Bipartite Graph  贪心]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058111</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47058111</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 17:06:27 +0800</pubDate><description><![CDATA[问题描述

Given a simple undirected graph G with n vertices and m edges, your task is to select a sub-bipartite graph of G with at least m/2 edges.

In the mathematical field of graph theory, a bipart]]></description><category></category></item><item><title><![CDATA[Forever 0.5   FZU 1240]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/47057989</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/47057989</guid><author>sinat_21243261</author><pubDate>Sat, 25 Jul 2015 16:55:55 +0800</pubDate><description><![CDATA[Problem DescriptionGiven an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following conditions:1.	The distance between any two points is no greater t]]></description><category></category></item><item><title><![CDATA[素数环问题（HDUOJ 1016）]]></title><link>https://blog.youkuaiyun.com/sinat_21243261/article/details/42156483</link><guid>https://blog.youkuaiyun.com/sinat_21243261/article/details/42156483</guid><author>sinat_21243261</author><pubDate>Thu, 25 Dec 2014 23:41:03 +0800</pubDate><description><![CDATA[acm 素数环 DFS]]></description><category></category></item></channel></rss>