<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a890513的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a890513</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a890513]]></copyright><item><title><![CDATA[递归与栈的理解]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82986944</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82986944</guid><author>a890513</author><pubDate>Tue, 09 Oct 2018 18:59:59 +0800</pubDate><description><![CDATA[#include &amp;amp;lt;stdio.h&amp;amp;gt;
void rec(int num){
     if ( num &amp;amp;lt; 1)
          return;
    printf(&amp;quot;%d\n&amp;quot;, num);      //打印在递归之前
     rec(num - 1);
  printf(&amp;quot;%d\n&amp;quot;, num);      //打印在递归之后，圧栈先进后出
}
int ma]]></description><category></category></item><item><title><![CDATA[10进制数 转化为 2进制数]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82985801</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82985801</guid><author>a890513</author><pubDate>Tue, 09 Oct 2018 17:33:26 +0800</pubDate><description><![CDATA[#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
void zhuanhuan(int i){
     int b;
  	b = i%2;
  	if(i&amp;amp;amp;lt;2){
    		printf(&amp;amp;quot;%d&amp;amp;quot;,b);
  	}else{
    		i = i/2;
    		zhuanhuan(i);    //注意先递归  再圧栈打印
    		printf(&amp;amp;q]]></description><category></category></item><item><title><![CDATA[十进制数 倒序输出]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82983599</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82983599</guid><author>a890513</author><pubDate>Tue, 09 Oct 2018 15:51:08 +0800</pubDate><description><![CDATA[#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
void inverse(int a){
 	int b=0;
 		b=a%10;
 		a=a/10;
 		if(a==0){
 	 			printf(&amp;amp;quot;%d&amp;amp;quot;,b);
 			}
 			else{
 	 				printf(&amp;amp;quot;%d&amp;amp;quot;,b);
 	 				inverse(a);
 			}
}
i]]></description><category></category></item><item><title><![CDATA[打印斐波那契数列前n项]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82983133</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82983133</guid><author>a890513</author><pubDate>Tue, 09 Oct 2018 15:30:08 +0800</pubDate><description><![CDATA[#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
int feibonaqi(int n){
 	if(n == 0||n==1)
  		return 1;
 	return feibonaqi(n-1)+feibonaqi(n-2);
}
int main(int argc,char** argv)
{
 	int i=0,n=0;
 	scanf(&amp;amp;quot;%d&amp;amp;quot;,&amp;amp;amp;amp;n);
 	f]]></description><category></category></item><item><title><![CDATA[n的阶乘]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82969533</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82969533</guid><author>a890513</author><pubDate>Mon, 08 Oct 2018 16:17:42 +0800</pubDate><description><![CDATA[#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
int fun(int n){
     if(n ==1 || n ==0){
    		return 1;
  		}
  	return n*fun(n-1);
}
int main(int argc,char** argv)
{
  	int n;
  	scanf(&amp;amp;quot;%d&amp;amp;quot;,&amp;amp;amp;amp;n);
  	pri]]></description><category></category></item><item><title><![CDATA[1000以内的素数打印]]></title><link>https://blog.youkuaiyun.com/a890513/article/details/82968688</link><guid>https://blog.youkuaiyun.com/a890513/article/details/82968688</guid><author>a890513</author><pubDate>Mon, 08 Oct 2018 15:33:13 +0800</pubDate><description><![CDATA[#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
#include&amp;amp;amp;lt;math.h&amp;amp;amp;gt;
int M(int n);
int main(void)
{
int i,count=0;
for(i=2;i&amp;amp;amp;lt;1000;i++){				
if(M(i)){           					//返回素数后计数并打印
count++;
printf(&amp;amp;quo]]></description><category></category></item></channel></rss>