<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ranyangjun的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ranyangjun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ranyangjun]]></copyright><item><title><![CDATA[简单的随机排列（2011年3月）]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/7454210</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/7454210</guid><author>ranyangjun</author><pubDate>Thu, 12 Apr 2012 16:00:23 +0800</pubDate><description><![CDATA[#include  
#include 
using namespace std;
#define Maxnum 10000 
 class RandomArray{ 
  int arraynum[Maxnum]; 
  int length; public:
  RandomArray( int num ){
 length=num; 
 for(int i=0; i]]></description><category></category></item><item><title><![CDATA[在从1到n的正数中1出现的次数]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/6588682</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/6588682</guid><author>ranyangjun</author><pubDate>Wed, 06 Jul 2011 18:01:26 +0800</pubDate><description><![CDATA[//f(3217)=3*f(999)+f(217)+10^3//f(999)=10*f(99)+10^2，可以推导出fk9N,10^2表示100到199多出来的百位出现1的次数（100次）//fk9N(int k)表示从k个9,"999...999"到1出现1]]></description><category></category></item><item><title><![CDATA[递归问题——Concrete Mathematics]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/6003793</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/6003793</guid><author>ranyangjun</author><pubDate>Thu, 11 Nov 2010 23:14:00 +0800</pubDate><description><![CDATA[<br /> <br />1.1汉诺塔问题<br /> <br />How to
solve a recurrence problem<br />先猜后证明，采用数学归纳法来证明之<br />1）Look at small case. <br />2）Find and prove a mathematical expression
for the quantity of interest<br />3）Find and prove a closed form for our
mathematical ]]></description><category></category></item><item><title><![CDATA[全排列_问题（含重复元素）]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/5612268</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/5612268</guid><author>ranyangjun</author><pubDate>Thu, 20 May 2010 20:56:00 +0800</pubDate><description><![CDATA[含重复元素的全排列如果直接用前面的简单递归会产生重复输出所以没有重复输出的全排列需要用状态转移来做 假设1 2 3 4 5 5 6这几个数 它的下一个状态为 1  2 3 4 5 6 5                          1234655                           1235456 ......这样的规律是（1）]]></description><category></category></item><item><title><![CDATA[一个简单的全排列]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/5609254</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/5609254</guid><author>ranyangjun</author><pubDate>Wed, 19 May 2010 21:05:00 +0800</pubDate><description><![CDATA[用递归做的，且不能处理有重复数字的#define N 4  void Permutate(int* a,int k){ if (k == 4)  {  for (int i=0;i  {   fout  }  fout } else {  for (int i = k; i   {   swap(a[k], a[i]);  // fout   Permutate(a,k+1);  ]]></description><category></category></item><item><title><![CDATA[高精度乘法_利用二维矩阵]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/5608199</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/5608199</guid><author>ranyangjun</author><pubDate>Wed, 19 May 2010 16:21:00 +0800</pubDate><description><![CDATA[#include #include #define MaxCharBufferSize 100#define MaxIntBufferSize 50#define CharPerInteger 4#define CoverPerInteger 100000000using namespace std;/*void reversethearray(char* intarray,int len]]></description><category></category></item><item><title><![CDATA[高精度加法——C++实现_利用数组]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/5608189</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/5608189</guid><author>ranyangjun</author><pubDate>Wed, 19 May 2010 16:19:00 +0800</pubDate><description><![CDATA[#include #include #define MaxCharBufferSize 100#define MaxIntBufferSize 50#define CharPerInteger 8#define CoverPerInteger 100000000using namespace std;/*void reversethearray(char* intarray,int len]]></description><category></category></item><item><title><![CDATA[bochs在ubuntu下的安装心得]]></title><link>https://blog.youkuaiyun.com/ranyangjun/article/details/5608179</link><guid>https://blog.youkuaiyun.com/ranyangjun/article/details/5608179</guid><author>ranyangjun</author><pubDate>Wed, 19 May 2010 16:18:00 +0800</pubDate><description><![CDATA[最近由于某本书的原因需要装bochs，于是慌乱直接就在ubuntu中安装如果直接使用apt-get install bochs 会使安装不完全并且无法使用调试功能通过在网上资金的几经搜索，最后总结下安装成功的步骤 1.首先要装一个vmware workstation,推荐使用6.0正式版，我最开始去下最新版，可是通过修改系统时钟和输入序列号都无法使用，提示过期。 还有最好不要装精简版，因为如果要装]]></description><category></category></item></channel></rss>