,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : : : /16 : : 96 : : : ISBN 7

Size: px

Start display at page:

Download "1 2005 9 2005,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : 100081 : : 7871092 1 /16 : 8. 75 : 96 : 2005 11 1 : 2005 11 1 : ISBN 7"

籍世
9 years ago
Views:

2 ,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : : : /16 : : 96 : : : ISBN /TP 8 :

3 ,,,, 1994 NCRE,,, ( ),,,,, ( C + + C JAVA Visual Basic) ( Access Visual FoxPro),, C : l; 2, ; 3, ; 4 C 2004, C : 50 ( ( 1) ( 10) 2, ( 11) ( 50) 1, 60 ), 20 ( 2, 40 ) 30, 10, 5 :,, ( 1 ),,,, ( 2 ),,, ( 3 ),,,,, ( 4 ),,,

4 ( ) 11 ( ) ( ) ( ) ( ) ( ) ( ) ( C ) ( C ) 8 (, 58 )

5 C,,,,,, * * *,, * * *

6 ( 1) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2) A) B) C) D) ( 3) : A) ABCDEF B) DBEAFC C) ABDECF D) DEBFCA ( 4),,, A) B) C) D) ( 5) A) B) C) D) ( 6) A) B) C) D) ( 7), A), B), C) D) ( 8) ( ),, A) B) C) D) ( 9), A) ( 1) 1 ( 11 )

7 B), C), D), ( 10), ( ) A) B) C) D) ( 11), A) C, B), C) C D) C ( 12) a, A) a = A + 20 B) a - = a C) a = c + d D) a = c + d ( 13) # include < stdio. h > {int i = 010, j = 10; printf( " % d, % d", ++ i, j - - ) ; A) 11, 10 B) 9, 10 C) 010, 9 D) 10, 9 ( 14) C A) void define WORD B) a3_b3_123 IF C) for - - abc case D) 2a D0 sizeof ( 15)? A) a ++ ; B) a == b; C) a += b; D) a = 1, b = 1; ( 16) : int a = 8, b = 5, c; c = a / b ;, c A) 1. 4 B) 1 C) 2. 0 D) 2 ( 17) a int, : a = A ; A) a C B) a C) D) a A ASCII 1 ( 18) int a = 1234; printf( % 2d \ n, a) ; A) 12 B) 34 C) 1234 D) ( 19) C A) signed short int B) unsigned long int C) unsigned int D) long short ( 20) : int a, b, c, * d = &c; a b c A) scanf( % d% d% d, &a, &b, d) ; B) scanf( % d% d% d, &a, &b, &d) ; C) scanf( % d% d% d, a, b, d) ; D) scanf( % d% d% d, a, b, * d) ; ( 21) 16 C, long a;, a A) a = ; B) a = 4000* 10; C) a = ; D) a = 4000L* 10L; ( 22) A) define if B) define, if ( 1) 2 ( 11 )

$6; A) a C B) a C) D) a A ASCII 1 ( 18) int a = 1234; printf( % 2d \ n, a) ; A) 12 B) 34 C) 1234 D) ( 19) C A) signed short int B) unsigned long int C) unsigned int D) long short ( 20) : int a, b, c,$

8 C) if, define D) define if ( 23) : int a = 511, * b = &a; printf( % d \n, * b) ; A) B) a C) 512 D) 511 ( 24) { int a = 5, b = 4, c = 6, d; printf( ( % d \ n, d = a > b? ) ( a > c? a: c) : ( b) ) ; A) 5 B) 4 C) 6 D) ( 25), while { int i = 0; while ( i < 10) { if( i < 1) continue; if( i == 5) break; i ++ ; A) 1 B) 10 C) 6 D), ( 26) { int a = 0, i; for( i = 1; i < 5; i ++ ) { switch( i) { case 0: case 3: a += 2; case 1: case 2: a += 3; default: a += 5; printf( % d \ n, a) ; A) 31 B) 13 C) 10 D) 20 ( 27) { int a = 4, b = 5, c = 0, d; d =! a&&! b! c; printf( % d \ n, d) ; ( 1) 3 ( 11 )

$( 26) { int a = 0, i; for( i = 1; i < 5; i ++ ) { switch( i) { case 0: case 3: a += 2; case 1: case 2: a += 3; default: a += 5; printf( % d \ n,$

9 A) 1 B) 0 C) 0 D) - 1 ( 28) #include < stdio. h > { int i = 0, a = 0; while ( i < 20) { for( ; ; ) { if( ( i% 10) == 0) break; else i - - ; i += 11; a += i; printf( % d \ n, a) ; A) 21 B) 32 C) 33 D) 11 ( 29 ) char cchar( char ch) { if( ch >= A&&ch <= Z ) ch = ch - A + a ; return ch; { char s[ ] = " ABC + abc = defdef", * p = s; while( * p) { * p = cchar( * p) ; p ++ ; printf( % s\ n, s) ; A) abd + ABC = DEFdef B) abc + abc = defdef C) abcabcdefdef D) abcabcdefdef ( 30 ) int f( ) { static int i = 0; int s = 1 ; s += i; i ++ ; return s; ( 1) 4 ( 11 )

$p = s; while( * p) { * p = cchar( * p) ; p ++ ; printf( % s\ n, s) ; A) abd + ABC = DEFdef B) abc + abc = defdef C) abcabcdefdef D)$

10 { int i, a = 0 ; for( i = 0; i < 5; i ++ ) a += f( ) ; printf( % d \ n, a) ; A) 20 B) 24 C) 25 D) 15 ( 31 ) char s[ ] = \ \141 \141 abc \ t ; printf( % d \ n, strlen( s) ) ; A) 9 B) 12 C) 13 D) 14 ( 32 ) #include < stdio. h > void f( int n) ; { void f( int n) ; f( 5) ; void f( int n) { printf( % d \ n, n) ; A) f, f B) f, f C), ; f D) f, void ( 33 ) findmax findmax( int * a, int n) { int * p, * s; for ( p = a, s = a; p - a < n; p ++ ) if( ) s = p; return( * s) ; { int x[ 5] = {12, 21, 13, 6, 18 ; ( 1) 5 ( 11 )

$h > void f( int n) ; { void f( int n) ; f( 5) ; void f( int n) { printf( % d \ n, n) ; A) f, f B) f, f C), ; f D) f, void ( 33 )$

11 printf( % d \ n, findmax( x, 5) ) ; A) p > s B) * p > * s C) a[ p] > a[ s] D) p - a > p - s ( 34 ) { char ch[ 3 ] [ 5] = { AAAA, BBB, CC ; printf( \ % s \n, ch[ 1] ) ; A) AAAA B) BBB ( 35 ) C, C) BBBCC ( 1) 6 ( 11 ) D) CC A) auto B) register C) static D) extern ( 36 ) p, p, A) p = 2* ( int * ) malloc( sizeof( int) ) ; B) p = ( int * ) malloc( 2* sizeof( int) ) ; C) p = ( int * ) malloc( 2* 2) ; D) p = ( int * ) malloc( 2, sizeof( int) ) ; ( 37 ) { char x = 040; printf( % o \ n, x << 1) ; A) 100 B) 80 C) 64 D) 32 ( 38 ) A user abc. txt, A) fopen( A: \ user \ abc. txt, r ) B) fopen( A: \ \ user \ \abc. txt, r + ) C) fopen( A: \ user \abc. txt, rb ) D) fopen( A: \ \user \ \ abc. txt, w ) ( 39 ) A) char str[ 5] = good! ; B) char str[ ] = good! ; C) char * str = good! ; D) char str[ 5] = { g, o, o, d ; ( 40 ) : struct test { int ml; char m2; float m3; union uu{ char ul[ 5] ; int u2 [ 2] ; ua; myaa; sizeof( struct test) A) 12 B) 16 C) 14 D) 9

$; D) p = ( int * ) malloc( 2, sizeof( int) ) ; ( 37 ) { char x = 040; printf( % o \ n, x << 1) ; A) 100 B) 80 C) 64 D) 32 ( 38 ) A user abc. txt, A) fopen( A: \ user \ abc.$

12 ( 41 ) : int aa[ 8 ] ; aa[ 1] A) &aa[ 0] + 1 B) &aa[ 1] C) &aa[ 0] ++ D) aa + 1 ( 42 ) f( int b[ ], int m, int n) { int i, s = 0 ; for ( i = m; i < n; i = i + 2) s = s + b[ i] ; return s; { int x, a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9 ; x = f( a, 3, 7) ; printf( % d \ n, x) ; A) 10 B) 18 C) 8 D) 15 ( 43 ) : int s[ 4 ] [ 5], ( * ps) [ 5] ; ps = s; s A) ps + 1 B) * ( ps + 3) C) ps[ 0] [ 2 ] D) * ( ps + 1) + 3 ( 44) { int b[ 3] [ 3] = {0, 1, 2, 0, 1, 2, 0, 1, 2, i, j, t = 1; for ( i = 0; i < 3; i ++ ) for( j = i; j <= i; j ++ ) t = t + b[ i] [ b[ j] [ j] ] ; printf( % d \ n, t) ; A) 3 B) 4 C) 1 D) 9 ( 45) #include < stdio. h > #include < string. h > { char b1[ 8] = abcdefg, b2[ 8], * pb = b1 + 3; while( - - pb >= b1) strcpy( b2, pb) ; printf( % d \ n, strlen( b2) ) ; A) 8 B) 3 C) 1 D) 7 ( 1) 7 ( 11 )

$1) + 3 ( 44) { int b[ 3] [ 3] = {0, 1, 2, 0, 1, 2, 0, 1, 2, i, j, t = 1; for ( i = 0; i < 3; i ++ ) for( j = i; j <= i; j ++ ) t = t + b[ i] [ b[ j] [ j] ] ; printf( % d \ n, t) ; A) 3 B) 4 C) 1 D) 9$

13 ( 46) : int * f( ) ;, f A) B) C) D) ( 47) main A) main ( int a, char * c[ ] ) B) main( int arc, char * * arv) C) main ( int argc, char * argv) D) main( int argv, char * argc[ ] ) ( 48) int x = 3; { int i; for( i = 1; i < x; i ++ ) incre( ) ; incre( ) { static int x = 1; x* = x + 1; printf( % d, x) ; A) 3 3 B) 2 2 C) 2 6 D) 2 5 ( 49) : struct link { int data; struct link * next; a, b, c, * p, * q; a b : a b data next data next 5 p 9 \0 c data next 7 q ( 1) 8 ( 11 )

$link { int data; struct link * next; a, b, c, * p, * q; a b : a b data next data next 5 p 9 \0 c data next 7 q ( 1)$

14 p a, q cc a b A) a. next = c; c. next = b; B) p. next = q; q. next = p. next; C) p - > next = &c; q - > next = p - > next; D) ( * p). next = q; ( * q). next = &b; ( 50) typedef struct { int n; char ch[ 8] ; PER; A) PER B) PER C) typedef struct D) struct ( 2, 40 ) 120, ( 1) 1 ( 2),, 2 ( 3) 3 ( 4),,,, 4 ( 5) 5 ( 6) 58, 6 { int a; scanf( % d, &a) ; if( a > 50) printf( % d, a) ; if( a > 40) printf( % d, a) ; if( a > 30) printf( % d, a) ; ( 7) 7 { int a = 177; printf( % o\ n, a) ; ( 8) 8 { int a = 0; a += ( a = 8) ; printf( % d \ n, a) ; ( 1) 9 ( 11 )

next = &b; ( 50) typedef struct { int n; char ch[ 8] ; PER; A) PER B) PER C) typedef struct D) struct ( 2, 40 ) 120, ( 1) 1 ( 2),, 2 ( 3)

15 ( 9) 9 { int a = 5, b = 4, c = 3, d; d = ( a > b > c) ; printf( % d \ n, d) ; ( 10), info ; link struct node { int info; ; 10link; ( 11) 11 { int s, i; for( s = 0, i = 1; i < 3; i ++, s += i) ; printf( % d \ n, s) ; ( 12) 12 { char * p = abcdefgh, * r; long * q; q = ( long * ) p; q ++ ; r = ( char * ) q; printf( % s \ n, r) ; ( 13) 13 { char s[ ] = abcdef ; s[ 3] = \0 ; printf( % s \ n, s) ; ( 14) 14 { int x = 0; sub( &x, 8, 1) ; printf( % d \ n, x) ; ( 1) 10 ( 11 )

$* p = abcdefgh, * r; long * q; q = ( long * ) p; q ++ ; r = ( char * ) q; printf( % s \ n, r) ; ( 13) 13 { char s[ ]$

16 sub( int * a, int n, int k) { if( k <= n) sub( a, n /2, 2* k) ; * a += k; ( 15) #define MYSWAP( z, x, y) {z = x; x = y; y = z; a b, float a = 5, b = 16, c; MYSWAP( 15, a, b) ; ( 16) #include stadio. h { FILE * fp; long num = 0L; if( ( fp = fopen( fname. dat, r ) ) == NULL) ; { printf( Open error \ n ) ; exit( 0) ; while( 16) { fgetc( fp) ; num ++ ; printf( num = % 1d \ n, num - 1) ; fclose( fp) ; ( 17), select : N M,, #define N 3 #define M 3 select( int a[ N] [ M], int * n) { int i, j, row = 1, colum = 1; for( i = 0; i < N; i ++ ) for( j = 0; j < M; j ++ ) if( a[ i] [ j] > a[ row] [ colum] ) { row = i; colum = j; * n = 17; return( 18) ; { int a[ N] [ M] = {9, 11, 23, 6, 1, 15, 9, 17, 20, max, n; max = select( a, &n) ; printf( max = % d, line = % d \ n, max, n) ; ( 18) mystrlen str, int mystrlen( char * str) { int i; for( i = 0; 19! = \0 ; i ++ ) ; return( 20) ; ( 1) 11 ( 11 )

$dat, r ) ) == NULL) ; { printf( Open error \ n ) ; exit( 0) ; while( 16) { fgetc( fp) ; num ++ ; printf( num = % 1d \ n, num - 1) ; fclose( fp) ; ( 17), select : N M,, #define N 3 #define M 3 select($

17 C,,,,,, * * *,, * * *

18 ( 2) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) DBEAFC C) ABDECF D) DEBFCA ( 4),, A) B) GOTO C) D) ( 5), A) B) C) D) ( 6) A) B) C) D) ( 7) A) B) C) D) ( 8) A) B) C) D) ( 9) E - R, : E - R, E - R, E - R ( ), E - R A) B) C) D) ( 10) 4, ( 2) 1 ( 11 )

19 A) B) C) D) ( 11) A) C B) C) D) ( 12) A) 5E2. 0 B) E - 3 C) 2E0 D) 1. 3E ( 13) A) long B) 2Test C) 3Dmax D) A. dat ( 14) A ASCII 65, a ASCII 97, \101 A) A B) a C) e D) ( 15) A) n = ( i = 2, ++ i) ; B) j ++ ; C) ++ ( i + 1) ; D) x = j > 0; ( 16) a b double, a = 5. 5 b = 2. 5, ( int) a + b / b A) B) 6 C) D) ( 17) i j k int, : 1, 2, 3 < >, i 1 j 2 k 3, A) scanf( % 2d% 2d% 2d, &i, &j, &k) ; B) scanf( % d % d % d, &i, &j, &k) ; C) scanf( % d, % d, % d, &i, &j, &k) ; D) scanf( i = % d, j = % d, k = % d, &i, &j, &k) ; ( 18) 3xn C 2x - 1 A) 3* x^n / ( 2* x - 1) B) 3* x* * n / ( 2* x - 1) C) 3* pow( x, n) * ( 1 /( 2* x - 1) ) D) 3* pow( n, x) / ( 2* x - 1) ( 19) : long x = L;, x A) printf( x = % d \ n, x) ; B) printf( x = % 1d \ n, x) ; C) printf( x = % 8dL \n, x) ; D) printf( x = % LD\ n, x) ; ( 20) : { int k = 2, i = 2, m; m = ( k += i* = k) ; printf( % d, % d \ n, m, i) ; A) 8, 6 B) 8, 3 C) 6, 4 D) 7, 4 ( 21) : int x = 3, y = 4, z = 5,! ( x + y) + z - 1 && y + z /2 A) 6 B) 0 C) 2 D) 1 ( 22) : y = 1 x > 0 0 x = 0, x y - 1 x < 0 A) if( x > 0) y = 1; B) y = 0; else if( x == 0) y = 0; if( x > 0) y = 1; else y =- 1; else if( x < 0) y =- 1; C) y = 0; D) if( x >= 0) if( x >= 0) if( x > 0) y = 1; ( 2) 2 ( 11 )

20 if( x > 0) y = 1; else y = 0; else y =- 1; else y =- 1; ( 23), k = n ++ A) k = n, n = n + 1 B) n = n + 1, k = n C) k = ++ n D) k + = n + 1 ( 24) : 10 4,, : { int n, k; float score, sum, ave; sum = 0. 0; for( n = 1; n <= 10; n ++ ) { for( k = 1; k <= 4; k ++ ) { scanf( % f, &score) ; sum += score; ave = sum/ 4. 0; printf( NO% d: % f\ n, n, ave) ;, A) sum = 0. 0; B) sum += score; C) ave = sum /4. 0; D) printf( NO% d: % f\ n, n, ave) ; ( 25) : int n = 0, p; do{ scanf( % d, &p) ; n ++ ; while( p! = && n < 3) ; do - while A) p n 3 B) p n 3 C) p n 3 D) p n 3 ( 26) { int a = 15, b = 21, m = 0; switch( a% 3) { case 0: m ++ ; break; case 1: m ++ ; switch( b% 2) { default: m ++ ; case 0: m ++ ; break; printf( % d \ n, m) ; A) 1 B) 2 C) 3 D) 4 ( 27) C,, A) void B) int C) float D) double ( 28) : int n = 2, * p = &n, * q = p;, ( 2) 3 ( 11 )

$0; D) printf( NO% d: % f\ n, n, ave) ; ( 25) : int n = 0, p; do{ scanf( % d, &p) ; n ++ ; while( p!$

21 A) p = q; B) * p = * q; C) n = * q; D) p = n; ( 29) float fun( int x, int y) {return( x + y) ; { int a = 2, b = 5, c = 8; printf( % 3. 0f\ n, fun( ( int) fun( a + c, b), a - c) ) ; A) B) 9 C) 21 D) 9. 0 ( 30) void fun( char * c, int d) { * c = * c + 1; d = d + 1; printf( % c, % c, * c, d) ; { char a = A, b = a ; fun( &b, a) ; printf( % c, % c \ n, a, b) ; A) B, a, B, a B) a, B, a, B C) A, b, A, b D) b, B, A, b ( 31) sort a void sort( int a[ ], int n) { int i, j, t; for( i = 0; i < n - 1; i ++ ) for( j = i + 1; j < n; j ++ ) if( a[ i] < a[ j] ) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; sort( &aa[ 3], 5) ; for( i = 0; i < 10; i ++ ) printf( % d, aa[ i] ) ; printf( \n ) ; A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 C) 1, 2, 3, 8, 7, 6, 5, 4, 9, 10 D) 1, 2, 10, 9, 8, 7, 6, 5, 4, 3 ( 32) int f( int n) { if( n == 1) return 1; else return f( n - 1) + 1; ( 2) 4 ( 11 )

22 { int i, j = 0; for( i = 1; i < 3; i ++ ) j += f( i) ; printf( % d \ n, j) ; A) 4 B) 3 C) 2 D) 1 ( 33) { char a[ ] = { a, b, c, d, e, f, g, h, \0 ; int i, j; i = sizeof( a) ; j = strlen( a) ; printf( % d, % d \ n, i, j) ; A) 9, 9 B) 8, 9 C) 1, 8 D) 9, 8 ( 34) reverse a void reverse( int a[ ], int n) { int i, t; for( i = 0; i < n /2; i ++ ) { t = a[ i] ; a[ i] = a[ n i] ; a[ n i] = t; { int b[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10; int i, s = 0; reverse( b, 8) ; for( i = 6; i < 10; i ++ ) s += b[ i] ; printf( % d \ n, s) ; A) 22 B) 10 C) 34 D) 30 ( 35) { int aa[ 4] [ 4] = { {1, 2, 3, 4, {5, 6, 7, 8, {3, 9, 10, 2, {4, 2, 9, 6 ; int i, s = 0; for( i = 0; i < 4; i ++ ) s += aa[ i] [ 1] ; printf( % d \ n, s) ; A) 11 B) 19 C) 13 D) 20 ( 36) #include < string. h > { char * p = abcde \0fghjik \0 ; printf( % d \ n, strlen( p) ) ; ( 2) 5 ( 11 )

23 A) 12 B) 15 C) 6 D) 5 ( 37) type1. h : #define N 5 #define M1 N* 3 : #include type1. h #define M2 N* 2 { int i; i = M1 + M2; printf( % d \ n, i) ; : A) 10 B) 20 C) 25 D) 30 ( 38) #include < stdio. h > { FILE * fp; int i = 20, j = 30, k, n; fp = fopen( d1. dat, w ) ; fprintf( fp, % d \ n, i) ; fprintf( fp, % d \ n, j) ; fclose( fp) ; fp = fopen( d1. dat, r ) ; fscanf( fp, % d% d, &k, &n) ; printf( % d% d \ n, k, n) ; fclose( fp) ; A) B) C) D) ( 39) A), B), fclose C) fread, D) FILE ( 40) #include < string. h > main( int argc, char * argv[ ] ) { int i, len = 0; for( i = 1; i < argc; i ++ ) len += strlen( argv[ i] ) ; printf( % d \ n, len) ; exl. exe, : ex1 abcd efg 10 < > A) 22 B) 17 C) 12 D) 9 ( 2) 6 ( 11 )

24 ( 41) int fa( int x) { return x* x; int fb( int x) { return x* x* x; int f( int ( * f1) ( ), int ( * f2) ( ), int x) { return f2( x) - f1( x) ; { int i; i = f( fa, fb, 2) ; printf( % d \ n, i) ; A) - 4 B) 1 C) 4 D) 8 ( 42) int a = 3; { int s = 0; { int a = 5; s += a ++ ; s += a ++ ; printf( % d \ n, s) ; A) 8 B) 10 C) 7 D) 11 ( 43) void ss( char * s, char t) { while ( * s) { if( * s == t) * s = t - a + A ; s ++ ; { char str1[ 100] = abcddfefdbd, c = d ; ss( str1, c) ; printf( % s \ n, str1) ; A) ABCDDEFEDBD B) abcddfefdbd C) abcaafefaba D) Abcddfefdbd ( 44) struct STU { char num[ 10] ; float score[ 3] ; ; { struct STU s[ 3] = {{ 20021, 90, 95, 85, int i; float sum = 0; { 20022, 95, 80, 75, { 20023, 100, 95, 90, * p = s; ( 2) 7 ( 11 )

25 for( i = 0; i < 3; i ++ ) sum = sum + p - > score[ i] ; printf( % 6. 2f\ n, sum) ; A) B) C) D) ( 45) : struct sk { int a; float b; data; int * p; p data a, A) p = &a; B) p = data. a; C) p = &data. a; D) * p = data. a; ( 46) #include < stdlib. h > struct NODE { int num; struct NODE * next; ; { struct NODE * p, * q, * r; p = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; q = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; r = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; p - > num = 10; q - > num = 20; r - > num = 30; p - > next = q; q - > next = r; printf( % d \ n, p - > num + q - > next - > num) ; A) 10 B) 20 C) 30 D) 40 ( 47) typedef int * INTEGER; INTEGER p, * q; A) p int B) p int C) q int D) INTEGER int ( 48) { unsigned char, a, b, c; a = 0x3; b = a 0x8; c = b < < 1; printf( % d % d \ n, b, c) ; A) B) C) D) ( 2) 8 ( 11 )

26 ( 49) #include < stdlib. h > { char * p, * q; p = ( char * ) malloc( sizeof( char) * 20) ; q = p; scanf( % s% s, p, q) ; printf( % s % s \n, p, q) ; : abc def < >, A) def def B) abc def C) abc d D) d d ( 50) f n #include < string. h > void f( char p[ ] [ 10], int n) { char t[ 20] ; int i, j; for( i = 0; i < n - 1; i ++ ) for( j = i + 1; j < n; j ++ ) if( strcmp( p[ i], p[ j] ) < 0) {strcpy( t, p[ i] ) ; strcpy( p[ i], p[ j] ) ; strcpy( p[ j], t) ; { char p[ ] [ 10] = { abc, aabdfg, abbd, dcdbe, cd ; int i; f( p, 5) ; printf( % d \ n, strlen( p[ 0] ) ) ; A) 6 B) 4 C) 5 D) 3 ( 2, 40 ) 120, ( 1), 1 ( 2) 6 2 ( 3) 3 ( 4) -, 4- ( 5),,,, 5 ( 6) : int n, * k = &n; k n, scanf( % d, 6) ; printf( % d \ n, 7) ; ( 7) 8 { int x = 10, y = 20, t = 0; if( x == y) t = x; x = y; y = t; printf( % d, % d \n, x, y) ; ( 8) 9 ( 2) 9 ( 11 )

27 { int x = 15; while( x > 10&& x < 50) { x ++ ; if( x /3) { x ++ ; break; else continue; printf( % d \ n, x) ; ( 9) : #include < stdio. h > { char c; while( ( c = getchar( ) )! =? ) putchar( - - c) ;, : Y? N? ( 10) 11 void fun( int x, int y) { x = x + y; y = x - y; x = x - y; printf( % d, % d, x, y) ; { int x = 2, y = 3; fun( x, y) ; printf( % d, % d \ n, x, y) ; < >, 10 ( 11) S = ! + 1 3! n!, double fun( int n) { double s = 0. 0, fac = 1. 0; int i; for ( i = 1; i <= n; i ++ ) return s; { fac = fac 12; s = s + fac; ( 12) fun : a N N,, N #include < stdio. h > #define N 100 int fun( int( * a) [ N] ) { int row, col, max, min; for( row = 0; row < N; row ++ ) { for( max = a[ row] [ 0], col = 1; col < N; col ++ ) if( 13) max = a[ row] [ col] ; ( 2) 10 ( 11 )

28 return min; if( row == 0) min = max; else if( 14) min = max; ( 13) sstrcmp( ) s t, 0; s t, 0; s t, 0 ( strcmp( ) ) #include < stdio. h > int sstrcmp( char * s, char * t) { while( * s&&* t&& * s == 15) { s ++ ; t ++ ; return 16; ( 14) : 17 #define N 10 #define s( x) x* x #define f( x) ( x* x) { int i1, i2; i1 = 1000 / s( N) ; i2 = 1000 / f( N) ; printf( % d % d \ n, i1, i2) ; ( 15) : 18 void swap( int * a, int * b) { int * t; t = a; a = b; b = t; { int x = 3, y = 5, * p = &x, * q = &y; swap( p, q) ; printf( % d% d \ n, * p, * q) ; ( 16) : 19 typedef union student { char name[ 10] ; long sno; char sex; float score[ 4] ; STU; { STU a[ 5] ; printf( % d \ n, sizeof( a) ) ; ( 17) fp, d1. dat,, : fp = fopen ( 20) ; ( 2) 11 ( 11 )

29 C,,,,,, * * *,, * * *

30 ( 3) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1), A) B) C) D) ( 2) A) B) C) D) ( 3) 5, A) 32 B) 31 C) 16 D) 15 ( 4) A) B) C) D) ( 5)? A) B) C) D) ( 6) A) B) C) D) ( 7), A) B) C) D) ( 8), A) B) C) D) ( 9) ( ) A) B) C) D) ( 10), A) B) C) D) ( 11) A) C B) C C) C D) C, ( 12) C A) B) if switch break C) for while do - while D) if for continue ( 3) 1 ( 11 )

31 ( 13) C A) main B) main C) main D) main ( 14) A) C B) C C) C D) C ( 15) C A) ( ) B), C), D), ( 16) ( n ) int m = 32767, n = ; printf( % d, % o\ n, m, n) ; A) 32767, B) 32767, C) 32767, D) 32767, ( 17) A) B) char int, float C) int, double float D) char int float ( 18) int m = 0xabc, n = 0xabc; m - = n; printf( % X\ n, m) ; A) 0X0 B) 0x0 C) 0 D) 0XABC ( 19) int m = 0, n = 0; char c = a ; scanf( % d% c% d, &m, &c, &n) ; printf( % d, % c, % d \ n, m, c, n) ; : 10A10 < >, A) 10, A, 10 B) 10, a, 10 C) 10, a, 0 D) 10, A, 0 ( 20) { int i; for ( i = 0; i < 3; i ++ ) switch ( i) { case 1: printf( % d, i) ; case 2: default: printf( % d, i) ; printf( % d, i) ; A) B) 012 C) D) 120 ( 21) ( 3) 2 ( 11 )

32 { int i = 1, j = 1, k = 2; if ( ( j ++ k ++ ) &&i ++ ) printf( % d, % d, % d \ n, i, j, k) ; A) 1, 1, 2 B) 2, 2, 1 C) 2, 2, 2 D) 2, 2, 3 ( 22) { int a = 5, b = 4, c = 3, d = 2; if( a > b > c) printf( % d \ n, d) ; else if( ( c - 1 >= d) = = 1) else printf( % d \ n, d + 1) ; printf( % d \ n, d + 2) ; A) 2 B) 3 C) 4 D), ( 23) { int p[ 7] = {11, 13, 14, 15, 16, 17, 18, i = 0, k = 0; while( i < 7&&p[ i] % 2) { k = k + p[ i] ; i ++ ; printf( % d \ n, k) ; A) 58 B) 56 C) 45 D) 24 ( 24) { int i = 0, s = 0; do { if( i% 2) { i ++ ; continue; i ++ ; s += i; while( i < 7) ; printf( % d \ n, s) ; A) 16 B) 12 C) 28 D) 21 ( 25) { int i = 10, j = 1; printf( % d, % d \ n, i - -, ++ j) ; A) 9, 2 B) 10, 2 C) 9, 1 D) 10, 1 ( 3) 3 ( 11 )

33 ( 26) { char a, b, c, * d; a = \ ; b = \ xbc ; c = \ 0xab ; d = \0127 ; printf( % c % c % c% c \ n, a, b, c, * d) ;, A) a = \ ; B) b = \ xbc ; C) d = \0127 ; D) a = \ ; c = \0xab ; ( 27) int fl( int x, int y) { return x > y? x: y; int f2( int x, int y) { return x > y? y: x; { int a = 4, b = 3, c = 5, d, e, f; d = f1( a, b) ; d = f1( d, c) ; e = f2( a, b) ; e = f2( e, c) ; f = a + b + c - d - e; printf( % d, % d, % d \ n, d, f, e) ; A) 3, 4, 5 B) 5, 3, 4 C) 5, 4, 3 D) 3, 5, 4 ( 28) void f( int x, int y) { int t; if( x < y) { t = x; x = y; y = t; { int a = 4, b = 3, c = 5; f( a, b) ; f( a, c) ; f( b, c) ; printf( % d, % d, % d \ n, a, b, c) ; A) 3, 4, 5 B) 5, 3, 4 C) 5, 4, 3 D) 4, 3, 5 ( 29) #include < stdio. h > int a = 4, b = 3, * p, * q, * w; p = &a; q = &b; w = q; q = NULL; A) * q = 0; B) w = p; C) * p = a; D) * p = * w; ( 30) int * f( int * x, int * y) { if( * x < * y) return x; ( 3) 4 ( 11 )

34 else return y; { int a = 7, b = 8, * p, * q, * r; p = &a; q = &b; r = f( p, q) ; printf( % d, % d, % d \ n, * p, * q, * r) ; A) 7, 8, 8 B) 7, 8, 7 C) 8, 7, 7 D) 8, 7, 8 ( 31) { char * s[ ] = { one, two, three, * p; p = s[ 1] ; printf( % c, % s \ n, * ( p + 1), s[ 0] ) ; A) n, two B) t, one C) w, one D) o, two ( 32) { int x[ 8] = {8, 7, 6, 5, 0, 0, * s; s = x + 3; printf( % d \ n, s[ 2] ) ; A) B) 0 C) 5 D) 6 ( 33) A) int N = 5, b[ N] [ N] ; B) int a[ 1] [ 2] = {{1, {3 ; C) int c[ 2] [ ] = {{1, 2, 3, 4 ; D) int d[ 3] [ 2] = { {1, 2, {34 ; ( 34) { int m[ ] [ 3] = {1, 4, 7, 2, 5, 8, 3, 6, 9; int i, j, k = 2; for( i = 0; i < 3; i ++ ) { printf( % d, m[ k] [ i] ) ; A) B) C) D) ( 35) :, #define N 10 void arrin( int x[ N] ) { int i = 0; while( i < N) scanf( % d, ) ; ( 3) 5 ( 11 )

35 A) x + i B) &x[ i + 1] C) x + ( i ++ ) D) &x[ ++ i] ( 36) { char s[ ] = \ n123 \ \ ; printf( % d, % d \ n, strlen( s), sizeof( s) ) ; A) B) 6, 7 C) 5, 6 D) 6, 6 ( 37) fun( char * s1, char * s2) { int i = 0; while ( s1[ i] == s2[ i] && s2[ i]! = \0 ) i ++ ; return ( s1[ i] == \0 && s2[ i] == \0 ) ; A) s2 s1 B) s1 s2, s1 s2, 1, 0 C) s1 s2,, 1, 0 D) s1 s2, s1 s2, 1, 0 ( 38) A) B) ( static) C) D) auto static ( 39) typedef struct { int n; char c; double x; STD;, A) STD tt[ 2] = {{1, A, 62, {2, B, 75 ; B) STD tt[ 2] = {1, A, 62, 2, B, 75 ; C) struct tt[ 2] = {{1, A, {2, B ; D) struct tt[ 2] = {{1, A, 62. 5, {2, B, ; ( 40) { union { unsigned int n; unsigned char c; ul; u1. c = A ; printf( % c \ n, u1. n) ; A) B) C) A D) 65 ( 41) { char str[ ] = xyz, * ps = str; while( * ps) ps ++ ; for( ps - - ; ps - str >= 0; ps - - ) puts( ps) ; ( 3) 6 ( 11 )

36 A) yz B) z C) z D) x xyz yz yz xy ( 42) { int a[ ] [ 3] = { {1, 2, 3, {4, 5, 0, ( * pa) [ 3], i; pa = a; for ( i = 0; i < 3; i ++ ) if( i < 2) pa[ 1] [ i] = pa[ 1] [ i] - 1; else pa[ 1] [ i] = 1; printf( % d \ n, a[ 0] [ 1] + a[ 1] [ 1] + a[ 1] [ 2] ) ; xyz xyz A) 7 B) 6 C) 8 D) ( 43) void fun( int * a, int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; fun( a, ++ i, - - j) ; { int a[ ] = {1, 2, 3, 4, 5, 6, i; fun( a, 0, 5) ; for ( i = 0; i < 6; i ++ ) printf( % d, a[ i] ) ; A) B) C) D) ( 44) main( int argc, char * argv[ ] ) { int n, i = 0; while( argv[ 1] [ i]! = \0 ) { n = fun( ) ; i ++ ; printf( % d \ n, n* argc) ; int fun( ) { static int s = 0; s += 1; return s; exam. exe, exam 123 < > ( 3) 7 ( 11 )

37 A) 6 B) 8 C) 3 D) 4 ( 45), fun, main p A) B) { int * p; { int * p; fun( p) ; fun( &p) ; int fun( int * p) int fun( int * * p) { int s; p = &s; { int s; * p = &s; C) #include < stdlib. h > D) #include < stdlib. h > { int * p; { int * p; fun( &p) ; fun( p) ; int fun( int * * p) int fun( int * p) { * p = ( int* ) malloc( 2) ; { p = ( int* ) malloc( sizeof( int) ) ; ( 46) STP, STP s; char * s; A) typedef STP char * s B) typedef * char STP; C) typedef STP * char; D) typedef char * STP; ( 47) struct ss { char name[ 10] ; int age; char sex; std[ 3], * p = std; A) scanf( % d, &( * p). age) ; B) scanf( % s, &std. name) ; C) scanf( % c, &std[ 0]. sex) ; D) scanf( % c, &( p - > sex) ) ; ( 48) char x , ( 2 + x) ^( 3) A) B) C) D) ( 49) A) C ASCII B) C C) C, D) C, ( 50) abc. txt, #, #include < stdio. h > { FILE * fout; char ch; fout = fopen( abc. txt, w ) ; ch = fgetc( stdin) ; while( ch! = # ) { fputc( ch, fout) ; ( 3) 8 ( 11 )

38 ch = fgetc( stdin) ; fclose( fout) ; A) fopen B) C) fgetc D) stdin ( 2, 40 ) 120, ( 1) 1 ( 2) 2 ( 3),, 3 ( 4) 4 : 4 ( 5),, 5 ( 6) int i =- 19, j = i% 4; printf( % d \ n, j) ; 6 ( 7) { int i, j; scanf( i = % d, j = % d, &i, &j) ; printf( i = % d, j = % d \ n, i, j) ; i 10, j 20, 7 ( 8) { int p, a = 5; if( p = a! = 0) else printf( % d \ n, p) ; printf( % d \n, p + 2) ; 8 ( 9) { int a = 4, b = 3, c = 5, t = 0; if( a < b) t = a; a = b; b = t; if( a < c) t = a; a = c; c = t; printf( % d% d% d \ n, a, b, c) ; 9 ( 10) ( 3) 9 ( 11 )

39 { int a[ 4] [ 4] = { {1, 2, - 3, - 4, {0, - 12, - 13, 14, { - 21, 23, 0, - 24, { - 31, 32, - 33, 0 ; int i, j, s = 0; for( i = 0; i < 4; i ++ ) { for( j = 0; j < 4; j ++ ) { if( a[ i] [ j] < 0) continue; if ( a[ i] [ j] == 0) break; s += a[ i] [ j] ; printf( % d \ n, s) ; 10 ( 11) { char a; a = H - A + 0 ; printf( % c \ n, a) ; 11 ( 12) int f( int x, int y) { return( y - x) * x; { int a = 3, b = 4, c = 5, d; d = f( f( 3, 4), f( 3, 5) ) ; printf( % d \ n, d) ; 12 ( 13) YangHui, : ( 1) 0 1 ( 2) ( 3) 1 #define N 6 void YangHui( int x[ N] [ N] ) { int i, j; x[ 0] [ 0] = 1; for( i = 1; i < N; i ++ ) { x[ i] [ 0] = 13= 1; ( 3) 10 ( 11 )

40 for ( j = 1; j < i; j ++ ) x[ i] [ j] = 14; ( 14) s void dele( char * s) { int n = 0, i; for( i = 0; s[ i] ; i ++ ) if( 15) s[ n ++ ] = s[ i] ; s[ n] = 16; ( 15) findbig 3 findbig { int findbig( int, int, int) ; int ( * f) ( ), x, y, z, big; f = 17; scanf( % d% d% d, &x, &y, &z) ; big = ( * f) ( x, y, z) ; printf( big = % d \n, big) ; ( 16) 18 #define MCRA( m) #define MCRB( n, m) { int i = 2, j = 3; 2* m 2* MCRA( n) + m printf( % d \ n, MCRB( j, MCRA( i) ) ) ; ( 17) struct ss { int info; struct ss * link; x, y, z; : y 19 x y z ( 18) test. txt, : Hello, everyone!, test. txt, fr, 20 #include < stdio. h > { FILE * fr; char str[ 40] ; fgets( str, 5, fr) ; printf( % s \n, str) ; fclose( fr) ; ( 3) 11 ( 11 )

41 C,,,,,, * * *,, * * *

42 ( 4) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1),,, A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) BDAECF C) ABDCEF D) DBEFCA ( 4), A) B) C) D) ( 5), A) B) C) D) ( 6) A) B) C) D) ( 7),? A) B) C) D) ( 8), A) B) C) D) ( 9), A) B) C) D) ( 4) 1 ( 11 )

43 ( 10), A) B) C) D) ( 11) A) C B) { C) C, D) C, ( 12) C A) 10110B B) 0386 C) 0Xffa D) x2a2 ( 13) A) scanf B) Void C) 3com D) int ( 14) {int a; char c = 10; float f = ; double x; a = f/ = c* ( x = 6. 5) ; printf( % d % d % 3. 1f % 3. 1f \ n, a, c, f, x) ; A) B) C) D) ( 15) A) 0 <= x < 100 B) i = j == 0 C) ( char) ( ) D) x + 1 = x + 1 ( 16) {int a = 1, b = 2, m = 0, n = 0, k; k = ( n = b > a) ( m = a < b) ; printf( % d, % d \n, k, m) ; A) 0, 0 B) 0, 1 C) 1, 0 D) 1, 1 ( 17) : int x, y; scanf( % d, % d, &x, &y) ; x 11, y 12,, A) < > B) 11, 12 < > C) 11, 12 < > D) 11, < > ( 18) : int x = 2002, y = 2003; printf( % d \ n, ( x, y) ; 12 < > A), B) C) 2002 D) 2003 ( 19) x float, x, ( 4) 2 ( 11 )

44 A) x = x* / ; B) x = ( x* ) /100. 0; C) x = ( int) ( x* ) / D) x = ( x / ) * ; ( 20) : int a = 1, b = 2, c = 3, x;,, x 3 A) if ( c < a) x = 1; B) if ( a < 3) x = 3; else if ( b < a) x = 1; else if ( a < 2) x = 2; else x = 3; else x = 1; C) if ( a < 3) x = 3; D) if( a < b) x = b; if ( a < 2) x = 2; if ( b < c) x = c; if ( a < 1) x = 1; if ( c < a) x = a; ( 21) { int s = 0, a = 1, n; scanf( % d, &n) ; do { s += 1; a = a - 2; while( a! = n) ; printf( % d \ n, s) ; 2, n A) - 1 B) - 3 C) - 5 D) 0 ( 22), s a b c, a c ( c 0) s = a; for( b = 1; b <= c; b ++ ) s = s + 1; A) s = a + b; B) s = a + c; C) s = s + c; D) s = b + c; ( 23) { int k = 4, n = 0; for( ; n < k; ) { n ++ ; if( n% 3! = 0) continue; K - - ; printf( % d, % d \ n, k, n) ; A) 1, 1 B) 2, 2 C) 3, 3 D) 4, 4 ( 24) : s = { int n; float s; s = 1. 0; for( n = 10; n > 1; n - - ) ( 4) 3 ( 11 )

45 s = s + 1 /n; printf( % 6. 4f\ n, s) ;, A) s = 1. 0; B) for( n = 10; n > 1; n - - ) C) s = s + 1 / n; D) printf( % 6. 4f\ n, s) ; ( 25) ch, A) ch = \ ; B) ch = ; C) ch = NULL; D) ch = \ xaa ; ( 26), A) B) C) D) ( 27) : void fun( int n, double x) {, fun A) fun( int y, double m) ; B) k = fun( 10, 12. 5) ; C) fun( x, n) ; D) void fun( n, x) ; ( 28) void fun ( char * a, char * b) { a = b; ( * a) ++ ; { char cl = A, c2 = a, * p1, * p2; p1 = &c1; p2 = &c2; fun( p1, p2) ; printf( % c% c \ n, c1, c2) ; A) Ab B) aa C) Aa D) Bb ( 29) stdio. h,, A) int * i = NULL; B) float * f = NULL; scanf( % d, i) ; * f = 10. 5; C) char t = m, * c = &t; D) long * L; * c = &t; L = \ 0 ; ( 30) #include < stdio. h > {printf( % d \ n, NULL) ; A) 0 B) 1 C) - 1 D) NULL, ( 31) c, A) c = 97 ; B) c = 97 ; C) c = 97; D) c = a ; ( 32) A) int a[ 2] [ 2] = {{1, {2 ; B) int a[ ] [ 2] = {1, 2, 3, 4 ; C) int a[ 2] [ 2] = { {1, {2, 3 ; D) int a[ 2] [ ] = {1, 2, {3, 4 ; ( 4) 4 ( 11 )

46 ( 33) c1 A) typedef struct B) struct color cl { int red; { int red; int green; ; int green; int blue; int blue; COLOR; ; COLOR cl; C) struct color D) struct { int red; { int red; int green; int green; int blue; int blue; cl; cl; ( 34) A) int num[ ] ; B) #define N 100 int num[ N] ; C) int num[ ] ; D) int N = 100; ( 35) int num[ N] ; A) char s[ 8] ; s = { Beijing ; B) char * s; s = { Beijing ; C) char s[ 8] ; s = Beijing ; D) char * s; s = Beijing ; ( 36) fun( int * p) { return * p; A) B) p C) p D) p ( 37), A) max( int x, int y, int * z) B) int max( int x, y) {* z = x > y? x y; { int z; z = x > y? x y; return z; C) max( int x, int y) D) int max( int x, int y) { int z; { return( x > y? x y) ; ( 38) z = x > y? x y; return( z) ; #include < stdio. h > #define F( X, Y) ( X) * ( Y) { int a = 3, b = 4; printf( % d \ n, F( a ++, b ++ ) ) ; ( 4) 5 ( 11 )

47 A) 12 B) 15 C) 16 D) 20 ( 39) fun( int a, int b) { if( a > b) return( a) ; else return( b) ; { int x = 3, y = 8, z = 6, r; r = fun( fun( x, y), 2* z) ; printf( % d \ n, r) ; A) 3 B) 6 C) 8 D) 12 ( 40) : int * p[ 3] ;, A) int p, B) p,, int C) * p, int D) p, int ( 41) scmp s1 s2 #include < stdio. h > #include < string. h > char * scmp( char * s1, char * s2) { if( strcmp( s1, s2) < 0) return( s1) ; else return( s2) ; { int i; char string[ 20], str[ 3] [ 20] ; for( i = 0; i < 3; i ++ ) gets( str[ i] ) ; strcpy( string, scmp( str[ 0], str[ 1] ) ) ; / * strcpy * / strcpy( string, scmp( string, str[ 2] ) ) ; printf( % s \ n, string) ; : abcd abba abc, A) abcd B) abba C) abc D) abca ( 42) struct s { int x, y; data[ 2] = {10, 100, 20, 200 ; { struct s * p = data; printf( % d \ n, ++ ( p - > x) ) ; ( 4) 6 ( 11 )

48 A) 10 B) 11 C) 20 D) 21 ( 43) { int a = 5, * b, * * c; c = &b; b = &a; c = &b; b = &a;, ** c A) a B) b C) a D) b ( 44) #include < string. h > {char str[ ] [ 20] = { Hello, Beijing, * p = str; printf( % d \ n, strlen( p + 20) ) ; A) 0 B) 5 C) 7 D) 20 ( 45) fun( char * p2, char * p1) { while( ( * p2 = * p1)! = 0 ) { p1 ++ ; p2 ++ ; A) p1 p2 B) p1 p2 C) p1 p2 D) p1 p2 \0 ( 46) { int x = 3, y = 2, z = 1; printf( % d \ n, x/ y& z) ; A) 3 B) 2 C) 1 D) 0 ( 47) fp, feof( fp) A) 0 B) 1 C) - 1 D) 0 ( 48) C A) ASCII, C B), C C), D), ( 49) { int a[ 3] [ 3], * p, i; p = &a[ 0] [ 0] ; ( 4) 7 ( 11 )

49 for ( i = 0; i < 9; i ++ ) p[ i] = i + 1; printf( % d \ n, a[ 1] [ 2] ) ; A) 3 B) 6 C) 9 D) 2 ( 50),, p q r struct node { int data; truct node * next; * p, * q, * r; q r,, A) r - > next = q; q - > next = r - > next; p - > next = r; B) q - > next = r - > next; p - next = r; r - > next = q; C) p - > next = r; q - > next = r - > next; r - > next = q; D) q - > next = r - > next; r - > next = q; p - > next = r; ( 2, 40 ) 120, ( 1) 1 ( 2), 2 ( 3) 3 ( 4), 4 ( 5), 5 ( 6) 6 { int p = 30; printf( % d \ n, ( p /3 > 0? p /10: p% 3) ) ; ( 7) 7 {char m; m = B + 32; printf( % C\ n, m) ; ( 8) 8 { int a = 1, b = 3, c = 5; ( 4) 8 ( 11 )

50 if ( c = a + b) printf( yes \ n ) ; else printf( no\ n ) ; ( 9) 9 { int i, m = 0, n = 0, k = 0; for( i = 9; i <= 11; i ++ ) switch( i /10) { case 0: m ++ ; n ++ ; break; case 10: n ++ ; break; default: k ++ ; n ++ ; printf( % d % d % d \ n, m, n, k) ; ( 10), # 10 #include < stdio. h > { int i, j; for( i = 1; i < 5; i ++ ) for( j = 2; j <= i; j ++ ) putchar( # ) ; ( 11) fun : m = , int fun( int n) { int m = 0, f = 1, i; for( i = 1; i <= n; i ++ ) m += i* f; f = 11; return m; {printf( m = % d \ n, 12) ; ( 12) 13 { int i, n[ ] = {0, 0, 0, 0, 0; for( i = 1; i <= 4; i ++ ) { n[ i] = n[ i - 1] * 2 + 1; printf( % d, n[ i] ) ; ( 4) 9 ( 11 )

51 ( 13) 14 { int i, j, a[ ] [ 3] = {1, 2, 3, 4, 5, 6, 7, 8, 9 ; for( i = 0; i < 3; i ++ ) for( j = i + 1; j < 3; j ++ ) a[ j] [ i] = 0; for( i = 0; i < 3; i ++ ) { for( j = 0; j < 3; j ++ ) printf( % d, a[ i] [ j] ) ; printf( \n ) ; ( 14) 15 int a = 5; fun( int b) { static int a = 10; a += b ++ ; printf( % d, a) ; { int c = 20; fun( c) ; a += c ++ ; printf( % d \ n, a) ; ( 15), 16( double, double) ; { double x, y; scanf( % 1f% 1f, &x, &y) ; printf( % 1f \n, max( x, y) ) ; double max( double a, double b) {return( a > b? ab) ; ( 16) : 3, abcde < >, 17 #include < string. h > move( char * str, int n) { char temp; int i; temp = str[ n - 1] ; ( 4) 10 ( 11 )

52 for( i = n - 1; i > 0; i - - ) str[ i] = str[ i - 1] ; str[ 0] = temp; { char s[ 50] ; int n, i, z; scanf( % d, % s, &n, s) ; z = strlen( s) ; for( i = 1; i <= n; i ++ ) move( s, z) ; printf( % s \n, s) ; ( 17) 18 fun( int x) { if( x/2 > 0) fun( x/ 2) ; printf( % d, x) ; { fun( 6) ; ( 18) : struct node {int data; struct node * next; * p; malloc, p struct node p = ( struct node * ) malloc 19; ( 19) s d, d, : abc123edf456gh, : #include < stdio. h > #include < ctype. h > { char s[ 80], d[ 80] ; int i, j; gets( s) ; for( i = j = 0; s[ i]! = \0 ; i ++ ) if( 20) {d[ j] = s[ i] ; j ++ ; d[ j] = \0 ; puts( d) ; ( 4) 11 ( 11 )

53 C,,,,,, * * *,, * * *

54 ( 5) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1), A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) BDAECF C) ABDCEF D) DBEFCA ( 4), A) ( ) B) C) D) goto ( 5),,, A) B) C) D) ( 6) A) B) C) D) ( 7) 4 : A) B) C) D) ( 8), A) B) C) D) ( 9) ( ) A) B) C) D) ( 10), ( 5) 1 ( 11 )

55 A) B) C) D) ( 11) 5, 4 A) B) C) D) ( 12) A) C B) C C) C D) C ( 13) C A) 1. 2E0. 5 B) E C) 5E - 3 D) E15 ( 14) 4, A) main B) If C) txt D) int enclude max REAL k 2 sin turbo 3COM 001 ( 15), A) x1 = 26. 8% 3; B) = x2; C) x3 = 0x12; D) x4 = = 3; ( 16) int a = 0; double b = 1. 25; char c = A ; #define d 2 A) a ++ ; B) b ++ ; C) c ++ ; D) d ++ ; ( 17) : float a = 2, b = 4, h = 3; C 1 2 ( a + b) h A) ( a + b) * h /2 B) ( 1 /2) * ( a + b) * h C) ( a + b) * h* 1 /2 D) h /2* ( a + b) ( 18) { int x = 102, y = 012; printf( % 2d, % 2d \ n, x, y) ; A) 10, 01 B) 02, 12 C) 102, 10 D) 02, 10 ( 19) 4, A) { ; B) a = 0, b = 0, c = 0; C) if( a > 0) ; D) if( b = = 0) m = 1; n = 2; ( 20) : int a, * pa = &a; scanf a A) scanf( % d, pa) ; B) scanf( % d, a) ; C) scanf( % d, &pa) ; D) scanf( % d, * pa) ; ( 21) k = a > b? ( b > c? 1: 0) : 0; A) if( ( a > b) &&( b > c) ) k = 1; B) if( ( a > b) ( b > c) ) k = 1; else k = 0; else k = 0; C) if( a <= b) k = 0; D) if( a > b) k = 1; else if( b <= c) k = 1; else if( b < c) k = 1; ( 22) { char k; int i; for( i = 1; i < 3; i ++ ) { scanf( % c, &k) ; switch( k) else k = 0; ( 5) 2 ( 11 )

56 { case 0 : printf( another \ n ) ; case 1 : printf( number \n ) ;, : 01 < >, A) another B) another C) another D) number number number number number another number ( 23) { int x = 0, y = 5, z = 3; while( z - - > 0 && ++ x < 5) y = y - 1; printf( % d, % d, % d \ n, x, y, z) ; A) 3, 2, 0 B) 3, 2, - 1 C) 4, 3, - 1 D) 5, - 2, - 5 ( 24) { int i, s = 0; for( i = 1; i < 10; i += 2) s += i + 1, printf( % d \ n, s) ; A) 1 9 B) 1 10 C) 1 9 D) 1 10 ( 25) { int i, n = 0; for( i = 2; i < 5; i ++ ) { do { if( i% 3) continue; n ++ ; while(! i) ; n ++ ; printf( n = % d \ n, n) ; A) n = 5 B) n = 2 C) n = 3 D) n = 4 ( 26) double myadd( double a, double b) { return( a + b) ;,, A) double myadd( double a, b) ; B) double myadd( double, double) ; C) double myadd( double b, double a) ; D) double myadd( double x, double y) ; ( 27) char fun( char x, char y) { if( x < y) return x; return y; ( 5) 3 ( 11 )

57 { int a = 9, b = 8, c = 7 ; printf( % c \ n, fun( fun( a, b), fun( b, c) ) ) ; A) B) 8 C) 9 D) 7 ( 28) : int n = 0, * p = &n, * * q = &p;,, A) p = 1; B) * q = 2; C) q = p; D) * p = 5; ( 29) void f( int v, int w) { int t; t = v; v = w; w = t; { int x = 1, y = 3, z = 2; if( x > y) f( x, y) ; else if( y > z) f( y, z) ; else f( x, z) ; printf( % d, % d, % d \ n, x, y, z) ; A) 1, 2, 3 B) 3, 1, 2 C) 1, 3, 2 D) 2, 3, 1 ( 30) int a[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, * p = &a[ 3], b; b = p[ 5] ; b A) 5 B) 6 C) 8 D) 9 ( 31) { char a[ ] = abcdefg, b[ 10] = abcdefg ; printf( % d % d \ n, sizeof( a), sizeof( b) ) ; A) 77 B) 88 C) 810 D) 1010 ( 32) void swap1( int c[ ] ) { int t; t = c[ 0] ; c[ 0] = c[ 1] ; c[ 1] = t; void swap2( int c0, int c1) { int t; t = c0; c0 = c1; c1 = t; { int a[ 2] = {3, 5, b[ 2] = {3, 5 ; swap1( a) ; swap2( b[ 0], b[ 1] ) ; printf( % d% d% d% d \ n, a[ 0], a[ 1], b[ 0], b[ 1] ) ; : A) B) C) D) ( 33) ( 5) 4 ( 11 )

58 void sum( int * a) { a[ 0] = a[ 1] ; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; for( i = 2; i >= 0; i - - ) sum( &aa[ i] ) ; printf( % d \ n, aa[ 0] ) ; A) 4 B) 3 C) 2 D) 1 ( 34) int f( int b[ ] [ 4] ) { int i, j, s = 0; for( j = 0; j < 4; j ++ ) { i = j; if( i > 2) i = 3 - j; s += b[ i] [ j] ; return s; { int a[ 4] [ 4] = { {1, 2, 3, 4, {0, 2, 4, 6, {3, 6, 9, 12, {3, 2, 1, 0 ; printf( % d \ n, f( a) ) ; : A) 12 B) 11 C) 18 D) 16 ( 35) #include < stdio. h > char a[ 10], * b = a; a A) gets( a) B) gets( a[ 0] ) ; C) gets( &a[ 0] ) ; D) gets( b) ; ( 36) { char * p[ 10] = { abc, aabdfg, dcdbe, abbd, cd ; printf( % d \ n, strlen( p[ 4] ) ) ; A) 2 B) 3 C) 4 D) 5 ( 37) int a = 2; int f( int * a) { return ( * a) ++ ; { int s = 0; { int a = 5; s += f( &a) ; s += f( &a) ; printf( % d \ n, s) ; A) 10 B) 9 C) 7 D) 8 ( 5) 5 ( 11 )

59 ( 38) #define f( x) x* x { int i; i = f( 4 + 4) / f( 2 + 2) ; printf( % d \ n, i) ; A) 28 B) 22 C) 16 D) 4 ( 39) typedef struct S { int g; char h; T; A) S B) T C) S struct D) T struct S ( 40) struct STU { char name[ 10] ; int num; ; void f1( struct STU c) { struct STU b = { LiSiGuo, 2042 ; c = b; void f2( struct STU * c) { struct STU b = { SunDan, 2044 ; * c = b; { struct STU a = { YangSan, 2041, b = { Wang Yin, 2043 ; f1( a) ; f2( &b) ; printf( % d% d \ n, a. num, b. num) ; A) B) C) D) ( 41) { unsigned char a, b; a = 4 3; b = 4 & 3; printf( % d % d \ n, a, b) ; A) 70 B) 07 C) 11 D) 430 ( 42) : * * * * { int i, j; * * * * * * * * * * * * ( 5) 6 ( 11 )

60 for( i = 1; i <= 4; i ++ ) { for( j = 1; j <= 4 - i; j ++ ) printf( ) ; for( j = 1; j <= ; j ++ ) printf( * ) ; printf( \n ) ; A) i B) 2* i - 1 C) 2* i + 1 D) i + 2 ( 43) void sort( int a[ ], int n) { int i, j, t; for ( i = 0; i < n - 1; i += 2) for ( j = i + 2; j < n; j += 2) if( a[ i] < a[ j] ) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; sort( aa, 10) ; for( i = 0; i < 10; i ++ ) printf( % d,, aa[ i] ) ; printf( \n ) ; : A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, C) 9, 2, 7, 4, 5, 6, 3, 8, 1, 10, D) 1, 10, 3, 8, 5, 6, 7, 4, 9, 2, ( 44), ( ) : A) char s[ 10] = abcdefg ; B) char t[ ] = abcdefg, * s = t; C) char s[ 10] ; s = abcdefg ; D) char s[ 10] ; strcpy( s, abcdefg ) ; ( 45) #include < string. h > main( int argc, char * argv[ ] ) { int i, len = 0; for( i = 1; i < argc; i += 2) len += strlen( argv[ i] ) ; printf( % d \ n, len) ; ex. exe, ex abcd efg h3 k44 A) 14 B) 12 C) 8 D) 6 ( 46) void f( int a[ ], int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; f( a, i + 1, j - 1) ; { int i, aa[ 5] = {1, 2, 3, 4, 5 ; f( aa, 0, 4) ; for( i = 0; i < 5; i ++ ) printf( % d,, aa[ i] ; printf( \ n ) ; ( 5) 7 ( 11 )

61 A) 5, 4, 3, 2, 1 B) 5, 2, 3, 4, 1, C) 1, 2, 3, 4, 5 D) 1, 5, 4, 3, 2, ( 47) struct STU { char name[ 10] ; int num; int Score; { { struct STU s[ 5] = {{ YangSan, 20041, 703, { LiSiGuo, 20042, 580, { WangYin, 20043, 680, { SunDan, 20044, 550, { Penghua, 20045, 537, * p[ 5], * t; int i, j; for( i = 0; i < 5; i ++ ) p[ i] = &s[ i] ; for( i = 0; i < 4; i ++ ) for( j = i + 1; j < 5; j ++ ) if( p[ i] - > Score > p[ j] - > Score) {t = p[ i] ; p[ i] = p[ j] ; p[ i] = t; printf( % d % d \ n, s[ 1]. Score, p[ 1] - > Score) ; A) B) C) D) ( 48) #include < stdlib. h > struct NODE { int num; struct NODE * next; ; { struct NODE * p, * q, * r; int sum = 0; p = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; q = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; r = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; p - > num = 1; q - > num = 2; r - > num = 3; p - > next = q; q - > next = r; r - > next = NULL; sum += q - > next - > num, sum += p - > num; printf( % d \ n, sum) ; A) 3 B) 4 C) 5 D) 6 ( 49) #include < stdio. h > { FILE * fp; int i, k = 0, n = 0; fp = fopen( d1. dat, w ) ; for( i = 1; i < 4; i ++ ) fprintf( fp, % d, i) ; fclose( fp) ; fp = fopen( d1. dat, r ) ; fscanf( fp, % d% d, &k, &n) ; printf( % d% d \ n, k, n) ; fclose( fp) ; ( 5) 8 ( 11 )

62 A) 1 2 B) C) 1 23 D) 0 0 ( 50) ( : fseek( fp, - 2L* sizeof( int), SEEK END) ; 2* sizeof( int) ) #include < stdio. h > { FILE * fp; int i, a[ 4] = { 1, 2, 3, 4, b; fp = fopen( data. dat, wb ) ; for( i = 0; i < 4; i ++ ) fwrite( &a[ i], sizeof( int), 1, fp) ; fclose( fp) ; fp = fopen( data. dat, rb ) ; fseek( fp, - 2L* sizeof( int), SEEK END) ; fread( &b, sizeof( int), 1, fp) ; / * sizeof( int) b * / fclose( fp) ; printf( % d \ n, b) ; A) 2 B) 1 C) 4 D) 3 ( 2, 40 ) 120, ( 1), 1 ( 2),, 2 ( 3),, 3 ( 4),, 4, ( 5),, 5 ( 6) A ASCII 65, 6 char ch = B ; printf( % c % d \ n, ch, ch) ; ( 7) int n1 = 10, n2 = 20; printf( 7, n1, n2) ; n1 n2,, n1 = 10 n2 = 20 ( 8) { int t = 1, i = 5; for( ; i >= 0; i - - ) t* = i; printf( % d \ n, t) ; 8 ( 9) { int n = 0, m = 1, x = 2; if(! n) x - = 1; if( m) x - = 2; if( x) x - = 3; printf( % d \ n, x) ; ( 5) 9 ( 11 )

63 9 ( 10) #include < stdio. h > { char ch1, ch2; int n1, n2; ch1 = getchar( ) ; ch2 = getchar( ) ; n1 = ch1 - ( ) ; n2 = n1* 10 + ( ch2 - ( ) ) ; printf( % d \ n, n2) ; : 12 < >, 10 ( 11) void f( int y, int * x) { y = y + * x; * x = * x + y; { int x = 2, y = 4; f( y, &x) ; printf( % d % d \ n, x, y) ; 11 ( 12) fun x n double fun( double x, int n) { int i; double y = 1; for ( i = 1; i <= n; i ++ ) y = y* x; return y; m a b, fun : m = a 4 + b 4 - ( a + b) 3 12 ( 13) rotate : n n A A, : A = #define N 4 void rotate( int a[ ] [ N] ) { int i, j, t; for( i = 0; i < N; i ++ ) for( j = 0; 13; j ++ ) { t = a[ i] [ j] ; 14; A = a[ j] [ i] = t; ( 14) sstrcpy( ), t s, s void sstrcpy( char * s, char * t) { while ( * s ++= 15) ; { char strl[ 100], str2[ ] = abcdefgh ; sstrcpy( str1, str2) ; printf( % s \ n, str1) ; ( 5) 10 ( 11 )

64 ( 15) : 16 #include < string. h > char* ss ( char* s) { return s + strlen( s) /2; { char* p, * str =abcdefgh ; p = ss( str) ; printf(% s \ n, p) ; ( 16) : 17 int f( int a[ ], int n) { if( n > 1) return a[ 0] + f( &a[ 1], n - 1) ; else return a[ 0] ; { int aa[ 3] = {1, 2, 3, s; s = f( &aa[ 0], 3) ; printf(% d \ n, s) ; ( 17) P double, : #include < stdio. h > { double* p; p = ( double* ) malloc 18; p[ 0] = 1. 5; p[ 1] = 2. 5; p[ 2] = 3. 5; printf(% f% f% f\ n, p[ 0], p[ 1], p[ 2] ) ; ( 18) 19 #include < string. h > typedef struct student{ char name[ 10] ; long sno; float score; STU; { STU a = {zhangsan, 2001, 95, b = {Shangxian, 2002, 90, c = {Anhua, 2003, 95, d, * p = &d; d = a; if( strcmp( a. name, b. name) > 0) d = b; if( strcmp( c. name, d. name) > 0) d = c; printf(% ld% s \ n, d. sno, p - > name) ; ( 19) sum S = 1 + x + x2 2! + x3 3! + + xn n! double sum( double x, int n) { int i; double a, b, s; 20 for( i = 1; i <= n; i ++ ) { a = a* x; b = b* i; s = s + a / b; return s; ( 5) 11 ( 11 )

65 C,,,,,, * * *,, * * *

66 ( 6) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) DABECF C) BDAECF D) DBEFCA ( 4) A) B) C) D) ( 5) A), B), C), D), ( 6), ( ) A) B) C) D) ( 7) A) B) C) D) ( 8) ( 6) 1 ( 11 )

67 A) B) C) D) ( 9), ( ), A) B) C) D) ( 10) A) B) C) D) ( 11) C A) B) C) D) ( 12), A) B) C) D) ( 13) A) char a = A b = B ; B) float a = b = 10. 0; C) int a = 10, * b = &a; D) float * a, b = &a; ( 14), A) 1234 B) 1 2 C) int 2 D) 2 int ( 15) double a, b; int w; long c;, A) a = a + b = b ++ B) w% ( ( int) a + b) C) ( c + w) % ( int) a D) w = a == b; ( 16) { int m = 3, n = r, x; x =- m ++ ; x = x + 8 / ++ n; printf( " % d \ n", x) ; A) 3 B) 5 C) - 1 D) - 2 ( 17) { char a = a, b; printf( " % c, ", ++ a) ; printf( " % c \ n", b = a ++ ) ; A) b, b B) b, c C) a, b D) a, c ( 18) { int m = 0256, n = 256; printf( " % o% o\ n", m, n) ; ( 6) 2 ( 11 )

68 A) B) C) D) ( 19) { int a = 666, b = 888; printf( " % d \ n", a, b) ; A) B) 666 C) 888 D) 666, 888 ( 20) { int i; for( i = 0; i < 3; i ++ ) switch( i) { case0: printf( " % d", i) ; case2: printf( " % d", i) ; default: printf( " % d", i) ; A) B) C) D) 012 ( 21) x y, x - y < 10 A) abs( x - y) < 10 B) x - y > - 10&&x - y < 10 C)! ( x - y) < - 10! ( y - x) > 10 D) ( x - y) * ( x - y) < 100 ( 22) { int a = 3, b = 4, c = 5, d = 2; if( a > b) if( b > c) printf( " % d", d +++ 1) ; else printf( " % d", ++ d + 1) ; printf( " % d \ n", d) ; A) 2 B) 3 C) 43 D) 44 ( 23), A) if( a) printf( " % d \ n", x) ; else printf( " % d \n", y) ; B) if( a == 0) printf( " % d \ n", y) ; else printf( " % d \n", x) ; C) if( a! = 0) printf( " % d \n", x) ; else printf( " % d \ n", y) ; D) if( a == 0) printf( " % d \ n", x) ; else printf( " % d \ n", y) ; ( 24) ( 6) 3 ( 11 )

69 C) i = 1; p = 1; while( i <= 5) { p* = i; i ++ ; D) i = 1; p = 1; do{p* = i; i ++ ; while( i <= 5) ; ( 26) { int i = 0, s = 0; for( ; ; ) { if( i == 3i == 5) continue; if( i == 6) break; i ++ ; s += i; ; printf( " % d \ n", s) ; A) 10 B) 13 C) 24 D) ( 25), 5!, A) for( i = 1, p = 1; i <= 5; i ++ ) p* = i; B) for( i = 1; i <= 5; i ++ ) { p = 1; p* = i; { char a, b, c, d; scanf( " % c, % c, % d, % d", &a, &b, &c, &d) ; printf( " % c, % c, % c, % c \ n", a, b, c, d) ; : 6, 5, 65, 66 < > A) 6, 5, A, B B) 6, 5, 65, 66 C) 6, 5, 6, 5 D) 6, 5, 6, 6 ( 27) A) int a[ ] [ 3] ; B) int a[ ] [ 3] = {2* 3 ; C) int a[ ] [ 3] = { ; D) int a[ 2] [ 3] = { {1, {2, {3, 4 ; ( 28) int f( int a) { return a% 2; { int s[ 8] = {1, 3, 5, 2, 4, 6, i, d = 0; for( i = 0; f( s[ i] ) ; i ++ ) d += s[ i] ; printf( " % d \ n", d) ; A) 9 B) 11 C) 19 D) 21 ( 29) int c[ 4] [ 5], ( * p) [ 5] ; p = c; c A) p + 1 B) * ( p + 3) C) * ( p + 1) + 3 D) * ( p[ 0] + 2) ( 6) 4 ( 11 )

70 ( 30) { int a = 7, b = 8, * p, * q, * r; p = &a; q = &b; r = p; p = q; q = r; printf( " % d, % d, % d, % d \ n", * p, * q, a, b) ; A) 8, 7, 8, 7 B) 7, 8, 7, 8 C) 8, 7, 7, 8 D) 7, 8, 8, 7 ( 31) s1 s2, : s1 s2, S; A) if( s1 > s2) S; B) if( strcmp( s1, s2) ) S; C) if( strcmp( s2, s1) > 0) S; D) if( strcmp( s1, s2) > 0) S; ( 32) int x[ 6] = {2, 4, 6, 8, 5, 7, * p = x, i; x 6, A) for( i = 0; i < 6; i ++ ) printf( " % 2d", * ( p ++ ) ) ; B) for( i = 0; i < 6; i ++ ) printf( " % 2d", * ( p + i) ) ; C) for( i = 0; i < 6; i ++ ) printf( " % 2d", * p ++ ) ; D) for( i = 0; i < 6; i ++ ) printf( " % 2d", ( * p) ++ ) ; ( 33) #include < stdio. h > { int a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,, * p = a + 5, * q = NULL; * q = * ( p + 5) ; printf( " % d % d \ n", * p, * q) ; A) B) 6 6 C) 6 11 D) 5 10 ( 34) int a[ 3] [ 2] = {1, 2, 3, 4, 5, 6, * p[ 3] ; p[ 0] = a[ 1] ; * ( p[ 0] + 1) A) a[ 0] [ 1] B) a[ 1] [ 0] C) a[ 1] [ 1] D) a[ 1] [ 2] ( 35) { char str[ ] [ 10] = {" China", " Beijing", * p = str; printf( " % s \n", p + 10) ; A) China B) Beijing C) ng D) ing ( 36) ( 6) 5 ( 11 )

71 { char s[ ] = " ABCD", * p; for( p = s + 1; p < s + 4; p ++ ) printf( " % s \ n", p) ; A) ABCD B) A C) B D) BCD BCD B C CD CD C D D D D ( 37), funa funb, funb funa, A) B) C) D) C ( 38) : int i, a[ 10], * p;, A) p = 100; B) p = a[ 5] ; C) p = a[ 2] + 2; D) p = a + 2; ( 39) A) static, B) static, C), D) ( 40) : char c1 = 92, c2 = 92;, A) c1^c2 B) c1&c2 C) c1 c2 D) c1 c2 ( 41) fun void * fun( ) ; A) fun B) fun C) fun D) fun, ( 42) { char s[ ] = " Yse \n / No", * ps = s; puts( ps + 4) ; * ( ps + 4) = 0; puts( s) ; ( D ) A) n / No B) / No C) n / No D) Yes Yes Yes / No / No / No Yes ( 43) { unsigned int a; int b =- 1; a = b; ( 6) 6 ( 11 )

72 printf( " % u", a) ; A) - 1 B) C) D) ( 44) void fun( int * a, int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; i ++ ; j - - ; fun( a, i, j) ; { int x[ ] = {2, 6, 1, 8, i; fun( x, 0, 3) ; for( i = 0; i < 4; i ++ ) printf( " % 2d", x[ i] ) ; printf( " \n" ) ; A) B) C) D) ( 45) struct student { int age; char num[ 8] ; struct student stu[ 3] = { {20, "200401", {21, " ", {19, " " ; struct student * p = stu; ; A) ( p ++ ) - > num B) p - > num C) ( * p). num D) stu[ 3]. age ( 46) { int x[ ] = {1, 3, 5, 7, 2, 4, 6, 0, i, j, k; for( i = 0; i < 3; i ++ ) for( j = 2; j >= i; j - - ) if( x[ j + 1] > x[ j] ) { k = x[ j] ; x[ j] = x[ j + 1] ; x[ j + 1] = k; for( i = 0; i < 3; i ++ ) for( j = 4; j < 7 - i; j ++ ) if( x[ j] > x[ j + 1] ) { k = x[ j] ; x[ j] = x[ j + 1] ; x[ j + 1] = k; for( i = 0; i < 8; i ++ ) printf( " % d", x[ i] ) ; printf( " \n" ) ; A) B) C) D) ( 6) 7 ( 11 )

73 ( 47) #include < stdio. h > { FILE * fp1; fp1 = fopen( " f1. txt", " w" ) ; fprintf( fp1, " abc" ) ; fclose( fp1) ; f1. txt : good, f1. txt A) goodabc B) abcd C) abc D) abcgood ( 48) ( 50) :,, #include < stdlib. h > struct node { char data; struct node * next; ; ( 48) CreatList( char* s) { struct node * h, * p, * q; h = ( struct node* ) malloc( sizeof( struct node) ) ; p = q = h; while( * s! = " \ 0" ) { p = ( struct node* ) malloc( sizeof( struct node) ) ; p - > data = ( 49) ; q - > next = p; q = ( 50) ; s ++ ; p - > next = " \0" ; return h; { char str[ ] = " link list" ; struct node* head; head = CreatList( str) ; ( 48) A) char* B) struct node C) struct node* D) char ( 49) A) * s B) s C) * s ++ D) ( * s) ++ ( 50) A) p - > next B) p C) s D) s - > next ( 2, 40 ) 120, ( 1), 1 ( 2),, 2 ( 3), 3 ( 6) 8 ( 11 )

74 ( 4),, 4 ( 5), 5 ( 6) 6 int i = 9; printf( " % o\ n", i) ; ( 7) 7 { int a, b, c; a = 25; b = 025; c = 0x25; printf( " % d % d % d \ n", a, b, c) ; ( 8) 8 { int p[ 7] = {11, 13, 14, 15, 16, 17, 18 ; int i = 0, j = 0; while( i < 7&&p[ i] % 2 == 1) j += p[ i ++ ] ; printf( " % d \ n", j) ; ( 9) 9 { int x = 1, y = 0, a = 0, b = 0; switch( x) { case 1: switch( y) { case 0: a ++ ; break; case 1: b ++ ; break; case2: a ++ ; b ++ ; break; printf( " % d % d \ n", a, b) ; ( 10) 10 { int a[ 4] [ 4] = { {1, 2, 3, 4, {5, 6, 7, 8, {11, 12, 13, 14, {15, 16, 17, 18 ; int i = 0, j = 0, s = 0; while( i ++ < 4) { if( i == 2 i == 4) continue; j = 0; do{ s += a[ i] [ j] ; j ++ ; while( j < 4) ; ( 6) 9 ( 11 )

75 printf( " % d \ n", s) ; ( 11) 11 { char a[ ] = " Language", b[ ] = " Programe" ; char * p1, * p2; int k; p1 = a; p2 = b; for( k = 0; k <= 7; k ++ ) if( * ( p1 + k) == * ( p2 + k) ) printf( " % c", * ( p1 + k) ) ; ( 12) 12 { char a[ ] = " ", * p; int i = 0; p = a; while( * p) { if( i% 2 == 0) * p = * ; p ++ ; i ++ ; puts( a) ; ( 13), for 13 #define N 2 #define M N + 1 #define K M + 1* M/2 { int i; for( i = 1; i < K; i ++ ) { ( 14) SunFun 10 f( x) f( x) = x = 0 x2 + 1, F { printf( " The sum = % d \ n", SunFun( 10) ) ; SunFun( int n) { int x, s = 0; for( x = 0; x <= n; x ++ ) s += F( 14) ; return s; F( int x) { return( 15) ; ( 15),, ( 6) 10 ( 11 )

76 { int i, a[ 20], sum, count; sum = count = 0; for( i = 0; i < 20; i ++ ) scanf( " % d", 16) ; for( i = 0; i < 20; i ++ ) { if( a[ i] > 0) { count ++ ; sum += 17; printf( " sum = % d, count = % d \ n", sum, count) ; ( 16), SumColumMin : M N, #define M 2 #define N 4 void SumColumMin( int a[ M] [ N], int * sum) { int i, j, k, s = 0; for( i = 0; i < N; i ++ ) { k = 0; for( j = 1; j < M; j ++ ) if( a[ k] [ i] > a[ j] [ i] ) k = j; s += 18; 19= s; { int x[ M] [ N] = {3, 2, 5, 1, 4, 1, 8, 3, s; SumColumMin( 20) ; printf( " % d \ n", s) ; ( 6) 11 ( 11 )

77 C,,,,,, * * *,, * * *

78 ( 7) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2) A) B) C) D), ( 3) n,, A) n /2 B) n C) n D) n( n - 1) /2 ( 4) n, A) log 2 n B) n /2 C) n D) n + 1 ( 5) A), B), C), D), ( 6) A) B) C) D) ( 7), A), B), C), D), ( 8) A) B) C), D) ( 7) 1 ( 11 )

79 ( 9), A) B) C) D) ( 10) A) B) C) D) ( 11), A) B) C) D) ( 12) C A) B) C) - 8e1. 0 D) e ( 13) A) C B) C C) C D) C ( 14) A) Main B) _0 C) _int D) sizeof ( 15) A) e04 B) e0. 4 C) e + 4 D) e0 ( 16) 0 ASCII 48, { char a = 1, b = 2 ; printf( " % c, ", b ++ ) ; printf( " % d \ n", b - a) ; A) 3, 2 B) 50, 2 C) 2, 2 D) 2, 50 ( 17) { int m = 12, n = 34; printf( " % d% d", m ++, ++ n) ; printf( " % d% d \ n", n ++, ++ m) ; A) B) C) D) ( 18) : int b; char c[ 10] ;, A) scanf( " % d% s", &b, &c) ; B) scanf( " % d% s", &b, c) ; C) scanf( " % d% s", b, c) ; D) scanf( " % d% s", b, &c) ; ( 19) { int m, n, p; scanf( " m = % dn = % dp = % d", &m, &n, &p) ; printf( " % d% d% d \ n", m, n, p) ; ( 7) 2 ( 11 )

80 , m 123, n 456, p 789, A) m = 123n = 456p = 789 B) m = 123 n = 456 p = 789 C) m = 123, n = 456, p = 789 D) ( 20) { int a, b, d = 25; a = d /10% 9; b = a&&( - 1) ; printf( " % d, % d \ n", a, b) ; A) 6, 1 B) 2, 1 C) 6, 0 D) 2, 0 ( 21) { int i = 1, j = 2, k = 3; if( i ++== 1&&( ++ j == 3 k ++== 3) ) printf( " % d % d % d \ n", i, j, k) ; A) B) C) D) ( 22) a b c d : a < b? a: c < d? c: d A) 1 B) 2 C) 3 D) 4 ( 23) { int p[ 8] = {11, 12, 13, 14, 15, 16, 17, 18, i = 0, j = 0; while( i ++ < 7) if( p[ i] % 2) j += p[ i] ; printf( " % d \ n", j) ; A) 42 B) 45 C) 56 D) 60 ( 24) { char a[ 7] = " a0 \ 0a0 \0" ; int i, j; i = sizeof( a) ; j = strlen( a) ; printf( " % d % d \ n", i, j) ; A) 2 2 B) 7 6 C) 7 2 D) 6 2 ( 25) A) int a[ 5] = {0, 1, 2, 3, 4, 5 ; B) char a[ ] = {0, 1, 2, 3, 4, 5 ; ( 7) 3 ( 11 )

81 C) a b D) ( 28) void f( int * x, int * y) { { int a[ 8] = {1, 2, 3, 4, 5, 6, 7, 8, i, * p, * q; p = a; q = &a[ 7] ; while( p < q) C) char a = { A, B, C ; D) int a[ 5] = " 0123" ; ( 26) int f1( int x, int y) { return x > y? x: y; int f2( int x, int y) { return x > y? y: x; { int a = 4, b = 3, c = 5, d = 2, e, f, g; e = f2( f1( a, b), f1( c, d) ) ; f = f1( f2( a, b), f2( c, d) ) ; g = a + b + c + d - e - f; printf( " % d, % d, % d \ n", e, f, g) ; A) 4, 3, 7 B) 3, 4, 7 C) 5, 2, 7 D) 2, 5, 7 ( 27) : char a[ ] = " xyz", b[ ] = { x, y, z ;, A) a b B) a b int t; t = * x; * x = * y; * y = t; {f( p, q) ; p ++ ; q - - ; for( i = 0; i < 8; i ++ ) printf( " % d, ", a[ i] ) ; A) 8, 2, 3, 4, 5, 6, 7, 1, B) 5, 6, 7, 8, 1, 2, 3, 4, C) 1, 2, 3, 4, 5, 6, 7, 8, D) 8, 7, 6, 5, 4, 3, 2, 1, ( 29) { int a[ 3] [ 3], * p, i; p = &a[ 0] [ 0] ; for( i = 0; i < 9; i ++ ) p[ i] = i; for( i = 0; i < 3; i ++ ) printf( " % d", a[ 1] [ i] ) ; A) 012 B) 123 C) 234 D) 345 ( 7) 4 ( 11 )

82 ( 30) A) double, B), C),, D) ( 31) #define N 20 fun( int a[ ], int n, int m) { int i, j; for( i = m; i >= n; i - - ) a[ i + 1] = a[ i] ; { int i, a[ N] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ; fun( a, 2, 9) ; for( i = 0; i < 5; i ++ ) printf( " % d", a[ i] ) ; A) B) C) D) ( 32) { int a[ 3] [ 2] = {0, ( * ptr) [ 2], i, j; for( i = 0; i < 2; i ++ ) {ptr = a + i; scanf( " % d", ptr) ; ptr ++ ; for( i = 0; i < 3; i ++ ) { for( j = 0; j < 2; j ++ ) printf( " % 2d", a[ i] [ j] ) ; printf( " \ n" ) ; : < >, A) B) 1 0 C) 1 2 D) ( 33) prt( int * m, int n) {int i; for( i = 0; i < n; i ++ ) m[ i] ++ ; { int a[ ] = {1, 2, 3, 4, 5, i; prt( a, 5) ; for( i = 0; i < 5; i ++ ) ( 7) 5 ( 11 )

83 printf( " % d, ", a[ i] ) ; A) 1, 2, 3, 4, 5, B) 2, 3, 4, 5, 6, C) 3, 4, 5, 6, 7, D) 2, 3, 4, 5, 1, ( 34) {int a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0, * p; for( p = a; p < a + 10; p ++ ) printf( " % d, ", * p) ; A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, B) 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, C) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, D) 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ( 35) #define P 3 void F( int x) { return( P* x* x) ; {printf( " % d \ n", F( 3 + 5) ) ; A) 192 B) 29 C) 25 D) ( 36) {int c = 35; printf( " % d \ n", c&c) ; A) 0 B) 70 C) 35 D) 1 ( 37) A) B) C) D) ( 38) union dt {int a; char b; double c; data; A) data B) data c C) : data. a = 5; printf( " % f\ n", data. c) ; D) data ( 39), A) char * sp; * sp = " right! " ; B) char s[ 10] ; s = " right! " ; C) char s[ 10] ; * s = " right! " ; D) char * sp = " right! " ; ( 40) typedef struct ST {long a; int b; char c[ 2] ; NEW; A) B) ST ( 7) 6 ( 11 )

84 C) NEW D) NEW ( 41) {int a = 1, b; for( b = 1; b <= 10; b ++ ) {if( a >= 8) break; if( a% 2 == 1) { a += 5; continue; a - = 3; printf( " % d \ n", b) ; A) 3 B) 4 C) 5 D) 6 ( 42) {char s[ ] = " 159", * p; p = s; printf( " % c", * p ++ ) ; printf( " % c", * p ++ ) ; A) 15 B) 16 C) 12 D) 59 ( 43) fun( char * a, char * b) {while( ( * a! = \0 ) &&( * b! = \0 ) &&( * a == * b) ) {a ++ ; b ++ ; return( * a - * b) ; A) a b B) b a C) b a D) a b ( 44) {int num[ 4] [ 4] = { {1, 2, 3, 4, {5, 6, 7, 8, {9, 10, 11, 12, {13, 14, 15, 16, i, j; for( i = 0; i < 4; i ++ ) {for( j = 0; j <= i; j ++ ) printf( " % 4c", ) ; for( j = ; j < 4; j ++ ) printf( " % 4d", num[ i] [ j] ) ; printf( " \ n" ) ; A) i - 1 B) i C) i + 1 D) 4 - i ( 45) point( char * p) { p += 3; ( 7) 7 ( 11 )

85 {char b[ 4] = { a, b, c, d, * p = b; point( p) ; printf( " % c \ n", * p) ; A) a B) b C) c D) d ( 46) char fun( char * ) ; { char * s = " one", a[ 5] = {0, ( * f1) ( ) = fun, ch; fun A) ( * f1) ( a) ; B) * f1( * s) ; C) fun( &a) ; D) ch = * f1( s) ; ( 47), : struct node { int data; struct node * next; * p, * q, * r; data next data next data next p q r q,, A) p - > next = q - > next; B) p - > next = p - > next - > next; C) p - > next = r; D) p = q - > next; ( 48) td, A) typedef struct aa B) struct aa { int n; { int n; float m; float m; AA; td; AA td; struct aa td; C) struct D) struct { int n; { int n; float m; float m; aa; td; struct aa td; ( 49) fseek( fp, 0L, SEEK_SET) A) feof( fp) B) ftell( fp) C) fgetc( fp) D) rewind( fp) ( 50) #include < stdio. h > void WriteStr( char * fn, char * str) {FILE * fp; fp = fopen( fn, " w" ) ; fputs( str, fp) ; fclose( fp) ; { WriteStr( " t1. dat", " start" ) ; WriteStr( " t1. dat", " end" ) ;, t1. dat ( 7) 8 ( 11 )

86 A) start B) end C) startend D) endrt ( 2, 40 ) 120, ( 1) 2 18, 1 ( 2), 2 ( 3) 3 ( 4),, 4 ( 5) 5 ( 6), : < >, 6 #include < stdio. h > { int i = 0, j = 0, k = 0; scanf( " % d% * d% d", &i, &j, &k) ; printf( " % d% d% d \ n", i, j, k) ; ( 7) 7 #define S( x) 4* x* x + 1 { int i = 6, j = 8; printf( " % d \ n", S( i + j) ) ; ( 8) 8 {int a = 3, b = 4, c = 5, t = 99; if( b < a && a < c) t = a; a = c; c = t; if( a < c && b < c) t = b; b = a; a = t; printf( " % d % d % d \n", a, b, c) ; ( 9) 9 {int a, b, c; a = 10; b = 20; c = ( a% b < 1) ( a / b > 1) ; printf( " % d % d % d \n", a, b, c) ; ( 10) 10 { char c1, c2; for( c1 = 0, c2 = 9 ; c1 < c2; c1 ++, c2 - - ) printf( " % c% c", c1, c2) ; printf( " \ n" ) ; ( 11) A ASCII 65, : B33 < >, 11 #include < stdio. h > { char a, b; a = getchar( ) ; scanf( " % d", &b) ; a = a - A + 0 ; b = b* 2; printf( " % c % c \ n", a, b) ; ( 7) 9 ( 11 )

87 ( 12), fun 3 4 void fun( int, int, int( * ) [ 4], int * ) ; { int a[ 3] [ 4] = { {12, 41, 36, 28, {19, 33, 15, 27, {3, 27, 19, 1, b[ 3], i; fun( 3, 4, a, b) ; for( i = 0; i < 3; i ++ ) printf( " % 4d", b[ i] ) ; printf( " \ n" ) ; void fun( int m, int n, int ar[ ] [ 4], int * br) { int i, j, x; for( i = 0; i < m; i ++ ) { x = ar[ i] [ 0] ; for( j = 0; j < n; j ++ ) if( x < ar[ i] [ j] ) x = ar[ i] [ j] ; 12 = x; ( 13) 13 void swap( int x, int y) {int t; t = x; x = y; y = t; printf( " % d % d ", x, y) ; {int a = 3, b = 4; swap( a, b) ; printf( " % d % d", a, b) ; ( 14) 14 #include < string. h > void fun( char * s, int p, int k) {int i; for( i = p; i < k - 1; i ++ ) s[ i] = s[ i + 2] ; {char s[ ] = " abcdefg" ; fun( s, 3, strlen( s) ) ; puts( s) ; ( 15) 15 #include < string. h > {char ch[ ] = " abc", x[ 3] [ 4] ; int i; for( i = 0; i < 3; i ++ ) strcpy( x[ i], ch) ; for( i = 0; i < 3; i ++ ) printf( " % s", &x[ i] [ i] ) ; printf( " \ n" ) ; ( 16) 16 fun( int a) {int b = 0; static int c = 3; b ++ ; c ++ ; return( a + b + c) ; ( 7) 10 ( 11 )

88 {int i, a = 5; for( i = 0; i < 3; i ++ ) printf( " % d% d", i, fun( a) ) ; printf( " \ n" ) ; ( 17) 17 struct NODE {int k; struct NODE * link; ; {struct NODE m[ 5], * p = m, * q = m + 4; int i = 0; while( p! = q) { p - > k = ++ i; p ++ ; q - > k = i ++ ; q - - ; q - > k = i; for( i = 0; i < 5; i ++ ) printf( " % d", m[ i]. k) ; printf( " \ n" ) ; ( 18) huiwen,, : yes!, : no!,,, : adgda #include < string. h > char * huiwen( char * str) { char * p1, * p2; int i, t = 0; p1 = str; p2 = 18; for( i = 0; i <= strlen( str) /2; i ++ ) if( * p1 ++! = * p2 - - ) {t = 1; break; if( 19) return( " yes! " ) ; else return( " no! " ) ; { char str[ 50] ; printf( " Input: " ) ; scanf( " % s", str) ; printf( " % s\ n", 20) ; ( 7) 11 ( 11 )

89 C,,,,,, * * *,, * * *

90 C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2), A) B) C) D) ( 3) A) B) C), D),, ( 4) A) B), C), D), ( 5) A) B) C) D) ( 6), A) PDL( ) B) PAD C) N - S D) DFD ( 7) A) B) C) D) ( 8) A) B) C) D) ( 9) : C 1 ( 11 )

91 R A B C S A B C T A B C A) T = RS B) T = RS C) T = RS D) T = R / S ( 10) A) B) C) D) ( 11) A) B) C) D), ( 12) A) C B) C) D) ( 13) A) printf, B) putchar, stdio. h C) C, D) getchar, ASCII ( 14) A) ( main ) B) C) D) ( 15) : char * line[ 5] ;, A) line, char B) line, 5 C) line, * D) line ( 16) typedef struct NODE { int num; struct NODE * next; OLD; A) B) NODE C) OLD D) OLD ( 17) A) C B) C, C 2 ( 11 )

92 C) FILE fp; fp D) C ASCII ( 18) if,, A) k% 2 B) k% 2 == 1 C) ( k% 2)! = 0 D)! k% 2 == 1 ( 19) 1 3 sin 2 ( 1 2 ) C A) 1 /3* sin( 1 /2) * sin( 1 /2) B) sin( 0. 5) * sin( 0. 5) /3 C) pow( sin( 0. 5), 2) /3 D) 1 /3. 0* pow( sin( 1. 0 /2), 2) ( 20) A) int n1 = n2 = 10; B) char c = 32; C) float f = f ; D) double x = 12. 3E2. 5; ( 21) : r r s / * Beginning * / {int r; float s; scanf( " % d", &r) ; s = * r* r; printf( " s = % f\ n", s) ; A) B) r C) D) ( 22) : int k = 1, m = 2; float f = 7; A) k = k >= k B) k ++ C) k% int( f) D) k >= f >= m ( 23) : int a = 2, b = 3, c = 4;, 0 A) (! a == 1) &&(! b == 0) B) ( a < b) &&! c1 C) a&&b D) a( b + b) &&( c* a) ( 24) int k = 0, a = 1, b = 2, c = 3; k = a < b? ba; k = k > c? ck;, k A) 3 B) 2 C) 1 D) 0 ( 25) a b c d y if if( a < b) if( c == d) y = 0; else y = 1; A) y = 0 a < b c = d 1 ab C) y = 0 a < b c = d 1 a < b cd ( 26) int n, t = 1, s = 0; scanf( " % d", &n) ; B) y = 0 a < b c = d 1 ab cd D) y = 0 a < b c = d 1 cd C 3 ( 11 )

93 do{ s = s + t; t = t - 2; while( t! = n) ;, A) B) C) D) ( 27), f = n! A) f = 0; B) f = 1; for( i = 1; i <= n; i ++ ) for( i = 1; i < n; i ++ ) f* = i; C) f = 1; D) f = 1; for( i = n; i > 1; i ++ ) f* = i; for( i = n; i >= 2; i - - ) f* = i; ( 28) : int n1 = 0, n2, * p = &n2, * q = &n1;, n2 = n1; A) * p = * q; B) p = q; C) * p = &n1; D) p = * q; ( 29) : int x = 0, * p = &x;, printf( " % d \n", * p) ; A) B) 0 C) x D) p ( 30) fun void fun( char ch, float x) { fun, A) fun( " abc", 3. 0) ; B) t = fun( D, 16. 5) ; C) fun( 65, 2. 8) ; D) fun( 32, 32) ; ( 31) {int a[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, * p = &a[ 3], * q = p - 2; printf( " % d \ n", * p +* q) ; A) 16 B) 10 C) 8 D) 6 ( 32) {char p[ ] = { a, b, c, q[ ] = " abc" ; ; printf( " % d % d \ n", sizeof( p), sizeof( q) ) ; A) 4 4 B) 3 3 C) 3 4 D) 4 3 ( 33) #define f( x) ( x* x) {int i1, i2; i1 = f( 8) / f( 4) ; i2 = f( 4 + 4) / f( 2 + 2) ; printf( " % d, % d \ n", i1, i2) ; A) 64, 28 B) 4, 4 C) 4, 3 D) 64, 64 ( 34) {char a1 = M, a2 = m ; printf( " % c \ n", ( a1, a2) ) ; C 4 ( 11 )

94 A) M B) m C), D) ( 35) #include < stdio. h > {char c1 = 1 ; c2 = 2 ; c1 = getchar( ) ; c2 = getchar( ) ; putchar( c1) ; putchar( c2) ; : a < >, A) c1 a, c2 B) 2 C) c1 a, c2 2 D) c1 a, c2 ( 36) {int k = 5, n = 0; while( k > 0) { switch( k) { default : break; case 1 : n += k; case 2 : case 3 : n += k; case 4 : case 5 : n += k + 2; printf( " % d \ n", n) ; A) 0 B) 4 C) 6 D) 7 ( 37) {int a[ ] = {2, 4, 6, 8, 10, y = 0, x, * p; p = &a[ 1] ; for( x = 1; x < 3; x ++ ) y += p[ x] ; printf( " % d \ n", y) ; A) 10 B) 11 C) 14 D) 15 ( 38) void sort( int a[ ], int n) {int i, j, t; for( i = 0; i < n - 1; i ++ ) for( j = i + 1; j < n; j ++ ) if( a[ i] < a[ j] ) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; {int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; sort( aa + 2, 5) ; C 5 ( 11 )

95 for( i = 0; i < 10; i ++ ) printf( " % d, ", aa[ i] ) ; printf( " \ n" ) ; A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, B) 1, 2, 7, 6, 3, 4, 5, 8, 9, 10, C) 1, 2, 7, 6, 5, 4, 3, 8, 9, 10, D) 1, 2, 9, 8, 7, 6, 5, 4, 3, 10, ( 39) void sum( int a[ ] ) { a[ 0] = a[ - 1] + a[ 1] ; {int a[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10; sum( &a[ 2] ) ; printf( " % d \ n", a[ 2] ) ; A) 6 B) 7 C) 5 D) 8 ( 40) void swap1( int c0[ ], int c1[ ] ) {int t; t = c0[ 0] ; c0[ 0] = c1[ 0] ; c1[ 0] = t; void swap2( int * c0, int * c1) {int t; t = * c0; * c0 = * c1; * c1 = t; {int a[ 2] = {3, 5, b[ 2] = {3, 5 ; swap1( a, a + 1) ; swap2( &b[ 0], &b[ 1] ) ; printf( " % d % d % d % d \n", a[ 0], a[ 1], b[ 0], b[ 1] ) ; A) B) C) D) ( 41) #include < string. h > {char p[ ] = { a, b, c, q[ 10] = { a, b, c ; printf( " % d % d \ n", strlen( p), strlen( q) ) ; A) p q,, 3 B) p, ; q 3 C) q, ; p 3 D) p q, ( 42), f #include < string. h > void f( char * p[ ], int n) {char * t; int i, j; for( i = 0; i < n - l; i ++ ) for( j = i + 1; j < n; j ++ ) C 6 ( 11 )

96 if( strcmp( p[ i], p[ j] ) > 0) {t = p[ i] ; p[ i] = p[ j] ; p[ j] = t; {char * p[ 5] = { " abc", " aabdfg", " abbd", " dcdbe", " cd" ; f( p, 5) ; printf( " % d \ n", strlen( p[ 1] ) ) ; A) 2 B) 3 C) 6 D) 4 ( 43) #include < string. h > void f( char * s, char * t) {char k; k =* s; * s =* t; * t = k; s ++ ; t - - ; if( * s) f( s, t) ; {char str[ 10] = " abcdefg", * p; p = str + strlen( str) /2 + 1; f( p, p - 2) ; printf( " % s \ n", str) ; A) abcdefg B) gfedcba C) gbcdefa D) abedcfg ( 44) float f1( float n) { return n* n; float f2( float n) { return 2* n; {float ( * p1) ( float), ( * p2) ( float), ( * t) ( float), y1, y2; p1 = f1; p2 = f2; y1 = p2( p1( 2. 0) ) ; t = p1; p1 = p2; p2 = t; y2 = p2( p1( 2. 0) ) ; printf( " % 3. 0f, % 3. 0f\ n", y1, y2) ; A) 8, 16 B) 8, 8 C) 16, 16 D) 4, 8 ( 45) int a = 2; int f( int n) {static int a = 3; int t = 0; if( n% 2) { static int a = 4; t += a ++ ; else {static int a = 5; t += a ++ ; return t + a ++ ; C 7 ( 11 )

97 #include < string. h > struct STU {int num; float TotalScore; ; void f( struct STU p) {struct STU s[ 2] = {{20044, 550, {20045, 537 ; {struct STU s[ 2] = {{20041, 703, {20042, 580 ; #include < string. h > struct STU {char name[ 10] ; int num; ; void f( char * name, int num) {struct STU s[ 2] = {{ " SunDan", 20044, { " Penghua", ; num = s[ 0]. num; {struct STU s[ 2] = {{ " YangSan", 20041, {" LiSiGuo", 20042, * p; p = &s[ 1] ; f( p - > name, p - > num) ; printf( " % s % d \ n", p - > name, p - > num) ; {int s = a, i; for( i = 0; i < 3; i ++ ) s += f( i) ; printf( " % d \ n", s) ; A) 26 B) 28 C) 29 D) 24 ( 46) p. num = s[ 1]. num; p. TotalScore = s[ 1]. TotalScore; f( s[ 0] ) ; printf( " % d % 3. 0f\ n", s[ 0]. num, s[ 0]. TotalScore) ; A) B) C) D) ( 47) strcpy( name, s[ 0]. name) ; A) SunDan B) SunDan C) LiSiGuo D) YangSan ( 48) struct STU { char name[ 10] ; int num; float TotalScore; ; void f( struct STU * p) {struct STU s[ 2] = {{ " SunDan", 20044, 550, { " Penghua", 20045, 537, * q = s; ++ p; ++ q; * p = * q; {struct STU s[ 3] = {{ " YangSan", 20041, 703, { " LiSiGuo", 20042, 580 ; C 8 ( 11 )

98 f( s) ; printf( " % s % d % 3. 0f \n", s[ 1]. name, s[ 1]. num, s[ 1]. TotalScore) ; A) SunDan B) Penghua C) LiSiGuo D) SunDan ( 49) {unsigned char a, b; a = 7^3; b =- 4 & 3; printf( " % d % d \ n", a, b) ; A) 4 3 B) 7 3 C) 7 0 D) 4 0 ( 50) #include < stdio. h > {FILE * fp; int i, k, n; fp = fopen( " data. dat", " w + " ) ; for( i = 1; i < 6; i ++ ) { fprintf( fp, " % d ", i) ; if( i% 3 == 0) fprintf( fp, " \ n" ) ; rewind( fp) ; fscanf( fp, " % d% d", &k, &n) ; printf( " % d % d \n", k, n) ; fclose( fp) ; A) 0 0 B) C) 1 4 D) 1 2 ( 2, 40 ) 120, ( 1), 1 ( 2) 2 ( 3), : ( ) 3, ( 4) ( ) 4 ( 5), 5 ( 6) 6 {int x = 0210; printf( " % X\ n", x) ; ( 7) 7 {int a = 1, b = 2, c = 3; if( c = a) printf( " % d \ n", c) ; else printf( " % d \ n", b) ; ( 8) : double * p;,, malloc p C 9 ( 11 )

99 ( 9) 9 {char c; int n = 100; float f = 10; double x; x = f* = n /= ( c = 50) ; printf( " % d % f \ n", n, x) ; ( 10) : s = {int t = 0, s = 0, i; for( i = 1; i <= 5; i ++ ) {t = i + 10; s = s + t; printf( " s = % d \ n", s) ; ( 11) A ASCII {char a, b; a = A ; b = a ; printf( " % d % c \ n", a, b) ; ( 12) int sub( int n) { return( n /10 + n% 10) ; {int x, y; scanf( " % d", &x) ; y = sub( sub( sub( x) ) ) ; printf( " % d \ n", y) ; : 1234 < >, 12 ( 13) sstrcat( ), t s : s abcd, t efgh, s abcdefgh #include < string. h > void sstrcat( char * s, char * t) {int n; n = strlen( s) ; while( * s + n) = 13) {s ++ ; t ++ ( 14) 14 #include < string. h > char * ss( char * s) {char * p, t; p = s + 1; t = * s; while( * p) { * ( p - 1) = * p; p ++ ; * ( p - 1) = t; return s; {char * p, str[ 10] = " abcdefgh" ; p = ss( str) ; C 10 ( 11 )

100 printf( " % s \ n", p) ; ( 15) 15 int f( int a[ ], int n) {if( n >= 1) return f( a, n - 1) + a[ n - 1] ; else return 0; {int aa[ 5] = {1, 2, 3, 4, 5, s; s = f( aa, 5) ; printf( " % d \ n", s) ; ( 16) 16 struct NODE { int num; struct NODE * next; ; {struct NODE int sum = 0; s[ 3] = { {1, \0, {2, \0, {3, \0, * p, * q, * r; s[ 0]. next = s + 1; s[ 1]. next = s + 2; s[ 2]. next = s; p = s; q = p - > next; r = q - > next; sum += q - > next - > num; sum += r - > next - > next - > num; printf( " % d \ n", sum) ; ( 17) : {int i, j, x; for( j = 4; j 17; j - - ) { for( i = 1; i <= 4; i ++ ) {x = ( j - 1) * ; printf( " % 4d", x) ; printf( " \ n" ) ; ( 18) rotate : a N N b 0, a 0 b, b #define N 4 void rotate( int a[ ] [ N], int b[ ] [ N] ) {int i, j; for( i = 0; i < N; i ++ ) { b[ i] [ N - 1] = 19; 20 = a[ N - 1] [ i] ; C 11 ( 11 )

101 C ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) ( 1) C, ( 2) A,,, n,, log 2 n, n ( 3) C,,, ;, ( 4) D,, ( 5) C, ( 6) D, : 1) :, N - S, PAD, HIPO 2) : 3) : PDL( ) Nassi Sheiderman, N - S ; PAD,, ; PDL ( 7) A C 1 ( 8 )

102 ,,, ( 8) A,,,,,,,, ( 9) B R S, R S R S : T R S, T = R U S ( 10) B DBMS,, ( 11) A C :, C,, ( 12) C C ; ;,, ;, ; ;, ( 13) B printf ; putchar getchar, stdio. h ; getchar, ; C, ( 14) B C,, main ;,,, ( 15) A : [ ], ; line, char C 2 ( 8 )

103 ( 16) C typedef, NODE, OLD ( 17) C : FILE * ;, C * ; ( 18) D if : if( ), ( ), if, if ( ), if, if A B C K if, K if ( 19) D C, A B C ( 20) A B, : char c =32 ;, C, ;, C e E 10 C, e( E), e E ( 21) D C, ;,, #define PI ( 22) C + +,,, ; % ; C C, : ( ) ( ) ( 23) A C, 1. &&, 2., 3.!,, :!, &&, : > > > > > A 0 ( 24) B C, : 1? 2: 3, 1, 2, 2; 1, 3, 3 k = a < b? b: a; 2, k = k > c? c: k; C 3 ( 8 )

104 ( 25) C a < b c = d, y 0, y = 1, A B C D C ( 26) D do - while while,, t 1, 2 t, t! = n, n,,, n, ( 27) D n!, n! = n* ( n - 1) * ( n - 2) * 1A B C D A, 0, 0; B n, ; C n, n! ( 28) A * p = &n2, * q = &n1;, p, n2, * p = n2, q, n2, * q = n1 ( 29) B : int x = 0, * p = &x;, p * p = x, x = 0, * p = 0 ( 30) C fun ch x, : 1) ; 2) ( 31) B p a[ 3],, * p = & a[ 3] = 4, * q = p + 2 = 6, 10 ( 32) C p[ ] = {a,b,c, p 3, p 3; q[ ] =abc, \ 0, q 4, sizeof, strlen(, ) ( 33) C : #define ( ), i1 = f( 8) / f( 4), i1 = ( 8* 8) / ( 4* 4) = 4; i2 i2 = ( 4 + 4* 4 + 4) / ( 2 + 2* 2 + 2) = 3 ( 34) B C 4 ( 8 )

105 printf C, ( ) : printf(, ) ;,,,, ( a2 ) m ( 35) A putchar, : putchar( ch), ch ; getchar, : ch = getchar( ),,, Enter, c1 a, c2 ( 36) D switch( ),, switch( ) case,,, case default, switch( ), default, default, switch( ), default, switch( ), ( 37) C for p[ 1] + p[ 2] p = &a[ 1] ; p[ 1 ] 6, p [ 2] 8p[ 1] + p[ 2] = = 14 ( 38) C sort for, i 0, j i + 1,, n sort aa 3,, 5 1, 2, 7, 6, 5, 4, 3, 8, 9, 10, ( 39) A sum : + a [ 2], a[ 2] = a[ 1] + a[ 3] = = 6 ( 40) A swap1, swap2 a[ 0], a[ 1], 3, 5 b[ 0] b[ 1] b[ 0] 5, b[ 1] 3 ( 41) A strlen, p[ ] = {a,b, c, p 3, p 3; q [ 10] = {a,b, c, q 10,, 3 ( 42) A C 5 ( 8 )

106 strcmp : strcmp( s1, s2), s1 s2 s1 > s2, 0( ) ; s1 = = s2, 0; s1 < s2, 0( ) : s1 s2,, p 5, :dcdbe>cd>abc>abbd>aabdfg ( 43) B f, p, p = str + strlen( str) /2 + 1 = 4, f( p, p - 2) p[ 4], p[ 2],, p[ 5] p[ 1], p[ 6] p[ 0], gfedcba ( 44) B f1 n* n, f2 2* ny1 = p2( p1( 2. 0) ) ; f1 f2, 8 ( 45) B,,,,, static,, f : i = 0 a = 3; i = 1, a = 4; i = 2, a = 5main 3, s = = 28 ( 46) D,,,,, ( 47) A :, 1, 1 ; 2, 2 ( 48) B :,, p s s[ 1] * p, * p s[ 1] ( 49) D ( &),, 1, 1; 0 ( ^),, 0;, 1a = 7 ^3 4, b = - 4& C 6 ( 8 )

107 ( 50) D rewind, : rewind( fp) ; ( 2, 40 ) ( 1) 1,, ; ; ( 2) 2, n f( n), T( n) = O( f( n) ), n, f( n), ; ( 3) 3, : ( ), ( Driver),, ( Stub),,, ( 4) : k, 2 k - 1 ( k1 ), : = 32( ) ( 5) 5 ; ( ),, ( 6) 688 x 210,, x ( 7) 7 2 if, c = a, c,, b a = 1, b = 2, c = 3, ac, b 2 ( 8) 8 p = ( double* ) malloc( sizeof( double) ) ; malloc : malloc( size) size, void, ( NULL), sizeof p C 7 ( 8 )

108 : p = ( double* ) malloc( sizeof( double) ) ; ( 9) : > > > > > x = f*, : x = f* x 20 ( 10) 10 10* t = n / = ( c = 50) ( c = 50 ), = n / = 50 x = f* 2, x = ( f = f* 2) ) = 20 n 2, i, t,, t i + 10* t, s 5, i > 5, ( 11) 1167 G a, b a =A+5-3=C, b = a +6-2=C+6-2=G, a 67, b G ( 12) 12 10, Sub, sub( x) 127, sub( 127) 19, sub( 19) 10, y, 10 ( 13) 13 * t strcatstrcat : strcat( s1, s2) s2 s1, s1 \ \0, s1 : s1 ( 14) 14 bcdefgha while t, ( 15) 15 n > = 1, f( aa, 5) f( aa, 4), f( aa, 4) f( aa, 5), 5 4,, 1, 0, f( aa, 0) 0, ( 16) 165, * p = s[ 0], * q = s[ 1], * r = s[ 2 ], q - > next - > num = r - > num = 3, r - > next - > next - > num = s[ 1]. num = 2sum = = 3, sum = = 5 ( 17) 17> = 1 18 i 4 4,, j 4, 4, 17 > = 1;, ( j - 1) * 4 + i ( 18) 19 a[ 0] [ i] 20 b[ i] [ 0] N N, N, a b 0, b[ i] [ 0] = a[ N - 1] [ i], a 0 b b[ i] [ N - 1] = a[ 0] [ i] C 8 ( 8 )

109 ( 1 ) 1 ( 2 ) 9 ( 3 ) 18 ( 4 ) 25 ( 5 ) 35 ( 6 ) 45 ( 7 ) 52

110 1) ( 1) D,, ( 2) B,, ( 3) C ; : - > - >, ABDECF ( 4) C,,,, ( 5) A,,, ( 6) B ( 7) A,,,,, ( 8) C,,, ( 9) B, ( 10) A, ( 11) C, 1

111 ( ),,, C, ( 12) C C, C, C c d,,, ( 13) B i ( 8 ), + + i 1, j ( 14) B C,,, A void ; C for case ; D sizeof ( 15) B C ; : = ; A a + + a + 1, ; C D B, B = =, ( 16) B, a / b( 8 /5 = 1 ), c, c 1. 4, ( c 1 ) ( 17) D C,,, ( 18) C printf( ),,, a 4,, 1234 ( 19) D A, B, C, D C ( 20) A scanf( ),, % B d, & ; C, a b, a b & ; D d c, ( 21) D * ,,, D, 2

112 22) B C, define ( 23) D int a 511, a b, printf( ), * b, a 511, 511 ( 24) C C ( : a > c? a: c; ) : a > c, a ; c printf( ),, 6 ( a > c? a: c a > c 5 > 6 c 6 ), ( a > b? 6: b), 6, 6 d, 6 ( 25) D break switch, break switch, switch break, switch, break, continue,,, i 0, while, if, if, continue; continue,,, i,, if, ( 26) A switch : switch case, case break, case, break switch, switch, break switch, switch, case break,, ( i = = 1) a 8, 2 ( i = = 2) a 16, 3 ( i = = 3) a 26, 4 ( i = = 4 ) a 31, i + +,, ( 27) A &&,! a! b! c, &&, && &&, &&,, d 1, 1 ( 28) B break switch while for for, 3, 3

113 break, while,, while, if,, break,,, i a 11;, i < 20,, if, else, i 10,, if, break,,, i a 21 32, ( 29) B cchar( ), ch, ch, ch s, s while p, ( \0 ), cchar ( ),, s, abc + abc = defdef ( 30) D C static,,,,, ; f( ) static i, f( ), i 1, s i, for, 5, f( ), a, a = 15 ( 31) A,,, \0, s : \ \ " 1" 4" 1" \141" a" b" c " \t, \0, 9 ( 32) C, int char,,,,,, ( 33) B 5 x, findmax( ) x, a, 5 n findmax( ) p s, s, p, 4

114 s ), ( * s) ( * p),, s, * s < * p * p > * s ( 34) B, ch [ 3 ] [ 5 ],, ch[ 0] AAAA, ch[ 1 ] BBB, ch [ 2 ] BBB, \ ch[ 1] \, BBB ( 35) A C, auto ( 36) A malloc( ) malloc( n), n, ( * ), D, malloc ( ) ; 4, ; A 2,, 2 2 ( 37) A , , 100 ( 38) B \, \\ \, r + ( 39) A A str, 5,, 6 ( \0, ) ; B str,,, str[ 6] ; C, ; D ( 40) A,, uu,, u1, 15 = 5 2,, 4, myaa,, = 12 ( 41) C C, &aa[ 0], &aa [ 0 ] + + ; A 1 aa [ 1 ] ; B, D aa, 1, 5

115 1] ( 42) A x, 9 a, f( a, 3, 7), a b, 3 7 m n f( ), for 2 :, i 3, s = s + b[ 3], b[ 3] a[ 3] 4, s 4;, i 5, s = s + b[ 5] ;, b [ 5 ] 6, s 10 s x ( 43) C 4 5 s, 5 ps, ps s s[ i] [ j] * ( ps + i) + j, s[ i] [ j] * ( * ( ps + i) + j) B a[ 3 ] [ 0 ] ; D s[ 1 ] [ 3 ] ; A ps + 1 ( ) ; C ps[ 0 ] [ 2 ] * ( ps[ 0 ] + 2) * ( * ( ps + 0 ) + 2), s[ 0 ] [ 2] ( 44) B b, t 1 t : i = 0, j = i t = t + b [ i] [ b [ j] [ j] ], t = t + b [ 0 ] [ b[ 0] [ 0 ] ], b[ 0] [ 0] 0, t 1 ;, 3, t 4 ( 45) D strcpy( ), b1 b2, b1, pb, b1 [ 3 ] while, 3 : - - pb > = b1, pb b1 + 2, strcpy( b2, pb) ;, b2 cdefg ; - - pb > = b, pb b1 + 1, strcpy( b2, pb) ; b2 bcdefg - - pb > : b1 pb b1, strcpy( b2, pb) ; b2 abcdefg b2, 7( : while, - - pb, pb 1, ) ( 46) D : int* : int( * [ ], : int( * ) ( ), : int* ( ) f( ) ( 47) C,,, ;, (, ), C ( 48) C x 3, 6

116 2, incre( ) incre( ), x 1, x* = x + 1, x 2; incre ( ), 2, x* = x + 1, x 6, x 6 ( 49) D p a, q c c a b, a c, ( * p). next = q, c b, ( * q). next = &b ( 50) B typedef, P ER, PER ( 1)1 ( 2)2,, ( 3)3, ( 4)4,,, ( 5)5,, ( 6) , scanf( ), a 58 if,, a = 58 > 50, if, 58; if,, a = 58 > 40, if, 58; if,, a = 58 > 30, if, 58, ( 7)7 261 o, ( 8) a, a = a + a = = 16, 16 ( 9)9 0 >, a > b > c; 7

117 ( 10)10 struct node*, struct > b 1, 1 c, 0 link, link, struct node ( 11)11 5 node* link, for ;, for, s s i 0 1,, 1 < 3, i + +, s + = i, i s 2 1,, 2 < 3, i + +, s + = i, i s 3,, 3 < 3, ( 12)12 efgh p, r q q = ( long* ) p; p q, q + + ;, 4, r = ( char* ) q;, q r, r e, r, efgh ( 13)13 abc \0,, \0, s s[ 3] \0, 3 abc ( 14)14 7 x 0,, sub( &x, 8, 1) sub( &a, 4, 2), sub( &a, 4, 2 ) sub( &a, 2, 4), sub( &a, 2, 4) 2 < 4, if,, * a + = k; x = x + k = = 4, sub( &x, 4, 2 ),, x = x + k = = 6, sub( &x, 8, 1), x = x + k = = 7, 7 ( 15)15 c, z, c ( 16)16! feof ( fp) :,, 1,,, fname. dat, fp,,, 8

118 ,,! feof ( fp) ( 17)17 row 18 a[ row] [ colum], select( ), row, colum, row colum,, n, a [ row] [ colum] ( 18)19 * ( str + i) str [ i] 20 i str : i, 0, i, \0, i 1, \0, i, i * ( str + i) ; i ( 2) ( 1) D 5,, ( 2) A : : 1 ) ; 2 ),,, ( 3) D, : - > - >, DEBFCA ( 4) A 3 : ( 5) D,, ( 6) D ( 7) B, 9

119 8) B, ( 9) D E - R, E - R, E - R, ( 10) D,, E - R, ( 11) A, C,, ; C, ;,, main, main ( 12) C C, : 1 ) : ( ) 2 ) : e( E ) ( e E, ) A, 5 E2. 0 E 2. 0 ; B, E ; D, E ( 13) B C,,, long C, 3Dmax, C, ; A. dat. C ( 14) A , A ASCII ( 15) C, =, A, ( i = 2, + + i), n; B ; C + + ( i + 1) ;, ( i + 1 ),, + +, ; D ( 16) D, ( int) a, 5. 5, 5, b /b, 2. 5 /2. 5, , ( ) ( 17) C scanf, 10

120 ,, A, % 2 d% 2 d% 2 d,, 1, 2, 3 ; B, % d % d % d, ; D, i = % d, j = % d, k = % d, i = l, j = 2, k = 3, i, j, k 1, 2, 3 ( 18) C, x n pow( x, n), pow( x, n) ( 19) B x,, % 1d ; C,1d d ( 20) C,,, i* = k i = 2* 2 4, k = k + i, k 6, m = k m = 6 ( 21) D, &&! ( x + y)! ( 3 + 7),, 0 z, 1, , && y + z / /2 6, 4&&6, 1 ( 22) C if else, A : x > = 0, y 1,, x = 0, y 0, x < 0, y - 1, ; B : y 0, x > 0, y 1,, x < 0, y - 1, ; C : x > = 0, x > 0, y 1, x = = 0, y - 1; x < 0, y 0 C D : x > = 0, x > = 0, y 1, y 0, x > = 0, y - 1, ( 23) A k = n + +,, n k, n 1, k A k n, n 1, k, ; B n 1, n 1 k, k 1, ; C + + n, + + n, n 1, n + l k, ; D k = k + ( n + 1), k, ( 24) A for,,, 4 0, sum = 0. 0 ; ( 25) D do - while, do - while : 1 ),,,, while 2 ) do - while,, 11

121 ) C do - while, while p! = 12345&&n < 3( p n 3), : p p n 3 A : p n 3 while ; B : p n 3, ; C : p n 3, ; D : p n 3 ( 26) A switch break, break switch a% 3, 15 % 3 0; case 0: m + + ; m 1, m 1; break ; switch, m 1 ( 27) B C,, int, ( 28) D n 2, p n, q A p q, ; B * p = * q * q p n, ; C * q n, ; D p,, n n, ( 29) B fun( ),, float fun( ), a + c b, int 15, a - c, 9, float % 3. 0f, 9 ( 30) D C,,,,, a b, A a, fun( ), b a fun( ), fun( ) ( b 1) ( b), fun( ), fun( ) a( a A ), fun( ) d b, B,, a, b, fun( ),, A, b b, B, A, b 12

122 31) C 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, sort( ),, sort( ) n a,, &aa [ 3], aa [ 3] a, aa[ 3] 5, aa [ 0] aa [ 1 ] aa[ 2 ] aa[ 8] aa[ 9] sort( ), for aa, sort( ) aa [ 3 ] 5, aa[ 0] aa[ 1] aa [ 2] aa[ 8 ] aa [ 9 ], 1, 2, 3, 8, 7, 6, 5, 4, 9, 10 ( 32) B, f( ) : f( n) = 1 n = l; f( n) = f( n - 1) + 1 n 1 ; for f( i) : i 1, f( 1) 1, i, i 1 i 2, f( n), f( 2) = f( 1 ) + 1, 2 j, j 3 j 3 ( 33) D a,,, 9 sizeof( ) i( sizeof( ) ), i 9 strlen( ) j( strlen ( ), \0 ), j 8, i, j 9, 8 ( 34) A reverse( ) n a reverse( b, 8) ;, b, b 8, 7, 6, 5, 4, 3, 2, 1, 9, 10 for 4, b[ 6] b [ 7] b [ 8 ] b[ 9 ] ( ) s, s 22, s 22 ( 35) B C, aa, s for 4 aa[ 0] [ 1] aa[ 1] [ 1] aa[ 2] [ 1] aa[ 3] [ 1] ( 2, 6, 9, 2 ) s, s 19, s 19 ( 36) D p,, printf( ) p \0, \0, 5 ( 37) C, typel. h #include" typel. h" i = M1 + M2 i = 5* 3 + 5* 2 i = 25, i 25 ( 38) A d1. dat, fprintf( ) i j d1. dat, d1. dat 20 < > 30 < > 13

123 , fscanf( ) k n,,, k 20, n 30 ( 39) D, ;,, ; fread( ) ; C FILE ( 40) D,, ( argc ), ( argv),, argc 4, argv[ 1 ] argv[ 2] argv[ 3 ] ( " abcd" " efg" " 10" ), len, len 9 len 9 ( 41) C f( ) 3 f1 f2 x, f1 f2 f( fa, fb, 2), f( ) f1 fa, f2 fb, 2 x f( ) return fb ( 2 ) - fa( 2) ( fb( 2) 2* 2* 2 = 8, fa( 2) 2* 2 = 4 ) ( 8-4), 4 f( ) 4 i, i 4 ( 42) A a a, ( ), ( ),,,,,,,, s 0, { a 5, s + = a + + ; a 1, a + +, s = s + 5, s 5,, { a, a { 3, { s + = a + + ; s = s + ( a + + ) ; s = 5 + 3, 8, s 8 ( 43) B ss( ), s; t while, s t,, * s = t - a + A ; (, ) ss( strl, c), strl d, ( 44) B, for {20021 ", 90, 95, 85" = 270 sum 270, % 6. 2f \n

124 45) C data, a, a : data. a, p : p = &data. a A, a p, a, ; B p = data. a, ; D * p = data. a a p, p data a ( 46) D p, q, r, q - > num 20, q - > next r, r - > num 30, q - > next - > num 30,, q - > num + q - > next - > num = 50 ( 47) B INTEGER, p * q,, p int, q, int ( 48) D a : , Ox , b, b 11, b : , c, c 22, b, c 11, 22 ( 49) A p q, malloc ( ) 20, p, p q, p q scanf( ) p q, abc p,,, def q, p q def, def, def ( 50) C strcmp( 1, 2) 1 2, 1 > 2, 0 ; 1 < 2, 0 ; 1 = 2, 0 strcpy(,, [ ] ),,, f( ) n n p, f( ),,, dcdbe,, p[ 0 ], p[ 0] 5 ( 1)1,, ( 2)

125 k, 2 k - 1, 6 32 ( 3)3, ( 4)4 - ( E - R ) - ( E - R ) E - R, ( 5)5, ( 6)6 k 7 * k scanf( ), (, % ) (,, ) scanf( ),, kprintf( ), (,, ) (, ) printf( ), * k ( 7)8 20, 0 x y t, 10, 20, 0, if, if, x = = y10 = = 20, t = x, if, x = y; y = t; x 20, y 0, x, y 20 0 ( 8)9 17 break switch, break switch, switch break, switch, break, continue,, x 15, x > 5&&x < 50, x > 5&&x < 50,, x + + ;, x 16,x /3 5, x + + ;, x 17, break,, x 17 ( 9)10X c, while, while, Y c,?, 16

126 X while,? c,?, ( 10)11 3, 2, 2, 3 x y, 2 3, fun( ), fun( ) x y x y, fun( ), x y, fun( ) 3, 2 fun( ) x y x y, 2, 3, 3, 2, 2, 3 ( 11)12 /i * 1. 0 / i * ( 1. 0 /i) /( double ) i double s fac, , s fac, i i - 1, i i - 1 i /i ( 12)13 a [ row] [ col] > max a[ row] [ col] > = max max < = a [ row] [ co1] max < a[ row] [ co1 ] 14 max < min min > max max < = min min > = max for, row col max min, row, col, max, min, max 0, max max max,, max a [ row] [ co1] > max a[ row] [ co1] > = max,, min 0 max,, min max, max, max min, max < min min > max,, min ( 13)15 * t t[ 0] 16 * s - * t * s - t[ 0 ] s[ 0] - * t s[ 0] - t[ 0] strcmp( ), :,,, \0, ASCII * s * t \0, * s * t, * t * s - * t ( 14) , i1 = 1000 /10* 10 i2 = 1000 /( 10* 10 ), i1 = 1000, i2 = 10, i1 i ( 15)

127 q x y, swap( p, q), p q a b, a b x y swap( ) a b, a b, x y ( 16)19 80 a,,, 44 = 16,, a 516 = 80, s 80 ( 17)20 " d1. dat", " rb" " d1. dat", " r + b" " d1. dat", " rb + " fopen( " ", " mode " ), " mode ", mode : " rb" " wb" " ab" " rb + " " wb + " " ab + " " r" " w",,, " a",, " r + " ( ) " w + ",, ( ) " a + ",,, ( ), " d1. dat", " rb" ( 3) ( 1) D ( 2) B, ( 3) B : m 2 m 1 ( 4) B,,,,, ( 5) B ( 6) A,,,,, ( 7) C :,, 18

128 8) A, ( 9) B, ( 10) D,,,, ( 11) C C, ;, C, ;,, C ; ( 12) A 3 ( 13) B C ( ), main ( ),, C, main ( ) ( 14) D C,, C ( 15) B C, C :, ( 16) A, m, n m, n, ( 17) D C ,, float double ( 18) C C m - = n m = m - n,, 0 ( 19) A scanf( ) % d,% c, m, A c, 10 n, 10, A, 10 ( 20) A for 3, i 0, switch, case, default printf, 0; i 1, switch, case, printf, 1, break,, 1, i 2, 19

129 , 2 ( 21) C if, && j + +, 1 ( j 2),, k + +, k 2 && i + +, 1 ( i 2),, i j k ( 22) B C else if else if, else if if a > b > c, a > b 1, 1 > c 0, else if,c - 1 > d, 1 1 = = 1, printf ( 23) D p, while, i 0, p[ i], p[ i] % 2 0, &&,, i = 2, p[ i] = 14, while,, k = p[ 0] + p[ 1], k = k 24 ( 24) A do continue, if, i% 2, i,,, i 1,, i,i% 2, i + + ; s + = i i , , s, 16 ( 25) B , ;, 1 1, i ,+ + j 2, 10 2 ( 26) D,, a = \, \, \ \, B = \ xbe ;, ; c = \0xab;, x, 0 x d = " \0127" ;,, ( 27) C f1( ) x y, f2( ) x y, f1( ), a b c d, f2 ( ), a b c e d 5, f 4, e 3, d f e ( 28) D C,, f( ),, 3 f( ),, a b c ( 29) A 3 p q w, p a, q b, q w, w b, NULL q, ( ) ; 20

130 ) ; A q, ( 30) B f( ), x y,, x y p q, a b, f( ),, r p ( a ), * p * q* r ( 31) C 3 s, s[ 0 ] one, s[ 1] two, s[ 2 ] three, p = s[ 1 ], p two, * ( p + 1) w ( 32) B, s = x + 3, s x[ 3], s[ 2] * ( s + 2), x[ 5] 0 ( 33) D A, N, C C,,, C, C, ( 34) C k 2, 3, m[ 2] [ 0] m[ 2 ] [ 1 ] m[ 2] [ 2], 3, 6, 9 ( 35) C scanf( ),, scanf( ),,, i, i 1,, i = 7 7,, ( 36) C,,, 6 ( \0 ) 5 printf 5, 6 ( 37) C fun( ) s1 s2, while, : s1 [ i]! = s2 [ i] ( ) : s1[ i] s2 [ i] \0 ( ), return, 1, 0 ( 38) B,, ;, ;,, ; auto, static 0 ( 39) A STD,,, C 21

131 , {, ( 40) C, u1,, n c, u1. c A, u1. n A, u1. n,, A ( 41) C while, ps xyz, for, ps - -, ps z, puts( ps) z ; ps - -, ps y, puts( ps) yz ; ps - -, ps " x", puts( ps) xyz, ( 42) A 3 pa, 2 3 a, pa, a[ i] [ j] pa [ i] [ j] for 3 : i 0, pa[ 1] [ 0] = pa [ 1 ] [ 0 ] - 1, a[ 1] [ 0 ] 3; i 1, pa [ 1 ] [ 1 ] = pa [ 1 ] [ 1 ] - 1, a[ 1] [ 1] 4; i 2, pa[ 1 ] [ 2 ] = 1, a[ 1] [ 2 ] 1 printf = 7 ( 43) A fun( ) 3, a,, i j, i j, a[ i] a[ j],, a, i j fun( ), a a [ 0] a[ 5], a[ 1] a [ 5 ], ( 44) A argc, : argv, argc 2, argv[ 0 ] exam, argv[ 1 ] 123, while 3, 3 fun( ) : fun ( ), s 0, 1, n 1; fun( ), s 1, 1 2,, n 2;, n 3 n* argc 6 ( 45) C A, p, fun( ) p p, p s,, s, p B p fun( ) s; C fun( ) p, p, ; D p, p, fun( ) p, C 22

132 ( 46) D : typedef * D ( 47) B A &( * p). age std[ 0 ]. age,, C, D sex,,, B std. name, std,, name ( 48) D ( 2 + x) , ( - 3) , ( ), ( 49) D C ASCII,,, ASCII,, ASCII,, ( 50) A stdin,,,, fgetc ( ), fopen ( ),,,, fout = fopen( abc. txt, w ) ; fopen( ), " w", fout = fopen( " abc. tx", " w" ) ; ( 1)1 ( 2)2 ( 3)3 ( 4)4 4 : ( 5)5,, ( 6)6-3,, - 23

133 9% 4-3, - 3 ( 7)7 i = 0, j = 20 scanf( ),,,,, i =, j =, 0 20, i = 0, j = 20 ( 8)8 1 if,, a! = 0, 1, 1 p, 1 ( ), printf, 1 ( 9) if,, if, else a < b, t = a, a = b; b = t;, a 3, b 0 a < c,, 3 t = a; a = c; c = t, a 5, c 3, ( 10)10 58, i, j 0, ; a[ i] [ j] 0, 0 ;, a[ i] [ j] s 0 0 s ( 11)11 7, ASCII H - A, 7, 0 7ASCII, 7 ( 12)12 9 f( f( 3, 4), f( 3, 5 ) ) d f( 3, 4), f( 3, 4 ) ( 4-3 ) * 3 = 3, f( 3, 5) ( 5-3 ) * 3 = 6, f( f( 3, 4), f( 3, 5) ) f( 3, 6 ) ( 6-3) * 3 = 9 d 9, 9 ( 13)13 x[ i] [ i] 14 x[ i - 1 ] [ j - 1] + x[ i - 1] [ j] x[ i - 1] [ j] + x[ i - 1] [ j - 1] 0 1, 1 x[ i] [ i],, 0, x[ i - 1] [ j - 1] + x [ i - 1] [ j] ( 14)15 s [ i ] < 0 s [ i ] > 9! ( s [ i ] > = 0&&s [ i ] 24 < = 9 )

134 isdigit( s[ i] ) = = 0 s[ i] > 9s[ i > 0! ( s [ i] < = 9 &&s[ i] > = 0 ) * ( s + i) < 0* ( s + i) > 9! ( * ( s + i) > = 0 &&* ( s + i) < = 9! ( isdigit( * ( s + i) ) ) * ( s + i) > = 9 &&* ( s + i) < = 0! ( * ( s + i) < = 9 &&* ( s + i) > = 0 isdigit( * ( s + i) ) = = 0 16 \00 NULL,,, s[ i],, s[ i] < 0 s[ i] > 9 \0 ( 15)17 findbig f,, findbig ( 16)18 16, MCR A( i) 2 * i, MCRA( j, 2* i) 2* 2* j + 2 * i, 16, 16 ( 17)19 x. link = &z; x. link = y. link; x. link = x. link - > link; x. link = * ( x. link). link;, y, x y, z x, x z z y, y x ( 18)20 Hell fgets( ) 3,, ( n), n - 1 0,, : Hell ( 4) ( 1) D, ( 2) B :, 25

135 ) ; 2 ),,, ( 3) C, : - > - >, ABDCEF ( 4) A, ( 5) A,,, ( 6) A, ( 7) C, : ( 8) D, ( 9) A, * ( 10) D ( 11) A C C,/* /, C,, C ; C, {, { ; C, C,,, ; C ;, ( 12) C C,, A ; B,, 0 7, B, 8; C ; D, 0x ( 13) D C,, 1 D int C, ( 14) B a, c 10, f double x, a = f / = c* = ( x = 6. 5),, 6. 5 x( 6. 5 ), x 26

136 . 5, c* = ( x = 6. 5) c = c* ( x = 6. 5), c 65, f/ = c* = ( x = 6. 5 ), f = f /c a = f, a, a f 1 a c f x ( 15) D D, C ( 16) C,, k = ( n = b > a),2 > 1, n 1, k 1,,, m 0, 1, 0 ( 17) A scanf( ), ;, scanf( ),, % d, % d,, ( 18) D, 1, 2, 2 ( 19) C, A 0. 5 /100. 0, ; B D, ( 20) C A if 3 < 1, else, else if - else, if - else if 2 < 1, else, 3 x B if 1 < 3, else x = 3, else, x 3 C, if, 1 < 3, if x = 3, if, 1 < 2, if x = 2, if, 1 < 1,, x 2 3 D, if, a < b, if x = b ; if, b < c,, if x = c, if, c < a,, x c 3 ( 21) B, s 2, s s + = 1;, s 0, s 2,, do - while, do - while, do, while s + = 1;,, while, n = - 3 a! = n 27

137 22) B for c c, s 1, s s + c s a ( 23) C for, continue, continue, continue, for n 1( 1), if, if ( 1% 3! = 0), continue, for, for ( n < k), n + + ;, n = 3, if ( 3% 3! = 0 ), if k - - ;, k 3, n < k, for k n 3 3 ( 24) C n, 1 / n 0, 0,, 1 /n 1 n, , 1. 0 /n 0,, s = s + l /n ( 25) A, A \ \ \ ; B ; C ; D ( 26) D C,,, ; ( ), ( ) ( 27) C A y m ; B 2,, fun( ) 2,, ; D, ( 28) A, fun( ) : a b, a 1 p1 p2, c1 c2 p1 p2 a b fun( ), p1 p2, p1 1, c2 1 b, c1, A ( 29) D A i, NULL, scanf( ), i, A i NULL, i, i, scanf ( ), i, scanf ( " % d", i) ; B f NULL, NULL, ; C t m, c t,, * c = &t; 28

138 * ( 30) A C NULL ASCII 0,, 0 ( 31) C, B D, C,,, ASCII, C A,, 9, 7 ( 32) D, ; ; struct ( 33) B : struct { ; 3 :,, : { ;,,, : struct student{ ; student ;,, : struct student{ ; ( 34) B A, C,,, ; C, ; ( 35) D :,, A 8, \0, 7;, {,, : char* p = " student" ;, : p = " student" ; ( p ; ) ( 36) C return, * p, * pp ( 37) B B,, B ( 38) A, ( a + + ) * ( b + + ), a + + 3, b * 4 = 12 ( 39) D 4 x y z r, x y z 3 8 6, fun( ), r fun( x, y) 29

139 * z fun( ) fun( x, y), x y a b, a b 3 8, if, if a > b, else, 8, fun( x, y) 8 2* z = 12, r r = fun( 8, 12 ), fun( 8, 12 ) 12, r 12 ( 40) B,,, : * [ l], : l, ( 41) A, ASCII, scmp( ),, for, abcd abba abc, str [ 0 ] str [ l], str[ 0], strcpy( ) str[ 0 ], string, string str[ 2], string, string abcd ( 42) B data[ 2], data, p, p - > x data[ 0]. x 10, + + ( p - > x) 11 ( 43) C, a, b c, c b, b a, * * c a ( 44) C strlen( ),, str [ 0 ] = " Hello" str [ 1 ] = " Beijing", p, str[ 0], C,, p + 20 str[ 1], strlen( p + 20) ; str[ 1], Beijing 7, 7 ( 45) A fun( ), while, while * p2 = * p1 p1 p2, \0,,, p1 p2, p1 \0,,, p1 p2 ( 46) D &,, 1, 1, 0;,, 0 1, 1 0 prinf( ),& 1( 3 /2 = 1) 30

140 000000l, &, & z , , &, & , 0 ( 47) A feof( ),,,,,, feof( ), fp, 0, 0 fp, 0 ( 48) D C :, ( 49) B 3 3,, for, a [ 0] [ 0 ] = 1 a [ 0 ] [ 1] = 2 a[ 0 ] [ 2 ] = 3 a[ 1] [ 0 ] = 4 a[ l] [ 1 ] = 5 a[ l] [ 2] = 6 a[ 2] [ 0 ] = 7 a [ 2 ] [ 1 ] = 8 a[ 2 ] [ 2 ] = 9 ( 50) A q r, p r, r q, q r A r q, r B q r,, p r, r q, C p r, q r, r q, D q r,, r q, p r, ( 1)1 ( 2)2 : 1 ) ; 2 ) ( 3)3 ( 4)4 31

141 5) 5 ( 6)6 3?, :,, :,, p% 3, 0, p /10 3, p /3 10, 10? 3: 0, : 3, 3 ( 7)7 B ASCII,,,,b ASCII 98, m ASCII = 130, b ( 8)8 yes ifelse,, if c = a + b ( c = = 4 ),, s1, printf( " yes \n" ), yes ( 9) for, for switch, for, i = 9, i/10 = 0, switch case 0, m n 1, 1 1, break, switch ; i = 10, i /10 = l, switch default, k n 1 1 2, switch ; i = 11, i /10 = 1, switch default, k n 1 2 3, switch, ( 10)10 6, i, j, 4 i = l, ( 2 < = 1 ) i = 2,, #; i = 3,, #; i = 4,, #; i = 5,, 6 # ( 11)11 - f f* - 1-1* f f* ( - 1) ( - 1) * f 12 fun( 10) fun( ) m, fun ( ) fun( ) n,, fun( 10), fun( ), for, n, i, m m = [ ( - 1) i - 1 ] * i, fun( ) f, - f f* * f f* ( - 1) ( - 1) * f

142 12) , n, for,, n[ 1 ] = n[ 0] * = = 1, printf 1, i 1, i < = 4,, , i < = 4, ( 13) ,,,,,,,,,,, a[ ] [ 3] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 3* 3, for( i = 0; i < 3; i + + ) for( j = i + 1; j < 3; j + + ) a[ j] [ i] = 0; i j a[ 1 ] [ 0], a[ 2] [ 0], a[ 2 ] [ 1 ] 0, for( j = 0; j < 3; j + + ) printf( " % n", a[ i] [ j] ) ; printf( " \ n" ) ;, ( 14) , int a = 5 a,, ; ( static ), fun( ) static int a = 10 a, a, ; C,, auto, auto, auto, int c = 20 c, c a + = b + + a = a + b, b = b + 1, printf( " % d", a) a = a + b = l = 30, printf( " % d", a ) a = a + c = = 25, ( 15)16 double max extern double max,,, : (, ) ; max( ), max( ), extern 33

143 , double max( extern double max) ( 16)17 cdeab move( ), str,,,, for move ( ), i = l, move ( ), s abcde eabcd, i = 2, move( ), eabcd deabc, i = 3, move ( ), deabc cdeab, cdeab, cdeab ( 17) fun( 6), 6 /2 > 0, fun( 3 ), fun( 1), 1, 3, ( 18)19 sizeof( struct node) 4 C malloc( ) void *, : malloc ( size) size unsigned int, sizeof( struct node) 4 ( 19)20 s[ i] > = 0 &&s[ i] < = 9 isdigit( s[ i] ) s[ i] > = 48&&s[ i] < = 57 s[ i] < = 9 &&s[ i] > = 0 9 > = s[ i] && 0 < = s[ i] 0 < = s[ i] && 9 > = s[ i] s[ i] < = 57 &&s[ i] > = > = s[ i] &&48 < = s[ i] 48 < = s[ i] &&57 > = s[ i], C,,, ;,, C \0, char s[ 80], d[ 80] ;, 80 gets C, ( ),, s, s, ASCII, ASCII 48 ( 0 ASCII ) 57 ( 9ASCII ), 0, 9, d,, s ( 0 ) \0 d, puts d s[ i] > = 0 && s[ i] < = 9isdigit( s[ i] ) s[ i] > = 48&& s[ i] < = 57 s[ i] < = 9&& s[ i] > = 0 9 > = s[ i] && 0 < = s[ i] 0 < = s[ i] && 9 > = s[ i] s [ i] < = 57 && s[ i] > = 48 &&48 < = s[ i] 57 > = s[ i] 34

144 5) ( 1) C,, ( 2) C,, ( 3) D, : - > - >, DBEF CA ( 4) D, GOTO, ( 5) D,,, ( 6) A A ( 7) B 4 : ( 8) C, ( 9) D, ( 10) D ( 1 : 1 ), ( 1: m m: 1), ( m: n) ( 11) B, 5 : 1 ), 2 ),,, 3 ) 4 ),, 5 ) ( 12) B C, 35

145 : 1 ),,,, ; 2 ),,, ; 3 ), ( 13) C,,, C,,, A , B ( 14) A, (, - max - ), C 32 (, int, ) B - max ; C 3COM ; D int C ; A ( 15) C =, =,, = =, A %, A ; B, C ; D 3 ( 16) D,, #define d 2 d 2, d ( 17) B C B 1 2, 1 /2 0, 0, ( 18) C, printf( " % 2d, % 2 d \n", x, y), 2, C :, ( 19) D C,,,, D if( b = = 0) m = 1; n = 2; ( 20) A scanf( ),, C,, &, a pa, pa 36

146 B a &a; C &pa pa, pa a ; D * pa pa, ( 21) A?, :,, :, a > b b > c, k = l, k = 0 ( 22) C switch : switch case, break, case, break switch, switch, break switch, switch for switch, scanf( ) k, switch for 2, i = 1, 0, k 0, switch case: 0, another, case: 0 number, switch, i = 2, 1, k 1, switch case: 1, number, switch i = 3 another number number ( 23) B x y z 0 5 3, while z - - > 0&& + + x < 5, z 3, Z - - 3, z - - > 0, x 0, + + x 5, + + x < 5,, z - - > 0, 3, y = y - 1;, while, x y z 3, 2, - 1 ( 24) D i 1, 2, i 1 10, s + = i + 1, s = s + i + l, s s 1 10, i < 10 i = 1, s = = 2; i = 3, s = = 2 + 4; i = 5, s = = ; i = 7, S = = ; i = 9, S = = ; i = 11, i < 10, ( 25) D dowhile : do, while ( ), do,,, ;, while, dowhile ; %, continue,,, i = 2, do if, continue,, while, while, n + +, n 1, i = 3, do if( 3% 3), n + +, n 2,, while, while, n + +, n 3; i 37

147 4, do if( 4% 3 ), continue,, while, while, n + +, n 4 ; i = 5, for, n 4 ( 26) A,,, : (, ) ;,,,, A double myadd( double a, b), b ( 27) D fun( ) x y, fun( ), a b c, fun( fun( a, b), fun( b, c) ) fun( a, b) fun( b, c) fun( a, b), a > b, b 8, fun( b, c), b < c, c 7, fun( fun( a, b), fun( b, c) ) fun( 8, 7), 7 ( 28) D,,,,, C : &, *, * p p n, 0, p n, q p, A 1 p ; B 2 * p; C p, q ( 29) C C else if, f( ) v w x y z if - else else if, else if x, y, z v w,, if f( ), x y z x y z ( 30) D C :, 10 a, a, 0, a[ 0] a, a[ 1 ] a + l, a + l a 1, a + i a[ i], * p = &a[ 3 ] p a[ 3 ], p a 4 4, p[ 5 ] a 9 a[ 8],, p[ 5 ] = 9, b = 9 ( 31) C, a, b 38

148 0, abcdefgabcdefg a 7, a b 10, b 10, sizeof( ) a b 8 10 ( 32) B,,,,,,, ;, swap1 ( ) c,, c a c, a 5 2 swap2( ), b, 3 5, ( 33) A sum( int * a ) : a a[ 1] a[ 0 ] 10, for, 3 i = 2, sum( &aa[ 2] ), &aa [ 2] a, a aa[ 2 ] aa [ 3], aa[ 3] aa[ 2], aa [ 2 ] = aa [ 3 ] = 4, i = 1, sum( &aa( 1 ) ), &aa [ 1] a, a aa[ 1 ] aa[ 2], aa [ 2] aa [ 1 ], aa [ 1] = aa [ 2 ] = 4; i = 0 : sum( &aa [ 0 ] ), &aa [ 0] a, a aa [ 0] aa[ 1 ], aa[ 1] aa[ 0], aa [ 0 ] = aa[ 1] = 4; aa[ 0] 4 ( 34) D, f( ) for,, b[ 0 ] [ 0] b[ 1 ] [ 1 ] b[ 2] [ 2] b[ 0] [ 3 ] s, s 4 4, f( a) f( a) a [ 0 ] [ 0 ] + a [ 1 ] [ 1] + a[ 2] [ 2] + a[ 1 ] [ 3] = = 16 ( 35) B gets( ) gets( str_adr) ; str_adr gets ( ),, 10, b, agets a[ 0 ] a ( 36) A 10,, strlen( p[ 4] ) cd 2 39

149 37) C, a a s 0, a 5, a,, f( &a) ( a, 1, 5, a 1 6 ), s s 5,, f( &a), a, 2, s s 7, s 7 ( 38) A, i = 4 + 4* /2 + 2* 2 + 2, i 28 ( 39) B struct { ; 3 : : : struct { ;,, : struct student{ ; student ; :, : struct student{ ( 40) A STU, num f1 f2 f1, f2 a b, f1( a ), f1, a, f2( &b ),, b {SunDan, 2044, a. num b. num ( 41) A & 1, 1, 0, 1, 1, 0 0 a b 7 0 ( 42) B 4, for, *, *, *, 7 *,, for *, : *, 2, 1, * 2, *, 2* i - 1 ( 43) C sort( ) aa 10, sort( ), aa,, , for aa l 10 40

150 44) C A ; B t, s t; C 10,, ; D 10 s, abcdefg ( 45) D argc, ; argv, argc 5, argv[ 0] ex, argv[ 1 ] abcd, argv[ 2] efg, argv[ 3] h3, argv[ 4] k44, for 2, i = 1, len = 0 + strlen( argv[ 1] ), argv[ 1 ] =abcd, len 4 ; i = 3, len = 4 + strlen( argv[ 3 ] ), argv[ 3] =h3, len 6; i = 5,, len 6 ( 46) A C,,, f( a, i, j), i < j, a [ i] a [ j], f( a, i + 1, j - 1), a[ i + 1 ] a [ j - - ], i = j, 5 aa, f( a, 0, 4), a, for aa ( 47) C STU, 10 num Score, 5 s, p t, s p for p Score p[ 1] - > Score 550, s[ 1]. Score 580 ( 48) B struct NODE, p q r, malloc p q r, p q r num 1 2 3, p q, q r, r NULLq - > next - > num r num 3, p - > hum p num 1, s = 4 ( 49) B fopen( const char * filename, const char * mode), mode filename ; fclose( FILE* fp) fp ; fscanf( FILE* fp, const char * format[, address, - - ] ) format fp, address fprintf( FILE* fp, const char* format[, argument, - - ] ) argument fp : fp, fopen w d1. dat, for, fprintf i 41

151 , 3, fp 123, fclose fp fscanf fp k n, fp 123, k 123, n, k n 123 ( 50) D fopen( const char * filename, const char * mode ) mode filename ; fclose( FILE* fp) fp ; fscanf( FILE* fp, const char* format[ address, - - ] ) format fp, address fprintf( FILE* fp, const char* format[, argument, - - ] ) argument fp ; fwrite( void* ptr, int size, int n, FILE * fp ) ptr sizen fp fp, fopen wb data. dat, for, fwrite a [ i] fp, 4, fp 123, fclose fp fopen rb data. dat, fseek fp 2 int, fread fp int b, b 3, b 3 ( 1)1 ( 2)2,,,, ( 3)3,, ( 4)4,, ( 5)5, ( 6)6 B 66 printf,, :, printf( " % c% d \n ", ch, ch) ch, B ACSII 66, B 66, B66 ( 7)7 n1 = % d \nn2 = % d \n n1 = % d \nn2 = % d n1 = % 2d \nn2 = % 2 d \ n 42

152 1 = % 2d \ nn2 = % 2d printf :, :,,, %, n1 = n2 =,, n1, n2, % d, % d, \ n, n1 = % d \nn2 = % d \ n n1 = % d \nn2 = % d n1 = % 2d \nn2 = % 2dn n1 = % 2 d \nn2 = % 2d ( 8)8 0 for 6, i, i = - 1 for t 5* 4* 3* 2* 1* 0 = 0 ( 9)9-4 ifelse,, if( ) S1 ( if ) elses2 ( else ), :, (, ), if ( S1) ; (, 0), else ( S2 ), n = 0, (! n), x = x - 1 = 2-1 = 1; m = l, ( m), x = x - 2 = 1-2 = - 1 ( x), x = x - 3 = = - 4 ( 10)10 12 ASCII, C, ASCII,, n1 = h1-0 = 1-0 = = 1, n2 = n1 * 10 + ( ch2-0 ) = 1* 10 + ( 2-0) = = 12 ( 11)11 8 4, ;, f( y, * x) y x, x y y, x,, y, x, y 4, x 8 ( 12)12 m = fun( a, 4) + fun( b, 4) - fun( a + b, 3) ; fun( x, n) x n, a 4 fun( a, 4), b 4 fun( b, 4 ), a + b 3 fun( a + b, 3),, C m = fun( a, 4 ) + fun( b, 4) - fun( a + b, 3) ( 13)13 j < i 14 a[ i] [ j] = a[ j] [ i] n n A,, j < i, 43

153 ( 14)15 * t + + * ( t + + ) = a[ j] [ i] strl str2, str2 abc&fgh, sstrcpy( strl, str2), str2 strl sstrcpy( * s, * t), while, t s, s t * t ++ * ( t + + ) ( 15)16 efgh ss s p str, abcdefgh, ss, str s,, str abcdefgh, efgh, p( p ss( str ) ) efgh ( 16)17 6 : f( &a, n) = a[ 0 ] + f( &a[ 1], n - 1 ) n > l f( &a, n) = a[ 0 ] n = 1 3 aa f, s = = 6 ( 17)18 3* sizeof( double) size( double) * * 8 8* 3 malloc( ) malloc ( n ), n,, ( * ), ( 18) Shangxian if a. name b. name d, if c. name d. name d strcmp strcmp( ), 0, 0, 0,,,, if strcmp( a. name, b. name) > 0, b d, if strcmp( c. name, d. name) > 0,, d b, d. sno p - > name 2002 Shangxian ( 19)20 a = 1 ; b = 1; s = 1; ( : ) a = b = s = 1; ( : ) a = 1, b = 1, s = l( : ) a, b, s

154 s, :, i, a,, 1, b,, 1, s, 1,, for s,, a b s, a = 1; b = 1 ; s = 1 ; ( : ) a = b = s = l; ( : ) a = l, b = l, s = 1 ( : ) a, b, s ( 6) ( 1) C,, ( 2) D,, ( 3) C, : - > - >, BDAECF ( 4) D, ( 5) A,, ( 6) B ( DBMS) ( 7) C : ( 8) A, ( 9) D, ( 10) B, ( 11) B C, C C,. OBJ ( ), 45

155 ,. OBJ C,. EXE C ( 12) A C, C, ( 13) C A a b,, C,,,, A, ; B, ; D,, ( 14) D C,,, : acd d _ ad _ adfl24 _124 2asdf, _sd / = C, : ACD acd ( 15) C A, a = b + ( b = b + + ) ; B %, B ( int) a + b double ; a, b double= = = ( 16) D m n x, m n 3 4,, x =- m ++ x = - ( m ++ ), - 3, x = x + 8 / ++ n x = x + 8 / ( ++ n), x = /5 =- 2, x - 2 ( 17) A + + a, + + a a, a 1, a 1 b, a b, b, b, b a + +, a + + a ( a b, b b), a b ( 18) C,,, m, n, m 256, n ( ) ( 19) B printf( ) % d, a b, a 666 ( 20) C for, i = 0, switch case0 :, default, switch, 0, 0, 0, i = 1, switch, default 1, switch ; i = 2, switch case 2:, ( 21) C A abs( ) ; B && ; C,, ; D 46

156 22) A if - else, C else if, else if, if - else if, if a > b( 3 > 4 ), if - else, d, d 2 ( 23) D AB C a 0 y, a 0 x, D a 0 x, a 0 y ( 24) D for, for break,, if, if,, if, if,, i + + s + = i, i 1, s 1,, i, s 3,, if, continue, i 3,, for ( 25) B B for 5,, p 1, i, 5, 5! C D 5!, A ( 26) A 4 a b c d, scanf( ) a b c d a b c, c d d printf( ), a b c d, a b 6 5, c d ASCII, ASCII A B, 6, 5, A, B ( 27) B A, C ; C ; D 2 3, 3, ( 28) A f( ) a 0, 8, s[ 0 ] = 1 s[ 1 ] = 3 s[ 2] = 5 s[ 3 ] = 2 s[ 4] = 4 s[ 5] = 6 0for, s[ i], s[ i], i = 3, s[ i] = 2,, d d = s[ 0] + s[ 1] + s[ 2] = = 9, d 9 ( 29) D c p c, p, A p + 1, 1 c, p + 1 p c, c, D p[ 0 ] c, 1 C, p[ 0 ] + 2, * ( p[ 0] + 2 ) 47

157 30) C a b, 7 8, p q r, p a, q b, f, p q, p q b, q p a, * p, * q 8, 7, a, b 7, 8 ( 31) D C strcmp( ),, 0, 0, 0,,,, sl s2, s, strcmp( s1, s2) > 0 strcmp( s2, s1) < 0 ( 32) D, p x p, 1 x,, 6 A B C, D ( * p) + +, * p 1, ( 33) A a,, 12 a, * p = a + 5 p 6, q, q, q, ( 34) C 3 2 a, 3 p, a [ 1] p[ 0] p[ 0] a[ 1] [ 0], p[ 0] + 1 a[ 1 ] [ 1 ], * ( p[ 0] + 1) a[ 1] [ 1] ( 35) B, str[ 0 ] = China", str[ 1] = " Beijing", p str, 10, p + 10 str[ 1 ], * ( p + 10) Beijing ( 36) D s, ABCD s, p, for,, p s[ 1], p BCD; p s[ 2 ], p CD; p s[ 3], p D ( 37) B C,,,, ( 38) D a p A 48

158 , ; B a [ 5 ], ; C a[ 2],, ; D a 2, ( 39) A,, static, static ; auto, static 0 ( 40) A A,, 0, 1 A c1 c2, 0; B, l, 1, 0, B c1 c2, 1; C,, c2 0, D, 1, 1, c1 c2 0, 0 ( 41) C ( 42) B s, ps s p + 4 5, put( str _adr ), sb_adr,, \0, put( p + 4) n / No, put( s) s 3 ( * ( p + 4 ) = 0 s 5 0, s 4 \, puts \0, ), yes ( 43) B a b, - 1,, , 32767, a ( 44) C fun( ) if, i j, a[ i] a[ j], i 1, j 1 a i j,,, 4, fun( a, 0, 3), a 0 3 fun( ),, a, a 8, 1, 6 2 ( 45) D,,, A B,, D stu[ 3 ]. age, 49

159 , 0, 1, 2 ( 46) A x, for, 4, ( ) 4, ( 47) C fp1, fopen( ), f1. txt, fp1, fprintf( ) abc fp1, fp1 f1. txt, abc f1. txt good, f1. txt abc ( 48) C ( 49) A ( 50) B, head, CreatList( ) head, CreatList( ) structnode*, 48 struct node* ; CreatList( ) h, p q, malloc ( ), h, p q h, while, s,,, p, data s, 49 * s; q p, q p ( 1)1, ( 2)2,, 1 ) ; 2 ),,,, ( 3)3 ( 4)4, ( 5)5 ( 6)6 11 printf( ) i 9, i, 9 11 ( 7) a b c, a 25, b 025, c 0x25 printf( ) a b c, 50

160 025 21, 0x25 37, ( 8)8 24 7, while, i 7 p[ i], i = 2, p[ 2] = 14,, j j = p[ 0 ] + p[ 1] = 24; ( 9)9 2 1 switch x 1, case1:, case1: switch, switch y 0, switch case 0: a + +, a 1,, break, switch, switch, case1: case2:, a 1 2, b 1 1 a b 21 ( 10)10 92 while do - while 4 4, while, do - while while, i + + i + + 4, i = 0, while, if, j = 0, do - while, do - while i + 1, s s = a[ 1] [ 0] + a[ 1 ] [ 1] + a[ 1] [ 2 ] + a[ 1] [ 3 ] = 26, i = 1, i + 1 = 2, if, continue, ; i = 2, i 1 3, s, s = s + a[ 2] [ 0] + a [ 2] [ 1] + a [ 2 ] [ 2 ] + a[ 2] [ 3 ] = 92, i = 3, = 4, if, continue,, i = 3, if continue, i = 4 while, s 92 ( 11)11 gae a b, Language Programe, p1 p2, a b for, p1 + k p2 + k,,, 8, Language Programe gae, gae ( 12)12 * 2* 4* 6* 8* a, , p a, while, : i, * a[ i], p,, a[ 0 ] a[ 2 ] a[ 4 ] a[ 6 ] a[ 8] *, puts( ) a * 2* 4* 6* 8* ( 13)13 4 : M = 2 + 1, K = 2 + 1* /2 = 4, for 51

161 ( 14)14 x , x* x x* x x = 0 f( x), x = 10 SunFun ( ) for, f( x) s, x, x + 1, 10 F( ) f( x), x* x + 1 ( 15)16 &a [ i] a + i 17 a[ i] * ( a + i) 20,, 20,, &a[ i] a + i, 20,, 0, 0 sum,, a * ( a + i) ( 16)18 a[ k] [ i] 19 * sum 20 x, &s SumColumMin( ),,, SumColumMin( ), x sum SumColumMin( ), 20 x, &s SumColumMin( ), N, M M, a[ k] [ i] a [ j] [ i] ( k = 0, a [ k] [ i],, a[ k] [ i], a [ k] [ i] ), k, M,,, i a[ k] [ i] s, 18 a[ k] [ i], N, s,, sum s 19 * sum ( 7) ( 1) D ( ) ( 2) B ( stack), ( top), ( bottom) 52

162 3) D, n( n - 1) /2 ( 4) C n,, log 2 n, n ( 5) A,,, ( 6) C ( 7) B,,,,,,, ( 8) D, ( 9) D, ( 10) C, ( 11) B 5 : ; ; ; 0 ; ( 12) A B, 0, 0 7, ; C D, e, ( 13) C 5 : ; ; ; 0 ;, C ( 14) D,,,,, ( 15) B C, e ( E), e ( E), B, e( E), ( 16) C + +,, 1;, 1 b, b = 2, b 1, b = 3, b - a = 3-1 = 2 ( 17) A + +,, 1;, 1, m = 12, m 1, 13, n 1, n = 35 ;, n = 53

163 5, n 1, 36, m 1, m = 14 ( 18) B b, c,, b &, c, & ( 19) A, ( 20) B / %, && a = 25 /10% 9 = 2; b = 2&&( - 1) = 1 ( 21) D, j 1 3, + + j = = 3, 1, 1 1,, k = 3, &&, i 1, i + + = = 1, 1 i = 2if 1, i j k 2, 3, 3 ( 22) A, a = 1, b = 4, a < b, a 1 ( 23) A while if, p [ 1 ] p[ 7 ], j = = 45 ( 24) C sizeof( ) strlen( ), sizeof( a) a, a 7, i = 7 ; strlen( a ) a, \0, j = 2 ( 25) B A, ; C, ; D, ( 26) A f1 ( x, y) x, y, f2 ( x, y) x, y, f1( a, b) = 4, f1( c, d) = 3, f2( c, d) = 2, e = f2( 4, 5 ), f = ( 3, 2) = 3, g = = 7 ( 27) C a, \0, a 4, b 3, a b ( 28) D, a[ 0 ] a[ 7 ], a [ 1] a[ 6], a[ 2] a[ 5 ], a[ 3] a [ 4], ( 29) D, p, for p, a, a [ 0 ] [ 0] a [ 2 ][ 2 ] 0 8, a [ 1] [ 0], a[ 1][ 1], a[ 1] [ 2 ] 3, 4, 5 ( 30) C C,, ( 31) B N = 20, a 10 0, fun( a [ ], n, m) a[ n + 1 ] ( m > n), fun( a, 2, 9) ;, a a[ N] = {1, 2, 3, 4, 4, 5, 6, 7, 8, 9, 10 ( 32) B for, ptr a[ 0 ] [ 0 ] 54

164 , a [ 0] [ 0] = 1; ptr a [ 1] [ 0 ],, a[ 1][ 0] = 2,,, 0 ( 33) B ptr( * m, n), m, a, ptr( * m, n) 1,, a 2, 3, 4, 5, 6 ( 34) A, for, p a [ 0], a[ 0], p, a, a ( 35) D F( x) void,, return, ( 36) C &, 1&1 = 1, 0&0 = 0,,, ( 37) D A, ; B ; C,, ; D, ( 38) D A ; B ; C, ; D, C, ( 39) D C, A B C ( 40) C typedef, ST, NEW ( 41) B break continue : break, continue,,, b = 1, a = 1; if, a, a = a + 5 = 6, ;, b = 2, a = 3;, b = 3, a if, a = a + 5 = 8,,, b = 4, a = 8, if, for, b = 4 ( 42) A + +, 1;, 1 p = s; p s, 1, p, 5,, 5, p, 9 ( 43) D a b, a b,, a b,, a b, ( 44) B,, for, for i, num[ i][ i], i 55

165 45) A, p, p, p, p, b[ 0 ], a ( 46) A fun( ),, B C,, D, * fl( s), ( 47) D q - > next r, r p - > next, q,, p r ( 48) C C, aa,, td ( 49) D fseek( fp, 0L, SEEK_SET) feof( fp ) ftell( fp) fgetc( fp) fp rewind( fp) ( 50) B fputs, ( 1)1 19, 0 ( ) 2 ( 2)2,, ( 3)3,, ( 4)4, ( 5)5 ( 6) i = 10, j = 30, k, 0 ( 7)7 81 S( i + j) = 4* i + j* i + j + 1 = 4* 6 + 8* = 81 ( 8) b > a, if,, a = c = 5, c = t = 99; a < c b < c, if, a b, c, a = 4, b = 5, c = 99 ( 9)

166 , a = 10, b = 20, c = ( 10% 20 < 1 ) ( 10 /20 > 1) = ( 10 < 1) ( 0 > 1 ) = 0 0 = 0 ( 10) c1 < c2, c1 > = c2,, 09, 18, 45, c1 = 5, c2 = 4,, ( 11)11 1 B, a = B, b = 33,, a = B - A+ 0 = 1 ; b = 33* 2 = 66C,, A ASCII 65, B ASCII 66, b = B, a b, 1 B ( 12)12 br[ i] fun( ), i,, x, x br[ i], b[ i] i ( 13) swap( x, y), x, y, 4 3, a b, a b, 3 4 ( 14)14 abcfg, strlen( s) = 7, fun( ), p = 3, k = 7, for, i = 3, s[ 3] = s[ 5] = f, i = 4, s[ 4] = s[ 6] = g, i = 5, s[ 5] = s[ 7] = \0,, i = 6, s = abcfg ( 15)15 abcbcc strcpy( ), for abc, for, i = 0, x[ 0 ] [ 0 ], abc, i = 1, x[ 1] [ 1], bc, i = 2, x[ 2 ] [ 2 ], c, ( 16) , fun( ) c,,,,,, c for, i = 0, fun( 5) = = 10, c = 4 ; i = 1, fun( 5) = = 11, c = 5 ; i = 2, fun( 5) = = 12; c = 6; i = 3, for, ( 17) , p m[ 0], q m[ 4], p! = q,, m[ 0]. k = 1, m[ 4]. k = 1, i = 2, p m[ 1 ], q m[ 3 ], p! = q,, m[ 1]. k = 3, k = 57

167 , i = 4, q m[ 2], p = = q,, m[ 2 ]. k = ( 18)18 str + strlen( str) i > strlen( str) /2 20 huiwen( str) p1, p2 ( \0 ), p1, p2,,,, i < = strlen ( str) /2,, i > strlen( str) /2 if, i > strlen( str) /2, yes!, no! huiwen( str) 58

展开

新版明解Ｃ言語入門編

新版明解Ｃ言語入門編 328, 4, 110, 189, 103, 11... 318. 274 6 ; 10 ; 5? 48 & & 228! 61!= 42 ^= 66 _ 82 /= 66 /* 3 / 19 ~ 164 OR 53 OR 164 = 66 ( ) 115 ( ) 31 ^ OR 164 [] 89, 241 [] 324 + + 4, 19, 241 + + 22 ++ 67 ++ 73 += 66