<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kingterrors的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/kingterrors</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; kingterrors]]></copyright><item><title><![CDATA[肚子饿了]]></title><link>https://blog.csdn.net/kingterrors/article/details/84608180</link><guid>https://blog.csdn.net/kingterrors/article/details/84608180</guid><author>kingterrors</author><pubDate>Thu, 19 Jun 2014 17:26:30 +0800</pubDate><description><![CDATA[肚子饿了肚子饿了肚子饿了肚子饿了肚子饿了肚子饿了 :cry: ]]></description><category></category></item><item><title><![CDATA[辗转相除法,求公约数和公倍数.]]></title><link>https://blog.csdn.net/kingterrors/article/details/4017466</link><guid>https://blog.csdn.net/kingterrors/article/details/4017466</guid><author>kingterrors</author><pubDate>Mon, 23 Mar 2009 16:20:00 +0800</pubDate><description><![CDATA[#includevoid main(){ int m,n,m1,n1,a; printf("输入两个正整数:/n"); scanf("%d%d",&m,&n); m1=m; n1=n; a=m1%n1; while(a!=0) {  m1=n1;  n1=a;  a=m1%n1; } printf("最大公约数是%d./n",n1); printf("最小公倍数是%d./n",m*n/n1);}]]></description><category></category></item><item><title><![CDATA[输出数组a中的全部元素.]]></title><link>https://blog.csdn.net/kingterrors/article/details/4006364</link><guid>https://blog.csdn.net/kingterrors/article/details/4006364</guid><author>kingterrors</author><pubDate>Fri, 20 Mar 2009 08:47:00 +0800</pubDate><description><![CDATA[#includevoid main(){ int a[10]={1,3,5,7,9,2,4,6,8,10}; int *p; for(p=a;p  printf("%d ",*p); printf("/n");}]]></description><category></category></item><item><title><![CDATA[二维数组置换]]></title><link>https://blog.csdn.net/kingterrors/article/details/3973931</link><guid>https://blog.csdn.net/kingterrors/article/details/3973931</guid><author>kingterrors</author><pubDate>Mon, 09 Mar 2009 17:46:00 +0800</pubDate><description><![CDATA[#includevoid main(){ int i,j,t; int a[3][3]={1,2,3,4,5,6,7,8,9}; for(i=0;i {  for(j=0;j   printf("%3d",a[i][j]);  printf("/n"); } printf("/n"); for(i=0;i  for(j=0;j  {   t=a[i][j];   a[i][j]=a[j][i]; ]]></description><category></category></item><item><title><![CDATA[ 兔子繁殖问题.]]></title><link>https://blog.csdn.net/kingterrors/article/details/3973530</link><guid>https://blog.csdn.net/kingterrors/article/details/3973530</guid><author>kingterrors</author><pubDate>Mon, 09 Mar 2009 16:06:00 +0800</pubDate><description><![CDATA[ 兔子繁殖问题. #includevoid main(void){ int month; int f[13]={1,1}; for(month=2;month {  f[month]=f[month-1]+f[month-2]; } for(month=0;month {  printf("%d ",f[month]); }}]]></description><category></category></item></channel></rss>