![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二级c
路鹭有渭
The trick is to be consistently you,at you best.
展开
-
P135
#include void fun(char *c,int d) { *c=*c+1;d+=1; printf("%c,%c\n",*c,d); } main() { char a='A',b='a'; fun(&b,a);printf("%c,%c\n",a,b); }原创 2014-07-27 15:40:53 · 551 阅读 · 0 评论 -
P90
#include #define N 4 int fun(int a[][N]) { int i,j,max=a[0][0]; for(i=0;i<2;i++) for(j=0;j<N;j++) if(max<a[i][j]) max=a[i][j]; return max; } main() { int aa[2][N]={1,2,3,4,8,43,56,12};原创 2014-07-25 22:14:27 · 764 阅读 · 0 评论 -
P137
#include sub(int *a,int n,int k) { if(k<=n)sub(a,n/2,2*k); *a+=k; } main() { int x=0; sub(&x,8,1); printf("%d\n",x); }原创 2014-07-31 09:19:43 · 735 阅读 · 0 评论 -
P163
#include main() { struct s1{int x;int y;}; struct s1 a={1,3}; struct s1 *b=&a; b->x=10; printf("%d%d\n",a.x,a.y); }原创 2014-08-08 09:19:30 · 604 阅读 · 0 评论 -
P50
#include #include int fun (int high) { int sum=0,n=0,j,yes; while((high>=2)&&(n<10)) { yes=1; for(j=2;j<=high/2;j++) if(high%j==0) { yes=0;break; } if(yes) { sum+=high;原创 2014-07-21 22:25:57 · 900 阅读 · 1 评论