#include <stdio.h>
#include <stdlib.h>
int main ()
{
int i;
char szInput [256];
printf ("Enter a number: ");
fgets ( szInput, 256, stdin );
i = atoi (szInput);
printf ("The value entered is %d. The double is %d./n",i,i*2);
return 0;
}
/* sprintf example */ #include <stdio.h> int main () { char buffer [50]; int n, a=5, b=3; n=sprintf (buffer, "%d plus %d is %d", a, b, a+b); printf ("[%s] is a %d char long string/n",buffer,n); return 0; }
//sort的使用
#pragma warning (disable:4786)//忽略警告,调试时好用
#include<iostream>
#include<stdio.h>
#include<algorithm> //sort函数要包含的头文件
#include<string>
using namespace std;
int main()
{
char a[10];
string str="cdb";
sort(str.begin(),str.end()); //实现由小到大排序;
cout<<str<<endl;
memset(a,'0',sizeof(a));
int b=143822;
sprintf(a,"%d",b);
cout<<a<<endl;
char* p=a;
*(p+6)=1;
sort(p,p+9); //用指针可以指定范围内,对数据排序。
cout<<"排序后的a"<<endl<<a<<endl<<endl; //有点缺陷,最好不要这么使用
int c=atoi(a);
cout<<c<<endl;
return 0;
}
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main ()
{
int x=10, y=20; // x:10 y:20
swap(x,y); // x:20 y:10
vector<int> first (4,x), second (6,y); // first:4x20 second:6x10
vector<int>::iterator it1=first.begin();
for(;it1!=first.end();++it1)
cout<<*it1<<" ";//输出四个20;
cout<<endl;
vector<int>::iterator it2=second.begin();
for(;it2!=second.end();++it2)
cout<<*it2<<" ";//输出六个10;
cout<<endl;
swap(first,second); // first:6x10 second:4x20
cout << "first contains:";
for (vector<int>::iterator it=first.begin(); it!=first.end(); ++it)
cout << " " << *it;
cout << endl;
return 0;
}