以下程序中，运行结果是36的有（）。 A: include <stdio.h> B: define M(y) y*y int main() { printf("%d\n",M(6+0)); return 0; } C: include <stdio.h> D: define M(y) (y)*(y) int main() { printf("%d\n",M(6+0)); return 0; } E: include <stdio.h> int M(int y) { return y*y; } int main() { printf("%d\n",M(6+0)); return 0; } F: include <stdio.h> int M(int y) { return (y)*(y); } int main() { printf("%d\n",M(6+0)); return 0; }

程序填空，使下面程序实现输出N！（N&lt;=10000）的最低三位。#include &lt;stdio.h&gt;int main(){int N,M=1;scanf(&quot;%d&quot;,&amp;N);for (int i=1;i&lt;=N;i++){M=M*i;M=__________;}printf(&quot;%03d&quot;,M);return 0;}?

阅读下面程序,则执行后的结果为( ). main( ) { int m=4,n=2,k; k=fun(m,n); printf("%d\n",k); } fun(int m,int n) { return(m*m*m-n*n*n);}

下列程序的输出结果是(). int fun3(int x) { static int a=3; a+=x; return(a); } int main(void) { int k=2,m=1,n; n=fun3(k);n=fun3(m); printf("%d\n",n); return 0; }

下列计算最大公约数的递归过程，正确的是___________。 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