C程序代码大全

C程序代码大全 This manuscript was revised on November 28, 2020

cout<<"------------------"<

cout<<"pi="<

else if (score>=70)

cout<<"Your grade is a C."<

else if (score>=60)

cout<<"Your grade is a D."<

else

cout<<"Your grade is a E."<

}

#include <>

main()

{

int n;

cout<<"n=";

cin>>n;

if (n>=0 && n<=100 &&n%2==0)

cout<<"n="<

else

cout<<"The "<

#include <>

main()

{

int a,b,Max;

.10

for(int i=1;i<=10;i++)

cout<

for(int j=10;j>=1;j--)

cout<

for(int k=1;k<=10;k=k+2)

cout<

for(char c='A';c<='Z';c++)

cout<

for(float x=0;x<=;x=x+

cout<

for(float x1=0;x1<=+2;x1=x1+

cout<

.+100

int s=0;

for(int n=1;n<=100;n++)

s=s+n;

cout<<"s="<

}

#include<>

main()

{

.+100

int s=0,n=1;

while(n<=100) {

s=s+n;

n++;

}

cout<<"s="<

.+100

int s=0,n=0;

do {

n++;

s+=n;

}while(n<100);

cout<<"s="<

um;

cin>>st[i].name;

cin>>st[i].maths;

cin>>st[i].physics;

cin>>st[i].chemistry;

}

otal=st[i].maths+st[i].physics+st[i].chemistry; um<<'\t';

cout<

}

#include<>

main()

{

ame="<<(*p).name<

cout<<"(*p).sex="<<(*p).sex<

cout<<"(*p).age="<<(*p).age<

cout<<"p->name="<name<

cout<<"p->sex="<sex<

cout<<"p->age="<age<

ame;

cout<<"sex:";

cin>>(*p).sex;

cout<<"age:";

cin>>(*p).age;

ame="<<(*p).name<

cout<<"(*p).sex="<<(*p).sex<

cout<<"(*p).age="<<(*p).age<

cout<<"-------------------------"<

ame<<'\t';

cout<

}

cout<<"----------------"<

;

int int_values[] = {51, 23, 2, 44, 45,0,11};

float float_values[] = {, , , , };

student st_arr[]={101,"WangLin",92,102,"LiPing",85,103,"ZhaoMin",88};

um<<" ";

cout<

}

#include<>

otal

swap_Rec(&a[i],&a[j]); <<"\t"<

#include<>

void disp(void); <

}

#include<>

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); um;

cin>>st[i].name;

cin>>st[i].grade;

fprintf(fp1,"%d %s %f\n",st[i].num,st[i].name,st[i].grade);

}

fclose(fp1); <

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); <

cout<<"Exiting program."<

exit(1); */

putc( 'A', stdin );

if( ferror( stdin ) )

{

perror( "Write error" );

clearerr( stdin );

}

/* See if read causes an error. */

printf( "Will input cause an error " );

c = getc( stdin );

if( ferror( stdin ) )

{

perror( "Read error" );

clearerr( stdin );

}

#include<>

for (i=1; i<=MAX; i++) {

cin>>x;

(x);

}

void push(float x) <

for (i=1; i<=MAX; i++) {

cin>>x;

(x);

}

void push(float x) <

}

~stack(void) << endl; << endl;

}

<< endl; isp_count();

delete p;

();

}

#include<>

<< endl;

}

~ex_class() {

cout << "The Object destroyed." <

}

void set_value(int n);

void show_val(char *name);

} ;

}

#include<>

um :";

cout<

}

};

um :";

cout<<<

}

um="<

}

public: um=";

cout<<<

}

how_value("(*p)obj2");

al="<

DispFirst();

}

};

}

virtual void aFn2(void) {

cout<<"aFn2 is in Base class."<

}

};

}

void aFn2(void) {

cout<<"aFn2 is in First derived class."<

};

}

void aFn2(void){

cout<<"aFn2 is in Second derived class."<

};

;

cout<<"s1: "<

cout<<"s2: "<

10.2f10.5f;

cout<<"String: "<

cout<<"p : "<

}

#include<>

#include <>

;

int n;

1.7320534f << endl;

}

~stack(void) {

cout << "Stack Destroyed." << endl;

}

void push(T);

T pop(void);

};

<< endl;

return;

}

stck[tos++] = i;

}

template T stack::pop(void)

{

if(tos==0)

{

cout << "Stack underflow." << endl;

return 0;

}

return stck[--tos];

}

irst;

cout<<","<<(*theIterator).second<<" ";

}

cout<

irst;

cout<<","<<(*theIterator).second<<" ";

}

cout<

irst;

cout<<","<<(*it).second<<" ";

}

cout<

econd << " ";

else

cout << "[err] ";

}

cout << endl;

}

#include

using namespace std;

econd;

cout<<"\t"<<(*theIterator).first<

econd;

cout<<"\t"<<(*i).first<

}

econd;

cout<<"\t"<<(*it).first<

}

econd;

cout<<"\t"<<(*i).first<

}

#include

#include <>

using namespace std;

#define ARRAY_SIZE 3 .入栈

for (i=0;i<10;i=i+2)

(i);

if (!()) {

cout << "()=20;" << endl;

()=20;

}

//弹出栈中所有的数据并显示

cout<<"stack1: ";

while (!()) {

cout<<()<<" ";

();

}

cout<

}

#include

using namespace std;

//创建一个list容器的实例LISTINT，其存放int型数据typedef list LISTINT;

void main(void)

{

//用LISTINT创建一个名为listOne的list对象 LISTINT listOne;

//指定i为迭代器变量

LISTINT::iterator i;

LISTINT::reverse_iterator ir;

//从前面向listOne容器中添加数据

(2);

(1);

//从后面向listOne容器中添加数据

(3);

(4);

//从前向后显示listOne中的数据

for (i = (); i != (); ++i)

cout << *i << " ";

cout << endl;

//从后向后显示listOne中的数据

for (ir =();ir!=(); ++ir)

cout << *ir << " ";

cout << endl;

//从键盘上输入数据

for (i = (); i != (); ++i) {

cout<<"listOne :";

cin>>(*i);

}

//从前向后显示listOne中的数据

for (i = (); i != (); ++i)

cout << *i << " ";

cout << endl;

//bidirectional迭代器不允许加减运算

// i=()+1;

}

#include

using namespace std;

//利用类模板生成类实例

typedef vector < int > IntArray;

typedef list LISTINT;

typedef set SET_INT;

int add(int a, int b) {

return a+b;

}

//在main()函数中测试accumulate算法

void main ()

{

//--------------------------------------------

// accumulate算法对于普通数组的计算

//--------------------------------------------- int x[]={1,3,5,7,9};

cout<<"x[]:";

for (int i=0;i<5;i++)

cout<

cout<<"accumulate(x,x+5,0)=";

cout<

int val=100;

cout<<"val="<

cout<<"accumulate(x,x+5,val)=";

cout<

//--------------------------------------------// accumulate算法对于vector容器的计算

//--------------------------------------------- //声明intvector容器和迭代器ii

IntArray intvector;

IntArray::iterator ii;

//向intvector容器中插入元素

for (i=1; i<=5; i++) {

(i);

};

//显示intvector容器中的元素值和累加结果

cout << "intvector: "<

for (ii=();ii !=();++ii)

cout<<(*ii)<<" ";

cout<

cout<<"accumulate(),(),0)=";

cout<

//--------------------------------------------// accumulate算法对于list容器的计算

//--------------------------------------------- //声明list容器对象和迭代器

LISTINT::iterator iL;

LISTINT list1;

//向list1容器对象中插入元素并显示

(1);

(3);

(5);

(2);

(6);

//显示list1容器的元素值和累加结果

cout << "list1: "<

for (iL=();iL !=();++iL)

cout<<(*iL)<<" ";

cout<

cout<<"accumulate(),(),0)=";

cout<

//--------------------------------------------// accumulate算法对于set容器的计算

//--------------------------------------------- //声明set容器对象和迭代器

SET_INT set1;

SET_INT::iterator si;

//向set1容器中插入元素

(5);

(20);

(10);

(15);

(25);

//显示set1容器的元素值和累加结果

cout <<"set1: "<

for (si=();si !=();++si)

cout<<(*si)<<" ";

cout<

cout<<"accumulate(),(),0)=";

cout<

cout<<"accumulate(),(),100)=";

cout<

}

#include

#define size 10

using namespace std;

//产生指定范围的整数随机数

int getrand(int min,int max) {

int m;

m=(max-min);

m=min+double(rand())/RAND_MAX*m ;

return m;

}

//利用类模板生成实例

typedef vector < int > IntArray;

typedef list LISTINT;

typedef set SET_INT;

//在main()函数中测试accumulate算法

void main ()

{

//--------------------------------------------// count算法对于普通数组的计算

//--------------------------------------------- int x[size];

cout<<"x[]:";

for (int i=0;i

x[i]=getrand(1,3);

cout<

}

cout<

cout<<"count(x,x+size,2)=";

cout<

cout<<"count(x+2,x+8,2)=";

cout<

//--------------------------------------------// count算法对于vector容器的计算

//---------------------------------------------

//声明intvector容器和迭代器ii

IntArray intvector;

IntArray::iterator ii;

//向intvector容器中插入元素

for (i=1; i

(getrand(2,6));

};

//显示intvector容器中的元素值和统计结果

cout << "intvector: ";

for (ii=();ii !=();++ii)

cout<<(*ii)<<" ";

cout<

cout<<"count(),(),4)=";

cout<

//--------------------------------------------// count算法对于list容器的计算

//--------------------------------------------- //声明list容器对象和迭代器

LISTINT::iterator iL;

LISTINT list1;

//向list1容器对象中插入元素并显示

for (i=1; i

(getrand(3,5));

};

//显示list1容器的元素值和统计结果

cout << "list1: ";

for (iL=();iL !=();++iL)

cout<<(*iL)<<" ";

cout<

cout<<"count(),(),3)=";

cout<

//--------------------------------------------// count算法对于set容器的计算

//--------------------------------------------- //声明set容器对象和迭代器

SET_INT set1;

SET_INT::iterator si;

//向set1容器中插入元素

for (i=1; i

(getrand(1,10));

};

//显示set1容器的元素值和统计结果

cout <<"set1: ";

for (si=();si !=();++si)

cout<<(*si)<<" ";

cout<

cout<<"count(),(),5)=";

cout<

}

#include

using namespace std;

//如果字符串以'S'开头，则返回true

int MatchFirstChar( const string& str)

{

string s("S") ;

return s == (0,1) ;

}

//测试count_if算法

void main()

{

const int VECTOR_SIZE = 8 ;

//生成成员类型为strings的vector容器类

typedef vector StringVector ;

//定义迭代器类型

typedef StringVector::iterator StringVectorIt ;

//声明vector容器的对象

StringVector NamesVect(VECTOR_SIZE) ;

//声明迭代器

StringVectorIt start, end, it ;

int result = 0 ; // 存放统计数据

//初始化vector容器NamesVect

NamesVect[0] = "She" ;

NamesVect[1] = "Sells" ;

NamesVect[2] = "Sea" ;

NamesVect[3] = "Shells" ;

NamesVect[4] = "by" ;

NamesVect[5] = "the" ;

NamesVect[6] = "Sea" ;

NamesVect[7] = "Shore" ;

//设置容器的起始位置和终止位置

start = () ;

end = () ;

//显示NamesVect容器的元素

cout << "NamesVect: " ;

for(it = start; it != end; it++)

cout << *it << " " ;

cout <

//统计并显示NamesVect容器的所有元素中以'S'字符开头的字符串

result = count_if(start, end, MatchFirstChar) ;

cout << "Number of elements that start with letter \"S\" = "

<< result << endl ;

//显示NamesVect容器[1,6]之间的元素

cout <<"NamesVect[1]--NamesVect[6]: " ;

for(it =&NamesVect[1]; it != &NamesVect[7]; it++)

cout << *it << " " ;

cout <

//统计并显示NamesVect容器的所有元素中以'S'字符开头的字符串

result = count_if(&NamesVect[1], &NamesVect[7], MatchFirstChar) ;

cout << "Number of elements that start with letter \"S\" = " << result << endl ;

}

#include

using namespace std;

//利用类模板生成实例

typedef vector < int > IntArray;

//显示数组

void put_array(int x[],int size) {

for(int i=0;i

cout<

}

//显示vector容器中的元素

void put_vector(IntArray v)

{

IntArray::iterator theIterator;

for (theIterator=();theIterator!=();++theIterator){

cout<<(*theIterator)<<" ";

}

cout<

}

//在main()函数中测试fill和fill_n算法

void main ()

{

//--------------------------------------------

// fill和fill_n算法对普通数组的计算

//---------------------------------------------

int x[]={1,3,5,7,9};

cout << "x[]: ";

put_array(x,5);

//填数处理

fill(x+1,x+3,2);

cout << "fill(x+1,x+3,2): "<

put_array(x,5);

fill_n(x,3,8);

cout << "fill_n(x,3,8): "<

put_array(x,5);

//--------------------------------------------

// fill和fill_n算法对于vector容器的计算

//---------------------------------------------

//声明intvector容器和迭代器ii

IntArray intvector;

//向intvector容器中插入元素

for (int i=1; i<=10; i++) {

(i);

};

//显示intvector容器中的元素值和统计结果

cout << "intvector: "<

put_vector(intvector);

//填数处理

fill(),()+3,2);

cout << "fill(),()+3,2): "<

put_vector(intvector);

fill_n(&intvector[5],3,8);

cout << "fill_n(&intvector[5],3,8): "<

put_vector(intvector);

}

#include

#define ARRAY_SIZE 10

using namespace std;

//利用类模板生成实例

typedef vector < int > IntArray;

//显示数组

void put_array(int x[],int size) {

for(int i=0;i

cout<

}

//显示vector容器中的元素

void put_vector(IntArray v)

{

IntArray::iterator theIterator;

for (theIterator=();theIterator!=();++theIterator){

cout<<(*theIterator)<<" ";

}

cout<

}

//在main()函数中测试find()算法

void main ()

{

int i,value,*p;

//--------------------------------------------

// find()算法对于普通数组的处理

//---------------------------------------------

int x[ARRAY_SIZE]={1,3,5,7,9,2,4,6,8,10};

cout << "x[]: ";

put_array(x,ARRAY_SIZE);

//find()算法查找,并显示查找结果

for(i=0;i<=2;i++) {

cout<<"value=";

cin>>value;

p=find(x,x+ARRAY_SIZE,value);

if (p != x + ARRAY_SIZE) { //查到

cout << "First element that matches " << value;

cout<< " is at location " << p - x<< endl;

}

else { //未查到

cout << "The sequence does not contain any elements"; cout<< " with value " << value << endl ;

}

//--------------------------------------------

//声明intvector容器对象

IntArray intvector;

//向intvector容器中插入元素

for (i=1; i<=10; i++) {

(i);

};

//显示intvector容器中的元素值

cout << "intvector: ";

put_vector(intvector);

//find()算法查找,并显示查找结果

IntArray::iterator pos;

for (i=0;i<=2;i++) {

cout<<"value=";

cin>>value;

pos=find(),(),value);

if (pos != ()) { //查到

cout << "First element that matches " << value;

cout<< " is at location " <

}

else { //未查到

cout << "The sequence does not contain any elements"; cout<< " with value " << value << endl ;

}

#include

#define ARRAY_SIZE 10

using namespace std;

//利用类模板生成实例

typedef vector < int > IntArray;

//显示数组

void put_array(int x[],int size) {

for(int i=0;i

cout<

}

//显示vector容器中的元素

void put_vector(IntArray v)

{

IntArray::iterator theIterator;

for (theIterator=();theIterator!=();++theIterator){

cout<<(*theIterator)<<" ";

}

//在main()函数中测试find()_end()算法

void main ()

{

//--------------------------------------------

int x[ARRAY_SIZE]={1,3,5,7,9,2,4,6,8,10};

cout << "x[]: ";

put_array(x,ARRAY_SIZE);

cout<

int y[]={5,7,9};

cout << "y[]: ";

put_array(y,3);

cout<

// find_end()算法查找,并显示查找结果

int *p=find_end(x,x+ARRAY_SIZE,&y[0],&y[2]);

if (p != x + ARRAY_SIZE) { //查到

cout << "The first element that matches :" ;

put_array(y,3);

cout<< " is at location in x" << p - x<< endl;

}

else { //未查到

cout << "The sequence does not contain any elements";

cout<< " with value " ;

put_array(&x[3],3);

}

//--------------------------------------------

// find_end()算法对vector容器的处理

//---------------------------------------------

//声明intvector容器对象

IntArray intvector;

//向intvector容器中插入元素

for (int i=1; i<=10; i++) {

(i);

};

//显示intvector容器中的元素值

cout << "intvector: ";

put_vector(intvector);

cout<

IntArray temp;

(5);

(6);

(7);

cout << "temp: ";

put_vector(temp);

cout<

// find_end()算法查找,并显示查找结果

IntArray::iterator pos;

pos=find_end(),(),(),());

if (pos != ()) { //查到

cout << "The first element that matches ";

put_vector(temp);

cout<< " is at location in intvector " <

else { //未查到

cout << "The sequence does not contain any elements";

cout<< " with value ";

put_vector(temp);

cout<< endl ;

}

#include

using namespace std;

//返回一个Fibonacci数，其由generate_n()算法调用

int Fibonacci1(void)

{

static int r;

static int f1 = 0;

static int f2 = 1;

r = f1 + f2 ;

f1 = f2 ;

f2 = r ;

return f1 ;

}

//返回一个Fibonacci数，其由generate()算法调用

int Fibonacci2(void)

{

static int r;

static int f1 = 0;

static int f2 = 1;

r = f1 + f2 ;

f1 = f2 ;

f2 = r ;

return f1 ;

}

//定义整型数的vector容器类

typedef vector IntVector ;

//显示vector容器中的元素

void put_vector(IntVector v,char *name)

{

IntVector::iterator theIterator;

cout<

for (theIterator=();theIterator!=();++theIterator){

cout<<(*theIterator)<<" ";

}

cout<

}

//测试generate()和generate_n()算法

void main()

{

const int VECTOR_SIZE = 15 ;

//定义迭代器类

typedef IntVector::iterator IntVectorIt ;

//声明vector容器对象

IntVector Numbers1(VECTOR_SIZE),Numbers2(VECTOR_SIZE); int i ;

//初始化vector容器对象

for(i = 0; i < VECTOR_SIZE; i++)