1、 b = fun(&a, b) ;3、程序设计题void fun (int *a, int *n)main( ) int aa1000, n, k ; fun ( aa, &n ) ; for ( k = 0 ; k n ; k+ ) if(k + 1) % 10 = 0) printf(n) ; else printf(%5d, aak) ;第2套 void fun(char *s, char *p) int i, j, n, x, t; si!0 i+) n+; for(i=1; in-2; i=i+2) _1_; for(j=_2_+2 ; jsj) t=j; if(t!=i) x=si
2、; si=st; st=x; for(i=1,j=0; i=i+2, j+) pj=si; pj=_3_;baawrskjghzlicda, p50; fun(s,p);,p);math.hfloat fun ( float num ) int s ; float n, t, pi ; t = 1 ; pi = 0 ; n = 1 ; s = 1 ; while(t = num) pi = pi + t ; n = n + 2 ; s = -s ; t = s % n ; pi = pi * 4 ; return pi ; float n1, n2 ;Enter a float number:
3、 scanf(%f, &n1) ; n2 = fun(n1) ;%6.4fn, n2) ;string.h#define LEN 20void fun (char a, char b, int n) char str1LEN, str2LEN ; int n ;Enter the string: gets(str1) ;Enter the index of the char deleted:%dn) ; fun(str1, str2, n) ;The new string is:, str2) ;第3套stdlib.h#define N 5typedef struct node int dat
4、a; struct node *next; NODE;void fun(NODE *h) NODE *p, *q, *r; p = h-_1_; if (p=_2_) return; q = p-next; p-next = NULL; while (q) r = q- q-next = p; p = q; q = _3_; h-NODE *creatlist(int a) NODE *h,*p,*q; int i; h = (NODE *)malloc(sizeof(NODE);N; q=(NODE *)malloc(sizeof(NODE);data=ai; if (h-next = NU
5、LL) h-next = p = q; else p-next = q; return h;void outlist(NODE *h) NODE *p; if (p=NULL) printf(The list is NULL!); else printf(nHead do-, p-data); p=p- while(p!=NULL);Endn NODE *head; int aN=2,4,6,8,10; head=creatlist(a);nThe original list: outlist(head); fun(head);nThe list after inverting :#defin
6、e N 80int fun(char *s, char *t) int n; char *p , *r; while ( *s ) p=s;/*found*/ r=p; while(*r) if(*r=*p) r+; p+; else break; if(*r= 0) n+; s+; return n; char aN,bN; int m;nPlease enter string a : gets(a);nPlease enter substring b : gets( b ); m=fun(a, b); m = %dn,m);#define M 3#define N 20void fun(c
7、har aMN, char *b) /* 以下代码仅供参考 */ *b=0; char wMN=AAAA,BBBBBBBCC, a100;The string:M; i+)puts(wi); fun(w,a);The A string:%s,a);printf(nn第4套#define N 4void fun(int (*t)N) int i, j, x;_1_; x=ti_2_ ; for(j=N-1; j=1; j-) tij=tij-1; ti_3_=x; int tN=21,12,13,24,25,16,47,38,29,11,32,54,42,21,33,10, i, j;The o
8、riginal array: for(j=0; j+) printf(%2d ,tij); fun(t);nThe result is:double fun( double q ) double s,t; n = 2; s = 2.0; while (sint fun(char *s) char *lp,*rp; lp= _1_ ; rp=s+strlen(s)-1; while(toupper(*lp)=toupper(*rp) & (lprp) ) lp+; rp _2_ ; if(lprp) _3_ ; else return 1; char s81;Enter a string: if
9、(fun(s) printf(n%s is a Palindrome.nn isnt a Palindrome.nnfun (int n ) int a = 2, b = 1, c, k ; double s=0.0 ; for ( k = 1;= n; s = s + 1.0 * a / b ; c = a; a += b; b += c; return(s) ; int n = 5 ; printf( nThe value of function is: %lfn, fun ( n ) ) ;void fun(int m, int k, int xx) int i, j=1, t=m+1;
10、 while(j=k) /* 以下完成判断素数,并存放到数组xx中 */nPlease enter two integers:%d%dm, & fun( m, n, zz) ; for( m = 0 ; m = 1e-6); return f; double x, y; x=2.5; y = fun(x);x=%-12.6f y=%-12.6fn, x, y);long fun(int x,int y,long *p ) int i; long t=1;y; t=t*x; *p=t; t=t/1000; return t; long t,r; int x,y;nInput x and y:%l
11、d%ld,&x,&y); t=fun(x,y,&r);nnx=%d, y=%d, r=%ld, last=%ldnn,x, y,r,t ); double x,s;Input x:%lfx); s=fun(x);s=%fn第7套int c1,c2,c3;void fun(long n) c1 = c2 = c3 = 0; while (n) switch(_1_) case 1: c1+;_2_; case 2: c2+;_3_; case 3: c3+; n /= 10; long n=123114350L; fun(n);nThe result :n=%ld c1=%d c2=%d c3=
12、%dn,n,c1,c2,c3);int fun(unsigned n, int *zero) int count=0,max=0,t; t=n%10; if(t=0) count+; if(max99999999|n0)Please input(0n 0) d = s%10; if (d%2 = 0) *t = d * sl + *t; sl *= 10; s /= 10; long s, t;nPlease enter s:s); fun(s, &The result is:, t);void fun(char p1, char p2)Enter s1 and s2:%s%s, s1, s2) ;s1=%sn, s1) ;s2=%sn, s2) ;Invoke fun(s1,s2): fun(s1, s2) ;After invoking:%sn第9套 void fun(int (*a)N) int i=0,j,find=0,rmax,c,k; while( (iM) & (!find) rmax=ai0; c=0; for(j=1; j+) if(rmax
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1