【程序】SET TALK OFFDIMENSION A(6)FOR K=1 TO 6A(K)=30—3*KENDFORK=5DO WHILE K>=1A(K)=A(K)—A(K+1)K=K—1ENDDO? A(1),A(2),A(4),A(6)SET TALK ONRETURNA(1)的输出结果为 ______。A.24B.15C.27D.9

【程序】

SET TALK OFF

DIMENSION A(6)

FOR K=1 TO 6

A(K)=30—3*K

ENDFOR

K=5

DO WHILE K>=1

A(K)=A(K)—A(K+1)

K=K—1

ENDDO

? A(1),A(2),A(4),A(6)

SET TALK ON

RETURN

A(1)的输出结果为 ______。

A.24

B.15

C.27

D.9


相关考题:

有以下程序main( ){ int a[4][4]={{1,4,3,2,},{8,6,5,7,},{3,7,2,5,},{4,8,6,1,}},i,k,t;for(i=0;i3;i++)for(k=i+ 1 ;k4;k++) if(a[i][i]a[k][k]){t=a[i][i];a[i][i]=a[k][k];a[k][k]=t;}for(i=0;i4;i++)printf("%d,",a[0][i]);}程序运行后的输出结果是A)6,2,1,1,B)6,4,3,2,C)1,1,2,6,D)2,3,4,6,

下列程序执行后,k的值是 public class TestDemo { public static void main(String args[ ]) { int m=3,n=6,k=0; while((m++)(--n) ) ++k; System.out.println(k); } }A.0B.1C.2D.3

17、以下能够实现计算5!的程序段是()A.int fac=1,k=0; do{ k++; fac*=k;} while(k<5);B.int fac=0,k=1; do{ fac*=k; k++;} while(k<5);C.int fac=1,k=1; do{ k++; fac*=k;} while(k<=5);D.int fac=1,k=0; do{ fac*=k; k++;} while(k<5);

下面能正确计算1*2*3*•••*10的程序段是()A.do{ k=1;n=1;n=n*k;k++; }while(k<=10);B.do{ k=1;n=0;n=n*k;k++; }while(k<=10);C.k=1;n=1; do{ n=n*k;k++; }while(k<=10);D.k=1;n=0; do{ n=n*k;k++; }while(k<=10);

以下能够实现计算5!的程序段是()A.int fac=1,k=0; do{ k++; fac*=k;} while(k<5);B.int fac=0,k=1; do{ fac*=k; k++;} while(k<5);C.int fac=1,k=1; do{ k++; fac*=k;} while(k<=5);D.int fac=1,k=0; do{ fac*=k; k++;} while(k<5);

32、以下能够实现计算5!的程序段是()A.int fac=1,k=0; do{ k++; fac*=k;} while(k<5);B.int fac=0,k=1; do{ fac*=k; k++;} while(k<5);C.int fac=1,k=1; do{ k++; fac*=k;} while(k<=5);D.int fac=1,k=0; do{ fac*=k; k++;} while(k<5);

1、以下能够实现计算5!的程序段是()A.int fac=1,k=0; do{ k++; fac*=k;} while(k<5);‍B.int fac=0,k=1; do{ fac*=k; k++;} while(k<5);C.int fac=1,k=1; do{ k++; fac*=k;} while(k<=5);D.int fac=1,k=0; do{ fac*=k; k++;} while(k<5);

下面代码的输出结果是()。 int k,i; k=456123; i=k%10; while(k!=0) { if(i>k%10) i=k%10; k=k/10; } printf("%dn",i);A.1B.6C.3D.321654

下列程序运行后,k的值是________。 public class Test { public static void main(String[] args) { int m = 3,n = 6,k = 0; while((m++)<(n--)) ++k; System.out.print(k); } }A.0B.1C.2D.3