c=a;
if(a>b) c=1; else
if(a==b) c=0; else c=-1; return(c); }
A) £1 B) 0 C) 1 D) 2 34£®ÒÔϳÌÐòµÄÊä³ö½á¹ûΪ£¨ £©¡£ f(int b[ ], int n) {int i, r; r=1;
for(i=0; i<=n; i++) r=r*b[i]; return(r); }
main()
{int x, a[ ]={2,3,4,5,6,7,8,9}; x=f(a, 3);
printf(¡°%d\\n¡±, x); }
A) 720 B) 120 C) 24 35£®ÏÂÁгÌÐòÖ´ÐкóµÄÊä³ö½á¹ûÊÇ£¨ £©¡£ f(int a) {int b=0; static c=3; a=c++, b++; return(a); }
main( )
{int a=2, i, k; for(i=0;i<2;i++) k=f(a++);
printf(¡°%d\\n¡±, k); }
A) 3 B) 0 C) 5 36£®ÏÂÁгÌÐòÖ´ÐкóÊä³öµÄ½á¹ûÊÇ£¨ £©¡£ int d=1; fun(int p) {int d=5; d+=p++;
printf(¡°%d¡±, d); }
main( ) {int a=3;
D) 6D) 4 fun(a); d+=a++;
printf(¡°%d\\n¡±, d); }
A) 84 B) 96 C) 94 D) 85 37£®ÒÔϳÌÐòµÄÊä³ö½á¹ûÊÇ£¨ £©¡£ fun(int k)
{if(k>0) fun(k-1); printf(¡°%d¡±, k); }
main( ) {int w=5; fun(w); }
A) 54321 B) 012345 C) 12345 D) 543210 38£®ÒÔÏÂ˵·¨ÖÐÕýÈ·µÄÊÇ£¨ £©¡£
A) CÓïÑÔ³ÌÐò×ÜÊÇ´ÓµÚÒ»¸ö¶¨ÒåµÄº¯Êý¿ªÊ¼Ö´ÐÐ
B) ÔÚCÓïÑÔ³ÌÐòÖУ¬±»µ÷Óõĺ¯Êý±ØÐëÔÚmain()º¯ÊýÖж¨Òå C) CÓïÑÔ³ÌÐò×ÜÊÇ´Ómain()º¯Êý¿ªÊ¼Ö´ÐÐ
D) CÓïÑÔ³ÌÐòÖеÄmain()º¯Êý±ØÐë·ÅÔÚ³ÌÐòµÄ¿ªÊ¼²¿·Ö 39£®ÒÔϳÌÐòµÄÊä³ö½á¹ûÊÇ£¨ £©¡£ int abc(int u, int v); main()
{int a=24, b=16, c; c=abc (a, b);
printf(¡°%d\\n¡±, c); }
int abc(int u, int v) {int w; while(v)
{w= u%v; u=v; v=w;} return u; }
A) 6 B) 7 C) 8 D) 9 ¶þ Ìî¿ÕÌâ
1£®ÏÂÁгÌÐòµÄÊä³ö½á¹ûÊÇ 5 6 ¡£ int t(int x, int y, int cp, int dp) {cp=x*x+y*y£» dp=x*x-y*y£» }
main( )
{int a=4, b=3, c=5, d=6£» t(a, b, c, d)£»
printf(\ %d\\n\£»
}
2£®ÒÔϳÌÐòµÄÔËÐнá¹ûÊÇ 8£¬17 ¡£ #include
{int k=4, m=1, p;
p=func(k, m); printf(\ p=func(k, m); printf(\}
func(int a, int b) {static int m=0, i=2; i+=m+1; m=i+a+b; return m; }
3£®ÒÔϳÌÐòÊä³öµÄ×îºóÒ»¸öÖµÊÇ 120 ¡£ int ff(int n) {static int f=l; f=f*n; return f; }
main() {int i;
for(i=1;i<=5;i++) printf(\}
4£®ÒÔϺ¯ÊýµÄ¹¦ÄÜÊÇ£ºÇóxµÄy´Î·½£¬ÇëÌî¿Õ¡£ double fun(double x, int y) {int i; double z;
for(i=1, z=x; i 5£®Èô±äÁ¿nÖеÄֵΪ24£¬Ôòprntº¯Êý¹²Êä³ö 5 ÐУ¬×îºóÒ»ÐÐÓÐ 4 ¸öÊý¡£ void prnt(int n, int aa[ ]) {int i; for(i=1; i<=n; i++) {printf(\ if(!(i%5)) printf(\ } printf(\} 6£®ÒÔϳÌÐòÖУ¬Ö÷º¯Êýµ÷ÓÃÁËLineMaxº¯Êý£¬ÊµÏÖÔÚNÐÐMÁеĶþάÊý×éÖУ¬ÕÒ³öÿһÐÐÉϵÄ×î´óÖµ¡£ÇëÌî¿Õ¡£ #define N 3 #define M 4 void LineMax(int x[N][M]) {int i, j, p; for(i=0; i for(j=1; j if(x[i][p] printf(\ x[i][p] ); } } main() {int x[N][M]={1,5,7,4,2,6,4,3,8,2,3,1}; LineMax(x) } 7£®º¯ÊýpiµÄ¹¦ÄÜÊǸù¾ÝÒÔϽüËÆ¹«Ê½Çó¦ÐÖµ£º (¦Ð*¦Ð)/6=1+1/(2*2)+1/(3*3)+ ? +1/(n*n) ÇëÔÚÏÂÃæµÄº¯ÊýÖÐÌî¿Õ£¬Íê³ÉÇó¦ÐµÄ¹¦ÄÜ¡£ #include ¡°math.h¡± double pi(long n) {double s=0.0; long i; for(i=1;i<=n; i++) s=s+ 1.0/i*i ; return(sqrt(6*s)); } 8£®ÉèÔÚÖ÷º¯ÊýÖÐÓÐÒÔ϶¨ÒåºÍº¯Êýµ÷ÓÃÓï¾ä£¬ÇÒfunº¯ÊýΪvoidÀàÐÍ£»Çëд³öfunº¯ÊýµÄÊײ¿ void fun( double b[10][22]) ¡£ÒªÇóÐβÎÃûΪb¡£ main() {double s[10][22]; int n; ? fun(s); ? } 9£®ÊäÈë12ʱ£¬³ÌÐòÊä³ö½á¹ûΪ 12 is not prime number. £»ÈôÊäÈë17£¬Êä³ö½á¹ûΪ 17 is prime number. ¡£ main() {int number; scanf(¡°%d¡±, &number); if(prime(number)) printf(¡°\\n%d is prime number.¡±, number); else printf(¡°\\n%d is not prime number.¡±, number); } int prime(int number) {int flag=1, n;