续modi3.c
modi1.c
1. n
2. i
3. a[n-1-i]
modi2.c
for(i=2; i<=m; i++)
y -= 1/(i*i*1.0);
prog2.c
void fun(int a, int b, long *c){
c += (a/10)*1000;
c += (b/10)*100;
c += (a%10)*10;
c += (b%10);
return;
}
blank3.c
1. n
2. else
3. a, b
modi3.c
k = i;
b = k%10;
prog3.c
void fun(char *ss){
for(int i=0; i<strlen(ss); i++){
if((i&2) && (ss[i]<='z') && (ss[i]>='a')){
ss[i] = ss[i-32];
}
}
return;
}