(5)main( ) { int k; int a[3][3]={1,2,3,4,5,6,7,8,9}; for(k=0;k

fun(int k) {if(k>0)fun(k-1) printf(%d,k); } main() {int w=5; fun(w); } int main(void) { int k=0; while(k++ #include int b=2; int fun(int *k) {b=*k+b;return(b);} main() {int a[10]={1,2,3,4,5,6,7,8}, #include main() { int c=5,k; printf(%d,k=(++c)+(++c)+(++c)); } main() {int k=0; while(printf(*)) {k++; if(k #include int b=2; int fun(int*k) { b=*k+b;return(b);} main() {int a[10]={1,2,3,4,5,6,7,8}#include int b=2; int fun(int*k) { b=*k+b;return(b);} main() {int a[10]={1,2,3,4,5,6,7,8},i;for(i=2;i #include void main( ) { int k=-3; if (k (5)main( ) { int k; int a[3][3]={1,2,3,4,5,6,7,8,9}; for(k=0;k #include main( ) { int k,sum=0 int count=0 for(k=1;k C++求两个集合的交集#includevoid main(){ int a[5],b[5],c[5]; int i,j,k; int *p1,*p2,*p3; cout #include main() { int k,j,m; for(k=5;k>=1;k--) { m=0; for(j=k;j int b=2;int fun(int*k) {b=*k=b;return (b);} main() {int a[10]={1,2,3,4,5,6,7,8} for (i=2;i #include void main() { int k=5,n=0; while(k>0) {switch(k) {default : break; case 1:n+=k; 改错题：共有5处错误#include #define N 15int move(int w,int p,int n){ int i,j,t;for(i=p;i=0;j--) w[j+1]=w[j]; w[0]=t;}void main(){ int k; int a[N];printf( lnput data:);for(k=0;k int x=10,y=20; main() { int k,y=5; k=f1(); printf(k=%d,x=%d,y=%d,k,x,y); k=f2(); main(){ int x=5; while(x void main() {int t=1;fun(fun(t));} fun(int h) {stvoid main(){int t=1;fun(fun(t));}fun(int h){static int a[3]={1,2,3}; int k; for(k=0;k define M 5#define N M+M main(){int k;k=N*N*5; printf(%d,k);问结果是多少啊?呜呜,我做的不对,