<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dilan3700的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dilan3700</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dilan3700]]></copyright><item><title><![CDATA[hdu 1159 Common Subsequence]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475907</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475907</guid><author>dilan3700</author><pubDate>Thu, 01 May 2014 11:30:00 +0800</pubDate><description><![CDATA[hdu 1159 Common Subsequence

        
	
        
            

    //开始DP之旅,先来道简单的

Problem Description
 A subsequence of a given sequence is the given sequence with so...]]></description><category></category></item><item><title><![CDATA[hdu 1063 Exponentiation (高精度小数乘法)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475913</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475913</guid><author>dilan3700</author><pubDate>Thu, 01 May 2014 10:31:00 +0800</pubDate><description><![CDATA[hdu 1063 Exponentiation (高精度小数乘法)

        
	
        
            

    

//大数继续，额，要吐了。


Problem Description

Problems involving the computation of exact values of...]]></description><category></category></item><item><title><![CDATA[hdu 1316 How many Fibs?(高精度斐波那契数)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475903</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475903</guid><author>dilan3700</author><pubDate>Thu, 01 May 2014 08:53:00 +0800</pubDate><description><![CDATA[hdu 1316 How many Fibs?(高精度斐波那契数)

        
	
        
            

    

// 大数继续


Problem Description

Recall the definition of the Fibonacci numbers:
f1 := 1...]]></description><category></category></item><item><title><![CDATA[hdu 1250 Hat's Fibonacci(高精度数)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475911</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475911</guid><author>dilan3700</author><pubDate>Wed, 30 Apr 2014 20:56:00 +0800</pubDate><description><![CDATA[hdu 1250 Hat's Fibonacci(高精度数)

        
	
        
            

    

// 继续大数，哎、、


Problem Description

A Fibonacci sequence is calculated by adding the previous...]]></description><category></category></item><item><title><![CDATA[hdu 1753 大明A+B(高精度小数加法)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475901</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475901</guid><author>dilan3700</author><pubDate>Wed, 30 Apr 2014 15:22:00 +0800</pubDate><description><![CDATA[hdu 1753 大明A+B(高精度小数加法)

        
	
        
            

    

//深刻认识到自己的粗心，为此浪费了一天。。


Problem Description

话说，经过了漫长的一个多月，小明已经成长了许多，所以他改了一个名字叫“大明”。
这时他已经不是那个只会做1...]]></description><category></category></item><item><title><![CDATA[霍纳法则(Horner's rule)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475909</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475909</guid><author>dilan3700</author><pubDate>Tue, 29 Apr 2014 10:51:00 +0800</pubDate><description><![CDATA[霍纳法则(Horner's rule)

        
	
        
            

    

卡在hdu 1402 的高精度乘法了，要用FFT(快速傅里叶变换)，然后看到了这个霍纳法则，顺便就写下来了。
霍纳法则：求多项式值的一个快速算法。
简单介绍:
假设有n+2个数 , a0,a1,a2,a3,……a...]]></description><category></category></item><item><title><![CDATA[hdu 1715 大菲波数(高精度数)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475898</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475898</guid><author>dilan3700</author><pubDate>Mon, 28 Apr 2014 16:33:00 +0800</pubDate><description><![CDATA[hdu 1715 大菲波数(高精度数)

        
	
        
            

    


Problem Description
Fibonacci数列，定义如下：
f(1)=f(2)=1
f(n)=f(n-1)+f(n-2) n&gt;=3。
计算第n项Fibonacci数值。

...]]></description><category></category></item><item><title><![CDATA[标准C++中string类的用法]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475908</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475908</guid><author>dilan3700</author><pubDate>Mon, 28 Apr 2014 16:03:00 +0800</pubDate><description><![CDATA[标准C++中string类的用法

        
	
        
            

    

转自博客园：http://www.cnblogs.com/xFreedom/archive/2011/05/16/2048037.html

相信使用过MFC编程的朋友对CString这个类的印象应该非常深刻吧？的确，M...]]></description><category></category></item><item><title><![CDATA[hdu 1047 Integer Inquiry(高精度数)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475896</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475896</guid><author>dilan3700</author><pubDate>Mon, 28 Apr 2014 15:54:00 +0800</pubDate><description><![CDATA[hdu 1047 Integer Inquiry(高精度数)

        
	
        
            

    


Problem Description
Oneof the first users of BIT's new supercomputer was Chip Diller. He extend...]]></description><category></category></item><item><title><![CDATA[Hdu 1042 N! (高精度数)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475894</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475894</guid><author>dilan3700</author><pubDate>Mon, 28 Apr 2014 10:14:00 +0800</pubDate><description><![CDATA[Hdu 1042 N! (高精度数)

        
	
        
            

    


Problem Description
Givenan integer N(0 ≤ N ≤ 10000), your task is to calculate N!


Input
OneN in on...]]></description><category></category></item><item><title><![CDATA[Sdut 2409 The Best Seat in ACM Contest(山东省第三届ACM省赛 H 题)(模拟)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475905</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475905</guid><author>dilan3700</author><pubDate>Mon, 28 Apr 2014 09:46:00 +0800</pubDate><description><![CDATA[Sdut 2409 The Best Seat in ACM Contest(山东省第三届ACM省赛 H 题)(模拟)

        
	
        
            

    

题目描述

Cainiao is a university student who loves ACM contest very mu...]]></description><category></category></item><item><title><![CDATA[2014-4-27 心情]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475902</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475902</guid><author>dilan3700</author><pubDate>Sun, 27 Apr 2014 22:33:00 +0800</pubDate><description><![CDATA[2014-4-27 心情

        
	
        
            

    

  今天回到宿舍以后，宿舍就剩自己了，然后就胡思乱想了。。 
虽然最近一直在各个OJ上做题，但是感觉进步很少，ACM需要的知识太多了，自己会的就太少了，突然就丧失信心了。。
然后找了一个小伙伴聊天，他的一句话让我稍微清醒...]]></description><category></category></item><item><title><![CDATA[Sdut 2416 Fruit Ninja II(山东省第三届ACM省赛 J 题)(解析几何)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475892</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475892</guid><author>dilan3700</author><pubDate>Sun, 27 Apr 2014 18:43:00 +0800</pubDate><description><![CDATA[Sdut 2416 Fruit Ninja II(山东省第三届ACM省赛 J 题)(解析几何)

        
	
        
            

    

Time Limit: 5000MS Memory limit: 65536K
题目描述

Haveyou ever played a popular g...]]></description><category></category></item><item><title><![CDATA[Poj 1061 青蛙的约会(扩展欧几里得)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475899</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475899</guid><author>dilan3700</author><pubDate>Sat, 26 Apr 2014 15:26:00 +0800</pubDate><description><![CDATA[Poj 1061 青蛙的约会(扩展欧几里得)

        
	
        
            

    


Description

两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情...]]></description><category></category></item><item><title><![CDATA[hrbust 1328 相等的最小公倍数(数论）]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475897</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475897</guid><author>dilan3700</author><pubDate>Sat, 26 Apr 2014 14:06:00 +0800</pubDate><description><![CDATA[hrbust 1328 相等的最小公倍数(数论）

        
	
        
            

    






Description




定义An为1，2，…，n的最小公倍数，例如，A1= 1，A2= 2，A3= 6，A4= 12，A5= 60，A6= 60。
请你判断...]]></description><category></category></item><item><title><![CDATA[hdu 1286 找新朋友 （欧拉函数）]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475874</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475874</guid><author>dilan3700</author><pubDate>Fri, 25 Apr 2014 18:57:00 +0800</pubDate><description><![CDATA[hdu 1286 找新朋友 （欧拉函数）

        
	
        
            

    



Problem Description
新年快到了，“猪头帮协会”准备搞一个聚会，已经知道现有会员N人，把会员从1到N编号，其中会长的号码是N号，凡是和会长是老朋友的，那么该会员的号码肯定和N有大于1的公约...]]></description><category></category></item><item><title><![CDATA[Sdut 2164 Binomial Coeffcients (组合数学) （山东省ACM第二届省赛 D 题）]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475884</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475884</guid><author>dilan3700</author><pubDate>Mon, 21 Apr 2014 21:11:00 +0800</pubDate><description><![CDATA[Sdut 2164 Binomial Coeffcients (组合数学) （山东省ACM第二届省赛 D 题）

        
	
        
            

    

Binomial Coeffcients

TimeLimit:
 1000ms Memory limit: 65536K有疑问？点...]]></description><category></category></item><item><title><![CDATA[Sdut 2165 Crack Mathmen(数论）(山东省ACM第二届省赛E 题)]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475872</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475872</guid><author>dilan3700</author><pubDate>Mon, 21 Apr 2014 20:57:00 +0800</pubDate><description><![CDATA[Sdut 2165 Crack Mathmen(数论）(山东省ACM第二届省赛E 题)

        
	
        
            

    

Crack Mathmen

TimeLimit: 1000ms Memory
 limit: 65536K有疑问？点这里^_^

题目描述
Si...]]></description><category></category></item><item><title><![CDATA[数据结构笔记之—— 顺序表实现]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475873</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475873</guid><author>dilan3700</author><pubDate>Fri, 18 Apr 2014 20:52:00 +0800</pubDate><description><![CDATA[数据结构笔记之—— 顺序表实现

        
	
        
            

    

学习数据结构了，写下来，加深记忆。
第一篇：
//system("cls");  控制台屏幕刷新
#include&lt;stdio.h&gt;
#include&lt;string.h&gt;
#include&lt;m...]]></description><category></category></item><item><title><![CDATA[Hdu 1452 Happy 2004（除数和函数，快速幂乘（模），乘法逆元）]]></title><link>https://blog.youkuaiyun.com/dilan3700/article/details/101475865</link><guid>https://blog.youkuaiyun.com/dilan3700/article/details/101475865</guid><author>dilan3700</author><pubDate>Fri, 18 Apr 2014 19:56:00 +0800</pubDate><description><![CDATA[Hdu 1452 Happy 2004（除数和函数，快速幂乘（模），乘法逆元）

        
	
        
            

    

Problem Description
Considera positive integer X,and let S be the sum of all positive in...]]></description><category></category></item></channel></rss>