C程序代码大全

<

cout<<------------------<

cout<

#include <> 1 c<

int a[10]; double xy[10];

cout<

cout<

else if (score>=80) cout<=70) cout<=60) cout<

E.<

#include <> main() {

int n;

cout<<

=; cin>>n;

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

=<

cout< 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(float x=0;x<=;x=x+ cout<

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

cout<

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

cout<

#include<> main() {

.+100

int s=0,n=1; while(n<=100) { s=s+n; n++; } cout<

int s=0,n=0; do { n++; s+=n; }while(n<100);

cout<

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<

cout<

cout<

#include<> main() {

ame=<<(*p).name<

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

cout<sex=<sex<age=<age<

ame;

cout<>(*p).sex; cout<>(*p).age;

ame=<<(*p).name<

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

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< otal

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

test.)<

#include<>

void disp(void); <

#include<> <

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

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); <

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

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<> #include<> <

for (i=1; i<=MAX; i++) { cin>>x; (x); }

<>x; (x); } <

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

<< endl; isp_count(); delete p; (); }

#include<> << endl; }

~ex_class() { cout << The Object destroyed. <

void show_val(char *name); } ; <

#include<> um :; cout<

cout<<<

um=<

public: um=;

cout<<<

DispFirst(); } }; <

virtual void aFn2(void) { cout<

class.<

<

<

<

void aFn2(void) {

cout<

<

void aFn2(void){

cout<

cout<

cout<

#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<

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

cout<

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

econd << ;

else cout << [err] ; }

cout << endl; } }

#include #include #include

#include #include

#include <> using namespace std; #define ARRAY_SIZE 3 .入栈for (i=0;i<10;i=i+2) (i); if (!()) { cout << ()=20; << endl;

()=20; } //弹出栈中所有的数据并显示cout<

while (!()) { cout<<()<< ; (); } cout<

#include #include

#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<

cin>>(*i); } //从前向后显示listOne中的数据for (i = (); i != (); ++i) cout << *i << ; cout << endl; //bidirectional迭代器不允许加减运算// i=()+1; }

#include #include #include #include

#include #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}; 潣瑵?硜嵛尺※

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

cout<

val=100; cout<

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算法对于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算法对于set容器的计算

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

SET_INT set1;

SET_INT::iterator si;

//向set1容器中插入元素(5); (20); (10); (15); (25); //显示set1容器的元素值和累加结果cout <

(si=();si !=();++si) cout<<(*si)<< ; cout<

cout<

cout<

#include #include #include #include

#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]; 潣瑵?硜嵛尺※for (int i=0;i

cout<

cout<

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算法对于list容器的计算

//---------------------------------------------//声明list容器对象和迭代器LISTINT::iterator iL; LISTINT list1; //向list1容器对象中插入元素

并显示for (i=1; i

显示list1容器的元素值和统计结果cout << list1: ;

for (iL=();iL !=();++iL) cout<<(*iL)<< ; cout<

cout<

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

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

SET_INT set1;

SET_INT::iterator si; //向set1容器中插入元素for (i=1; i

cout <

for (si=();si !=();++si) cout<<(*si)<< ; cout<

cout<

#include #include #include #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] = y ; NamesVect[5] = he ; NamesVect[6] = Sea ; NamesVect[7] = Shore ;

//设置容器的起始位置和终止位置start = () ; end = () ; //显

示NamesVect容器的元素cout << NamesVect: ; for(it = start; it != end; it++) cout << *it << ; cout <

cout << Number of elements that start with letter \S\ = << result << endl ; //显示NamesVect容器[1,6]之间的元素cout

<

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

<< ; cout <

字符开头的字符串result = count_if(&NamesVect[1], &NamesVect[7], MatchFirstChar) ;

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

#include #include #include using namespace std; //利用类模板生成实例typedef vector < int > IntArray; //显示数组void

put_array(int x[],int size) { for(int i=0;i

//显示vector容器中的元素void put_vector(IntArray v) {

IntArray::iterator theIterator; for

(theIterator=();theIterator!=();++theIterator){ cout<<(*theIterator)<< ;

}

cout<

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

//---------------------------------------------int x[]={1,3,5,7,9}; 潣瑵??硜嵛?? put_array(x,5); //填数处理fill(x+1,x+3,2);

cout <<