1、C+基础教程素材4#include void main() double x,y; coutxy; double z=x+y; coutsum=zendl;double sum-double() double x,y; coutxy; double s=x+y; return s;#include void main() double sum; sum=sum-double(); coutsum=sumendl;#include double sum-double(double x,double y) return x+y;void main() double a,b; coutab; dou
2、ble sum=sum-double(a,b); coutsum=sumendl;()void nothing()int sum-int (int x, int y)return x+y;();#include void fun1(),fun2(),fun3();void main() coutIt is in main.endl; fun2(); coutIt is back in main.endl;void fun1() coutIts in fun1.endl; fun3(); coutIts back in fun1.endl;void fun2() coutIts in fun2.
3、endl; fun1(); coutIts back in fun2.endl;void fun3() coutIts in fun3.endl;return ;return;#include void swap1(int x,int y) int temp; temp=x; x=y; y=temp; coutx=x,y=yendl;void main() int a(5),b(9); swap1(a,b); couta=a,b=bendl;x=9,y=5a=5,b=9#include void swap2(int *x,int *y) int temp; temp=*x; *x=*y; *y
4、=temp; coutx=*x,y=*yendl;void main() int a(5),b(9); swap2(&a,&b); couta=a,b=bendl;x=9,y=5a=9,b=5#include void swap3(int &x,int &y) int temp; temp=x; x=y; y=temp; coutx=x,y=yendl;void main() int a(5),b(9); swap3(a,b); couta=a,b=bendl;x=9,y=5a=9,b=5#include int add-int(int x,int y) return x+y;void mai
5、n() int x(4),y(6); int z=add-int(+x,x+y); coutzendl;z=add-int (+x, x+y);int x(4), y(6);int t=+x;int z=add-int (t, x+y);cout z endl;int add-int (int x, int y=10);add-int (15)add-int (15,10)#include void fun(int a=1,int b=3,int c=5) couta=a,b=b,c=cendl;void main() fun(); fun(7); fun(7,9); fun(7,9,11);
6、 coutOK!;a=1,b=3,c=5a=7,b=3,c=5a=7,b=9,c=5a=7,b=9,c=11OK!#include int m(8);int add-int(int x,int y=7,int z=m);void main() int a(5),b(15),c(20); int s=add-int(a,b); coutsendl;int add-int(int x,int y,int z) return x+y+z;#include int a8=1,3,5,7,9,11,13;void fun(int b,int n) for(int i=0;in-1;i+) b7+=bi;
7、void main() int m=8; fun(a,m); couta7endl;#include int a8=1,3,5,7,9,11,13;void fun(int *pa,int n) for(int i=0;in-1;i+) *(pa+7)+=*(pa+i);void main() int m=8; fun(a,m); couta7endl;int *p=a;fun (p,m);typedef int array8;#include typedef int array8;int a8=1,3,5,7,9,11,13;void fun(array &b,int n) for(int
8、i=0;in-1;i+) b7+=bi;void main() int m=8; fun(a,m); couta7endl;inline int add-int (int x, int y, int z)return x+y+z;#include inline int power-int(int x) return (x)*(x);void main() for(int i=1;i=10;i+) int p=power-int(i); couti*i=pendl; #include int add(int,int);double add(double,double);void main() c
9、outadd(5,10)endl; coutadd(5.0,10.5)endl;int add(int x,int y) return x+y;double add(double a,double b) return a+b;1515.5#include int min(int a,int b);int min(int a,int b,int c);int min(int a,int b,int c,int d);void main() coutmin(13,5,4,9)endl; coutmin(-2,8,0);int min(int a,int b) return ab?a:b;int m
10、in(int a,int b,int c) int t=min(a,b); return min(t,c);int min(int a,int b,int c,int d) int t1=min(a,b); int t2=min(c,d); return min(t1,t2);It is in main.Its in fun2.Its in fun1.Its in fun3.Its back in fun1.Its back in fun2.It is back in main.1k+2k+3k+:+nk#include const int k(4);const int n(6);int su
11、m-of-powers(int k,int n),powers(int m,int n);void main() coutsum of k powers of integers from 1 to n=; coutsum-of-powers(k,n)endl;int sum-of-powers(int k,int n) int sum(0); for(int i(1);i=n;i+) sum+=powers(i,k); return sum;int powers(int m,int n) int i,product(1); for(i=1;i=n;i+) product*=m; return product;sum of 4 powers of integers of 1 to 6=22755*4*3*2*1*1等于120。#include long int fac(int n);void main() int n; coutn; long fa=fac(n); coutn!=faendl;long int fac(int n) long int p; if(n=0) p=1; el
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1