<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Durandal的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012221059</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012221059]]></copyright><item><title><![CDATA[sgu112 高精度（用java水啊水）]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38401913</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38401913</guid><author>u012221059</author><pubDate>Wed, 06 Aug 2014 15:30:18 +0800</pubDate><description><![CDATA[import java.io.*;
import java.math.*;
import java.util.*;
public class Main{
	public static void main(String[] args){
        BigInteger n;
        int a, b;
     	Scanner cin = new Scanner(System.in)]]></description><category></category></item><item><title><![CDATA[sgu111 （大整数开方）]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38400141</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38400141</guid><author>u012221059</author><pubDate>Wed, 06 Aug 2014 13:55:35 +0800</pubDate><description><![CDATA[大整数开方。。。偷懒，抄了个java。。。留一下。。。回头弄一下java的dashuzi]]></description><category></category></item><item><title><![CDATA[sgu106 扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38375535</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38375535</guid><author>u012221059</author><pubDate>Mon, 04 Aug 2014 21:36:44 +0800</pubDate><description><![CDATA[扩展欧几里得求不定方程的jie]]></description><category></category></item><item><title><![CDATA[sgu105 算是数学么。。。]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38375375</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38375375</guid><author>u012221059</author><pubDate>Mon, 04 Aug 2014 21:20:06 +0800</pubDate><description><![CDATA[题意是这样的，1，1,2，1,23，1,2]]></description><category></category></item><item><title><![CDATA[sgu103]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38375073</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38375073</guid><author>u012221059</author><pubDate>Mon, 04 Aug 2014 21:01:02 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;

const int maxn = 501;
const int maxm = 15000;
const int inf = 99999999;

int s , t;
int n , m;
int C[maxn] , riC[maxn] , tiB[maxn] , tiP[maxn]]]></description><category></category></item><item><title><![CDATA[sgu100~102]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38374819</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38374819</guid><author>u012221059</author><pubDate>Mon, 04 Aug 2014 20:52:55 +0800</pubDate><description><![CDATA[sgu100(a+b) (我为啥要给这个题写题解。。。）
s]]></description><category></category></item><item><title><![CDATA[hdu4889 spfa（造数据卡spfa]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38336633</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38336633</guid><author>u012221059</author><pubDate>Fri, 01 Aug 2014 15:00:46 +0800</pubDate><description><![CDATA[题目是给了你一个spfa+slf优化的程序，然后，让你造个数据卡掉他，
其实那个slf优化根本不算是优化，只是在某些图上可能会更好，但是可以通过直接构造图将其由原本spfa最坏nm的复杂度卡成2^n复杂度




至于具体的，这题是曹圣 （http://blog.youkuaiyun.com/jinzhao1994） 给我讲的，他那里写的很详细，我就直接copy了







]]></description><category></category></item><item><title><![CDATA[hdu4859 海岸线]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38277585</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38277585</guid><author>u012221059</author><pubDate>Tue, 29 Jul 2014 20:43:24 +0800</pubDate><description><![CDATA[best coder的题目，我没做，后来和曹圣一起做，然后问的zzb才会做的
首先对点进行黑白染色，相邻建边，流量为1
然后将所有的为d的点翻转颜色，这时候我们的最小割的定义就是最小化 相同的（陆地和陆地，海洋和海洋）之间的边的长度，
最小化了这个长度，那么总长度减去这个长度就是海岸线的长度，
考虑外围加一圈d
计算的时候注意一下就好了。。。http://acm.hdu.edu.cn/s]]></description><category></category></item><item><title><![CDATA[hdu4780 高斯消元 及 非高斯消元]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38277523</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38277523</guid><author>u012221059</author><pubDate>Tue, 29 Jul 2014 20:42:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

const double eps=1e-7;

double dp[20];
double p;

int main() {
    int i,j;
    double ans;
    while (scanf("%lf",&p)!=EOF) {
        dp[0]=1/p;
        d]]></description><category></category></item><item><title><![CDATA[多校的第五题hdu4876]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38277457</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38277457</guid><author>u012221059</author><pubDate>Tue, 29 Jul 2014 20:37:25 +0800</pubDate><description><![CDATA[是个大搜索，考场上看出来了，不过没想到用2^k来剪k!。。。考虑不周。。>今天也是调试了很久，最后被土豪君一眼看到，数组开小了，果然手残的队长考场上不能碰代码啊摔！！！
代码能力真是弱到不行不行，一个搜索恨不得写一下午调一晚上>
#include
#include
#include
#include
#include
using namespace std;
int ans ;
int n ,]]></description><category></category></item><item><title><![CDATA[hdu4861 && hdu4864]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38277485</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38277485</guid><author>u012221059</author><pubDate>Tue, 29 Jul 2014 20:36:05 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4864
http://acm.hdu.edu.cn/showproblem.php?pid=4861
1001 打表找规律即可 最后结论是 k/(p-1) & 1
1004
一道贪心，数据范围n，m均为1e6，二分图km算法和费用流均无望通过
想到关于每个任务，贪心的寻找比他大的时间中所有的机器，因为对]]></description><category></category></item><item><title><![CDATA[SGU104]]></title><link>https://blog.youkuaiyun.com/u012221059/article/details/38129023</link><guid>https://blog.youkuaiyun.com/u012221059/article/details/38129023</guid><author>u012221059</author><pubDate>Fri, 25 Jul 2014 21:56:01 +0800</pubDate><description><![CDATA[题目大意
一溜花瓶1～m
一坨花1]]></description><category></category></item></channel></rss>