sp; {
____________; // (1)
if (____________) { a[s]=1; n++; } // (2)
}
cout<<"There are "<<n-1<< " kinds of postages:\n";
for (i=1;i<=27;i++)
if (____________) cout<<i<<" "; // (3)
cout<<endl;
return 0;
}
参考答案:
1.(1)break (2)i<n (3)a+i*2
2.(1)break (2)n%2==1 (3)n!=1
3.(1)break (2)number==i*i+j*j+k*k+l*l
4.(1)b=0,i=1 (2)m=0,i=1 (3)m==a
5.(1)(mul/=10)>0 (2)number==mul
6.(1)a=n/100 (2)b=n%100
7.(1)x0=x1 (2)x1=cos(x0)
8.(1)n=i*i (2)b=n/10%10
9.(1)y=y*10+x%10 (2)x=x/10
10.(1)i=i+2 (2)a==b && c==d (3)s*100+i*10+x
(4)n*1000+i*100+n*10+e (5)3*six==2*nine
11.(1)y=20-2*x (2)z=30-x-y (3)3*x+2*y+z==50
12.(1)x<=20 (2)y<=33 (3)z%3==0&&5*x+3*y+z/3==100
13.(1)i<=3 (2)j<=3 (3)(8-i-j)<=6
14.(1)'A'+x-1 (2)'A'+y-1 (3)'A'+z-1
15.(1)s=i*3+j*5 (2)a[s]==0 (3)a[i]==1