<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[吸颖力|Attractive]]></title><description><![CDATA[谋事在人，成事在天]]></description><link>https://blog.youkuaiyun.com/chenzaitian</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chenzaitian]]></copyright><item><title><![CDATA[数字的字符串转换成 对应整数输出]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/24063513</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/24063513</guid><author>chenzaitian</author><pubDate>Sat, 19 Apr 2014 00:02:13 +0800</pubDate><description><![CDATA[#include
int Str_To_Int(const char*p);
using namespace std;
int main()
{     
	char*ptr="-987321";
	int l=Str_To_Int(ptr);
	cout<<l<<endl;

	return 0;

}

//数字的字符串转换成 对应整数输出，例如：“78965” 转换]]></description><category></category></item><item><title><![CDATA[杨辉三角c++实现]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23949235</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23949235</guid><author>chenzaitian</author><pubDate>Thu, 17 Apr 2014 17:43:32 +0800</pubDate><description><![CDATA[c++实现杨辉三角：
#include
#include
using namespace std;
int main()
{
int n;
cin>>n;
int i=1;
queue pre;
queue out;
while(i
{
if(n==1)
 { cout
   break;
  }


if(i==1)
 {
cout
++i;
con]]></description><category></category></item><item><title><![CDATA[求第n个斐波那契数]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23890421</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23890421</guid><author>chenzaitian</author><pubDate>Thu, 17 Apr 2014 00:30:29 +0800</pubDate><description><![CDATA[递归法求第n个斐波那契数
#include
using namespace std;
int Fib_num(int n,int p,int q);


int main()
{
int n;
cin>>n;
while(n)
{
int m=Fib_num(n,1,1);
cout
cin>>n;
}


return 0;
}  
int Fib_num]]></description><category></category></item><item><title><![CDATA[插入排序]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23768127</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23768127</guid><author>chenzaitian</author><pubDate>Tue, 15 Apr 2014 16:26:37 +0800</pubDate><description><![CDATA[#include
using namespace std;
void InsertSort(int *a,int m){
for(int i=1;i
{
int temp=a[i];
int p=i-1;
for(;p>=0;--p) 
if(a[p]>temp)
a[p+1]=a[p];
else
break;

a[p+1]=temp;
   }
 }
int ]]></description><category></category></item><item><title><![CDATA[选择排序]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23759819</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23759819</guid><author>chenzaitian</author><pubDate>Tue, 15 Apr 2014 14:56:14 +0800</pubDate><description><![CDATA[选择排序：xianqu
#include
using namespace std;
void SelectSort(int *a,int m){
for(int i=0;i
{   int p=i;
   int temp=a[i];
for(int j=i+1;j
{
if(a[j]
{
temp=a[j];
p=j;
}
}
a[p]=a[i];
a[i]=te]]></description><category></category></item><item><title><![CDATA[鸡尾酒排序（类似冒泡排序）]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23637121</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23637121</guid><author>chenzaitian</author><pubDate>Mon, 14 Apr 2014 02:25:24 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
	int a[]={53,78,90,21,51,789,852,567,765,8908,253212,32,908};
	int m=sizeof(a)/sizeof(*a);
	int n=m-1;
	for(int i=0;i<n;)
	{
       for(int j=n;j>i;]]></description><category></category></item><item><title><![CDATA[二进制输出整数]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23272383</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23272383</guid><author>chenzaitian</author><pubDate>Wed, 09 Apr 2014 15:31:28 +0800</pubDate><description><![CDATA[#include
void binary_out(int x);
using namespace std;
int main()
{
 cout<<"please enter the number: ";
 int n;
 cin>>n;
 cout<<" the binary of "<<n<<" is ";
 binary_out(n);
 cout<<endl;
 re]]></description><category></category></item><item><title><![CDATA[求负数的补码]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23223385</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23223385</guid><author>chenzaitian</author><pubDate>Wed, 09 Apr 2014 00:26:27 +0800</pubDate><description><![CDATA[求负数的补码，可以使用较直接的方法，如下：]]></description><category></category></item><item><title><![CDATA[单链表的创建、排序、逆置等]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/23145269</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/23145269</guid><author>chenzaitian</author><pubDate>Tue, 08 Apr 2014 01:36:41 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
//定义链表节点；
typedef struct Node{
 int data;
    Node*next;
}node;
//创建链表；
node*Create_list()
{
 node *head;
 node*p;
 node*s;
 int x;
 head=(node*)m]]></description><category></category></item><item><title><![CDATA[using声明 和 using编译指令 比较]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/20528013</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/20528013</guid><author>chenzaitian</author><pubDate>Wed, 05 Mar 2014 14:36:25 +0800</pubDate><description><![CDATA[0.  using声明使特定的标识符可用，suing编译指令使整个名称空间的名称可用；


1.  using声明，由被限定的名称和它前面的关键字”suing“组成，如：using Jill::fetch;
     using编译指令，由名称空间名和它前面的关键字“using namespace”组成，如：using namespace Jill;
2.  如果函数中定义了一个变量（f]]></description><category></category></item><item><title><![CDATA[cin对象支持的3种模式的单字符输入]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/19968935</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/19968935</guid><author>chenzaitian</author><pubDate>Wed, 26 Feb 2014 11:16:31 +0800</pubDate><description><![CDATA[cin对象支持3 种不同模式的单字符输入


#include
using namespace std;
int main()
{   
char ch;
int count=0;
cout
cin>>ch;
while(ch!='#')
{
cout
++count;
cin>>ch;
}
cout
    
return 0;
}

此模式忽略空格，]]></description><category></category></item><item><title><![CDATA[编写一个产生1000个1到10范围内的随机整数，统计各数字出现的次数]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/19211269</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/19211269</guid><author>chenzaitian</author><pubDate>Fri, 14 Feb 2014 21:03:11 +0800</pubDate><description><![CDATA[编写一个产生1000个1到10范围内的随机整数，统计各数字出现的次数



#include
#include//为rand，srand函数提供原型；
#define NUM 1000
int main(void)
{
   unsigned int seed;
   int i,l;
   int a[10]={0,0,0,0,0,0,0,0,0,0};
   puts(]]></description><category></category></item><item><title><![CDATA[错误点]]></title><link>https://blog.youkuaiyun.com/chenzaitian/article/details/18597705</link><guid>https://blog.youkuaiyun.com/chenzaitian/article/details/18597705</guid><author>chenzaitian</author><pubDate>Tue, 21 Jan 2014 10:14:02 +0800</pubDate><description><![CDATA[#include
#define ROOW 3
#define LINE 5
void average(double ar[][LINE],int l);
double max(double ar[][LINE],int l);
int main(void)
{   
double arr[ROOW][LINE]={{1,2,3,4,5.6},{66.23,7,8,9,22.3},{]]></description><category></category></item></channel></rss>