N端规则(N-end rule)
举一反三
- N-端规则(N-end rule)
- 下面程序的输出结果是（ ）。 n = 1 while n < 6: if n == 3: print(" ",end=' ') else: print(n,end=' ') n = n + 1
- 以下程序不正确的是 ( ) A: n=input('n=')switch rem(n,3)case 0; A=3*ncase 2; A=2*ncase 1; A=n end B: n=input('n=')if rem(n,3)==0; A=3*n elseif rem(n,3)==2; A=2*n else A=n end end C: n=input('n=')if rem(n,3)==0; A=3*nelseif rem(n,3)==2; A=2*nelse A=n end D: n=input('n=')switch rem(n,3)case 0; A=3*ncase 2; A=2*notherwise; A=n end
- 下列计算最大公约数的递归过程，正确的是___________。 A: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub B: Sub gcd(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Sub C: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function D: Function gcd%(ByVal m%, ByVal n%) Dim r% r = m Mod n If r = 0 Then gcd = n Else gcd = gcd(n, r) End If End Function
- The end of the Wars of the Roses led to the rule of . ( )