nooog

C : : :

, C C,,, C, C,, C ( ), ( ) C,,, ;,, ; C,,, ;, ;, ;, ;,,,, ;,,, ; : 1 9, 2 3, 4, 5, 6 10 11, 7 8, 12 13,,,,, 2008 1

1 (1 ) 1.1 (1 ) 1.1.1 ( ) 1.1.2 ( ) 1.1.3 ( ) 1.1.4 ( ) 1.1.5 ( ) 1.2 ( ) 1.2.1 ( ) 1.2.2 ( ) 1.2.3 ( ) 1.2.4 ( ) 1.2.5 ( ) 1 ( ) 2 C ( ) 2.1 C ( ) 2.2.1 C ( ) 2.2.2 C ( ) 2.2 C ( ) 2.3 C ( ) 2.4 C ( ) 2.4.1 C ( ) 2.4.2 C VC + + 6 0 ( )

2 ( ) 3 ( ) 3.1 C ( ) 3.1.1 ( ) 3.1.2 ( ) 3.2 ( ) 3.2.1 ( ) 3.2.2 ( ) 3.3 ( ) 3.3.1 ( ) 3.3.2 ( ) 3.4 ( ) 3.4.1 ( ) 3.4.2 ( ) 3.5 ( ) 3.5.1 ( ) 3.5.2 ( ) 3.6 ( ) 3.6.1 ( ) 3.6.2 ( ) 3.6.3 ( ) 3.6.4 ( ) 3.6.5 ( ) 3.7 ( ) 3.7.1 ( ) 3.7.2 ( ) 3 ( ) 4 ( ) 4.1 ( ) 4.1.1 C ( ) 4.1.2 C ( ) 4.2 ( )

4.2.1 ( ) 4.2.2 ( ) 4.3 ( ) 4.3.1 getchar ( ) 4.3.2 putchar ( ) 4.3.3 gets ( ) 4.3.4 puts ( ) 4 ( ) 5 ( ) 5.1 ( ) 5.2 ( ) 5.3 ( ) 5.3.1 if ( ) 5.3.2 switch ( ) 5.4 ( ) 5.4.1 while ( ) 5.4.2 do - while ( ) 5.4.3 for ( ) 5.4.4 3 ( ) 5.4.5 ( ) 5.5 ( ) 5.5.1 break ( ) 5.5.2 continue ( ) 5.6 ( ) 5 ( ) 6 ( ) 6.1 ( ) 6.1.1 ( ) 6.1.2 ( ) 6.2 ( ) 6.3 ( ) 6.4 ( )

6 ( ) 7 ( ) 7.1 ( ) 7.1.1 ( ) 7.1.2 ( ) 7.2 ( ) 7.2.1 ( ) 7.2.2 ( ) 7.2.3 ( ) 7.3 ( ) 7.3.1 ( ) 7.3.2 ( ) 7.4 ( ) 7.4.1 ( ) 7.4.2 ( ) 7.5 ( ) 7.5.1 ( ) 7.5.2 ( ) 7.5.3 ( ) 7.5.4 ( ) 7.6 ( ) 7 ( ) 8 ( ) 8.1 ( ) 8.2.1 ( ) 8.2.2 ( ) 8.2.3 ( ) 8.2 ( ) 8.2.1 ( ) 8.2.2 ( ) 8.3 ( ) 8.3.1 ( )

8.3.2 ( ) 8.3.3 ( ) 8.3.4 ( ) 8.3.5 ( ) 8.4 ( ) 8.4.1 ( ) 8.4.2 ( ) 8.4.3 ( ) 8.5 main ( ) 8.6 ( ) 8 ( ) 9 C ( ) 9.1 ( ) 9.1.1 ( ) 9.1.2 ( ) 9.1.3 ( ) 9.2 ( ) 9.2.1 ( ) 9.2.2 ( ) 9.3 ( ) 9.4 ( ) 9 ( ) 10 ( ) 10.1 ( ) 10.1.1 ( ) 10.1.2 ( ) 10.1.3 ( ) 10.1.4 ( ) 10.2 ( ) 10.2.1 ( ) 10.2.2 ( ) 10.3 ( )

10.4 ( ) 10.5 ( ) 10.6 ( ) 10 ( ) 11 ( ) 11.1 ( ) 11.2 ( ) 11.2.1 ( ) 11.2.2 ( ) 11.3 ( ) 11.3.1 ( ) 11.3.2 ( ) 11.4 ( ) 11 ( ) 12 ( ) 12.1 C ( ) 12.2 ( ) 12.2.1 fopen ( ) 12.2.2 fclose ( ) 12.3 ( ) 12.3.1 ( ) 12.3.2 ( ) 12.3.3 ( ) 12.3.4 ( ) 12.4 ( ) 12.5 ( ) 12.6 ( ) 12 ( ) 13 C + + ( ) 13.1 ( )

13.2 C + + ( ) 13.2.1 C + + ( ) 13.2.2 C + + ( ) 13.2.3 C + + ( ) 13.2.4 C + + ( ) 13 ( ) 1 ( ) 2 ASCII ( ) 3 C VC + + 6 0 ( ) 4 ( ) 5 C ( ) ( )

1 N - S :, : N - S, 1.1 1.1.1??,,,,,, ( ),,,,,,,,,,,,, : 10,,,

,2 3 8 9,, ( Algorithm) 9 al - k hovarizmi,,,,,,,,,,, 1.1.2,,,,,,,, :,,,,,,,, : 07 68,,, 1,, 1h A B,, 10h,,,,,,,,,,,,,,,,,,, : x = 1, y = 0, z = x/ y;,, z = x/ y,,, 99 98, 99 98,,,, : (1 ),,,,, :,,,

,,,,,, (2 ),,,,,,,, :,,,, (3 ),,,,,,, 1.1.3,,,, (1 ),,,,,, : 1.1 3 + 13, :,,,,, : 1 : 3 x, 13 y ; 2 : x + y, z ; 3 : z 1.2 100, 7,,,, : 1 :100 y, 7 x; 2 : y x, 3 ; 3 4 ; 3 :, 5 ; 4 : ; 5 :,,,,, ;,,,,

,,,,,,,, 100 7,,,,,, ( :?) : 1 :7 x, 100 y; 2 : y% x = 0? 0 3 ; 3 4 ; 3 :, 5 ; 4 : ; 5 : (2 ) ( ) ( ) ( ),,,,,,,,,,,, N - S 1.1 1.2 1.1 1.2 (3 ) N - S,,, (, ) ( ),,,,,, ( ), 1.2, ( A B ),, A, B,,

,,, ( 1.3 ) ( 1.4 ) ( 1.5 1.6) 1.3,,, C A B, A, B, A, B,,,,, 1.4, A, 1.5 1.6 1.5, C1,, A1 An + 1, C1,, C1 C2 Cn, An + 1, An + 1 1.6 1.5,, 1.6, C1 C2 Cn, 1 2 1 3 1 4 1 5 ( ) 1 6 ( ),,,,, 1.7 1.8 1.9 1.7,, C,, A( A, A ), A,, A, A C, C,, ( B ) 1.8,, A( A ), A( ),, A, A C,

C,, ( B ) 1.9 1.8,, C A, C,, ( B ) 1 7 ( ) 1 8 ( ) 1 9 ( ) :, : 1.7,,,, C, 1.8 1.9,, C,,,, 1.2 1.3 A B, 1.4 A, 1.5 A1 A2 An An + 1, 1.6 A1 A2 An, 1.7 1.9 A B,,,,,,,,,,,,, : ; ; ; ( ), I.Nassi B.Shneiderman,, N - S, N - S N - S N - S,,, ( ),, N - S, 1.10 1.15, 1.2 1.9, N - S,

1 10 1 11 ( ) 1 12 ( ) 1 13 ( ) 1 14 ( ) 1 15 ( ) 1.3 N - S x : x,,,,, -x, x, x, N - S 1.16, 1.17 1 16 N - S 1 17, : 1 : x ; 2 : x 0, x, 4 ; 3 : -x; 4 : (4 ),, ( ),,,,, 1.3 : x if x > = 0 x x : x

x : x if x is positive then print x else print x x x 1.1.4 1,?,,,,,,,,,,!,,,,,,!,,,,!, :,! 2?, :,,, :,,,,,,,,, x, y,,,,,,, 3,,, : 07 918, x y, ( 6 ),,, = +,,,

,, 1.1.5,,,,, :,,,,,,,, 10min,, 0.1s,,,,,,,,,,,,,,,, ;, ( ), 1.2 1.2.1,,, ( ) ( ),,,,,,,,,,,,,,, 1.2.2,, : C C + + Java BASIC Fortran Pascal Cobol ;,, : 1,,,,, 0 1,

,,,,, 2,,,,, ( ),,, ( ), 3,,,, C BASIC Pascal Fortran, ( ),, 4,,,,, : Excel PowerBuilder FoxP ro - 4GL, C + + 5,,, C, C ( C ), C, C, 1.2.3, :,,,,,,,,,,,,,,,,,, 1.2.4,,,,,,,, ( 1.1.4 ),,,,,,,,,,,

,,,, 1.2.5, 3 ( ),,,,,,, ( 9 ),,,, 3, C, C, C,, C, C, C,,,,,,,,,, 1 1 a, b, c,, 2 a, b, c,,

2 C C C C C : C, C, C : C 2.1 C 2.1.1 C C 20 70 1978 ( A T & T ) C B.W.Kernighan D.M.Ritchit T HE C PROGRAMMING LA NG UA GE K & R, K & R, K & R C, C, 1983, ANSI C 2.1.2 C C,, C,,, ( bit) C, C,,, C,, C C U NIX C

, 20 80, C,, 2.2 C, C, ( A Z, a z) (0 9 ) _, : zz, x1, _5y, temp1, mum8 : 6s x T ( : ) ( : ) - 6x ( : ) zhue - 1 ( : - ) C : 1. : C, C (1 ) :, int double (2 ) :, if else for C,, 32, 3.1 3.1 au to double int struct break else long switc h case e nu m r egister typedef cha r ex tern ret urn union con tinu e float shor t unsigned const for signed void default got o sizeof volatile do if static while 2., define C,,, 3.,

, ;,,,, : C, C, C,, C, BOO K book,,, 2.3 C C,, C C 2.1 {printf( I am a Student! \ n ) ; : main, C ( main ) printf C, I am a Student! \ n I am a Student!, C 2.2 # include stdio.h # include math.h / / { double x, y; / / x, y printf( input number: \ n ) ; scanf( % lf, & x ) ; / / x y = cos ( x) ; / / x, y printf( cos of % lf is % lf\ n, x, y) ; / / : x, x main, include

11 ), < > ( / / / /,, 4 x y 6 x, 7 x, y 8 % lf x y 2.3 # include stdio.h int min (int x, int y) ; { int m, n, r; / / scanf( % d, % d, & m, & n ) ; / / m n r = min ( m, n ) ; printf( min = %d, r) ; / / r int min (int x, int y) / / min, r / / min,,x y { int z; / / min z : if( x > y) z = y; else z = x; return(z) ; / / x y z : main min / / min, z min : x y z return z main main scanf, m n & m & n & %d, % d : main 3 min, m n min x y, min, r 3, C : C C C main,,,, printf scanf,, 2.3 min C C,, C main, C main (include ),

,, C, C / / / /, / /,, /, /, / /, / / 2.4 C 2.4.1 C C C C C,, C C.c.cpp C,.obj ( ),,, scanf printf,,,,.exe,.exe C 2.1 2.1 C 2.4.2 C VC + + 6.0 Vis ual C + + 6.0 Windows, Visual Basic Visual Foxpro Visual J + + Visual Studio ( Developer Studio) Developer Studio,, Developer Studio, VC + + 6.0 C 1.VC + + 6.0 (1 ) VC + + 6.0 :

Microsoft Visual Studio 6.0 Microsoft Vis ual C + + 6.0 Visual C + + 6.0 VC + + 6.0, 2.2, 2.2 VC + + (2 ),, (3 ) VC + + File Exit 2.2, VC + + 6.0 2. C (1 ) C File N ew ( : ^N ) 2.3 Files, 2.3 File C (.c,.cpp, ), Loca tion 2.3 C + + Source File, OK, VC + +, C,, File Save ( ^S ) C 2.3 C (2 ) C C,

File Open ( :^O) 2.4, C, VC + +,, 3. C 2.4 C 2.2 Build Compile, 2.5, 2.5,, 2.6 ( xxx C ) : xxx.obj - 0 error ( s ), 0 warning ( s) ( warning), (error ), 2.6,, VC + +, C,, 2.6

2.2 Build Build ( F7 ),,, ( xxx C ) : xxx.exe - 0 error ( s ), 0 w arning ( s) (error),, VC + +, C, ( ), 4. 2.2 Build! Execute ( ^F5 ).exe, VC + + 2.7, ( ) ( : C,!) ( ), VC + +,, 5. VC + + 6.0, C,,, C, ; 2.2 File Close Workspace 2.8,, 2.7 2.8 2.2, C, C,, C,, C C,,

1. A. C B. C C. C D. C, 2.C A. B. C. D. 3. A. C B. { C. C, D. C, 4. A. C B. C C. C D. C 5. A. C B. C main C. C, D. C 1., C 2.C,? 2

3,, :,,, : 3.1 C 3.1.1 C,, 3.1 (int) (float) ( double) (char) (void) (array) ( struct) ( union) (enum) 3 1

3.1.2 1, 2,, C : 3,, 4,,, 2.3 min, : int min(int x, int y ) int 2.2, cos,, y,,, void ( 7 ), 3.2 3.2.1, C (int ) ( float) (char ),,, : 35 0-89;, : 8.75-56.421 0.0;, : g 1 C,,, : # define # define ( #, 11 ),,,, PI 3.1 s # include < stdio.h > # define PI 3.14159

{ float s, r; r = 5; s = P I 3.2.2 r r; printf( s = % f\ n, s ) ;,,, C, C : ( ) : ;,,, 3.3 3.3.1 C 1,, 0 9, 237-568 65535 023( : 0 ) 23D( : D ) 2 0, 0, 0 7 : 015( 13 ) 0101( 65) 0177777( 65535) : 256( : 0 ) 03A2( : A )

3 0X 0x, 0 9, A F a f : 0X2A( 42) 0XA0 ( 160 ) 0XF FFF ( 65535) : 5A ( : 0X) 0X3 H ( : H), 3.3.2 1 : int, 4, : short int short, 2, : long int long, 4, : unsigned : un signed int un signed; un signed s hort ; un signed long, VC + +, 3.1 ASCII [ signed] int - 2147483648 2147483647-2 31 (2 31-1) 4 [ signed] short [int] - 32768 32767-2 15 (2 15-1) 2 [ signed] long [int] - 2147483648 2147483647-2 31 (2 31-1) 4 unsigned [int] 0 4294967295 0 (2 32-1 ) 4 unsigned short [ int] 0 65535 0 (2 16-1 ) 2 unsigned long [ int] 0 4294967295 0 (2 32-1 ) 4 C, L l : 325L ( 325), 045L ( 37), 0X18L ( 24 ), U u : 453u, 0x67Au, 872Lu 0XB5Lu B5, 181, 0, - 369 u 2 :,,...;

3.2 # include < stdio.h > { int a = 1, b = 2, c; / a b c, a b 1 2 / long x = 29, y = 2147483600; c = a ; a = 10; / a c / / a 10 / printf( \ na + b = % d, x + y = % ld, c = % d\ n, a + b, x + y, c) ; : a + b = 12, x + y = 2147483629, c = 1, :,, ;,, c = a; long x = 29, y = 2147483600;, 3.4 C,, : 3.4.1 1, 0 9 ( ) : 0.0, 123.,. 123, 12.3, 123.0, - 123.0 2, e E (, ) 3.14159 0.314159e1, 3.14159E0, 314.159e - 2 : a E n ( a, n, a 10 n ) : : E3( : E ) 36. - E6( : ) 4.2E( : ) 3.4.2 ( float ) ( double) ( long double),, A NSI C

, float 4, double 8 7 8, 15 16, 3.3 # include < stdio.h > { float x = 101235342.98345678; double y = 422222222345.11223344556677889900; printf( x = % f, y = % lf\ n, x, y) ; : x = 101235344.000000, y = 422222222345.112240 : x float, 8, 7 3.5 3.5.1, x,? : (1 ), (2 ), (3 ), 6 6, 6 + 2 8, 6 + 2 8, 56, 6,,, ASCII, 6 ASCII 54, 6 + 2 56 C, \,,,,,, printf \ n,, 3.2 C, \,,, \ \ \ \,, H appy birthday!, printf( \ H appy birthday! \ ) ;

3.2 \ n ( ) \ t \ b ( ) \ f ( ) \ r \ \ ( \ ) \ \ ( ) ( ) \ xhh 1 2 \ ddd 1 3 3.4 # include < stdio.h > { int x = 16, y = 2008; printf( y = % d\ rx = % d\ n, y, x ) ; printf( % c% c% c \ b%.1f\ n, C, +, +, 6.0) ; : x = 1608 C + 6.0 y = 2008 \ r,, x = x 16, x = 16,, y = 20, \ n,, C + +, \ b,, 6.0,, C + + + 3.5.2, char ASCII x ASCII 120 a x, a 120 :01111000,, C,,,,,,, 3.5

# include < stdio.h > { char a = 66 ; int b = A ; printf( a = % d( % c), b = % d( % c), a + 3 = % c, b 10 = % d\ n, a, a, b, b, a + 3, b 10 ) ; : a = 66 ( B), b = 65 ( A), a + 3 = E, b 10 = 650, a 66, ; A b, ; a 3, b 10 3.6 # include < stdio.h > { char a = x, b = Y ; / a, b / a = a - 32; / / b = b + 32 ; printf( % c, % c\ n, a, b) ; : X, y, a, b,, ASCII ASCII 32,, 3.6,, ;, : x + y - z/ 2 C C : 3.6.1 1 C ( + ) ( - ) ( ) (/ ) ( %, ) ( + + ) ( - - ) 7, (1 ) + a + b, 4 + 8 ( )

(2 ) -, -,, ( ), - x, - 5 (3 ), (4 ) /,,,,,,,,, 3.2 C, 0, (5 ) ( ) % 3 2,,, VC + +, : 16 % - 3 1, - 32 %5-2 3.7 # include < stdio.h > { printf( %d, % f\ n, 15/ 6, 15.0/ 6 ) ; printf( %d, % d, % d, % d\ n,100 %3, - 100%3,100 % - 3, - 100% - 3 ) ; : 2, 2.500000 1, - 1, 1, - 1,15 6, 15/ 6 ( ) 15.0/ 6, 15.0, (6 ) ( + + ) ( - - ) C,, ( + + ) ( - - ) : + + : 1 : + + x ; x = x + 1; - - : 1 : - - x; x = x - 1; + + - -, ( ), ( ) : x = x + 1; + + x; x + + ; + + x( - - x ), : x 1 ( 1 ), x x + + ( x - - ), : x, x 1 ( 1) + + ( - - ), 1 ( 1 ), 1( 1 ), C,

3.8 # include < stdio.h > { int x1 = 10, x2 = 10, y1, y2; printf( \ nx1 = %d, x2 = % d\ n, x1, x2) ; y1 = + + x1; y2 = x2 + + ; printf( y1 = %d, x1 = % d \ n, y1, x1 ) ; printf( y2 = %d, x2 = % d \ n, y2, x2 ) ; : x1 = 10, x2 = 10 y1 = 11, x1 = 11 y2 = 10, x2 = 11, y1 = + + x1;, x1 11, ( 11 ) y1; y2 = x2 + + ;, x2 ( : x2 10 y2), x2 11 2 C, 15 1, 15,, C, ( ) ( ), x - y + z, y -, x - y, + z, x = y = z, =, y = z x = ( y = z) (1 ) : ( ) ; +, - ( ) ;,/ ; +, - ( ) + ( ) - ( ), (2 ), :,, ;,,, 3 : ( ) ( )

( float)a a (int) ( x + y ) : x + y : (, ), : int( x + y),, ( int ) ( x + y ) (int) x + y, x int y,, 3.9 # include < stdio.h > { float f = 9.68; printf( (int)f = % d, f = % f\ n, (int) f, f) ; : (int) f = 9, f = 9.280000,, f f ( : ), : (int) f, 9( ) f 9.68, float 3.6.2 C : > ( ) > = ( ) < ( ) < = ( ) = = ( )! = ( ) ; : & & ( ) ( )! ( ) ( true) ( flase), true 0, flase 0 : 6 > 8 0, 12 > = 5 1, 1 + 8 = = 9 1, 10!= 10 + 10 1,!( 4 5 ) = = 0 1,2 & & 8 = = 1 1, 0 9 = = 0 0 :! > > = < < = = =! = & &! ( ) :, : int a = 75; printf( " a = % d", a > 60 ) ; 1,, : 0,,, 0;,

1, x = 23, y = 20, z = 10;, x > y > z, C, x y, z 1, x > y > z 0( 1 ), x > y & & y > z 1 3.10 # include < stdio.h > { int x = 6, y = 4, z = 2, v, w ; v = x - - y; w = ( y - 4 ) & & ( + + x + 1 ) ; printf( v = % d, y = % d, x = % d, w = % d\ n, v, y, x, w) ; : v = 1, y = 4, x = 6, w = 0, x = 6, v 1 (, - - y ), y 4 y - 4 0, w 0 (, + + x + 1 ), x 6 3.6.3 1 =, : = :,, : :, : x = 12, y = x + 25, y = func( ) =, : C x = x + 1, x 1, x, x = x + 1,, :, C =, :,, : x = y = z = 10 + 6 :, x = y = z = (10 + 6 ), ( ) : x = ( y = (z = (10 + 6 ) ) ), x = ( y = (z = 10 + 6 ) ), :

16 z = 10 + 6: 10 + 6, 16 z, z 16, ( z = 10 + 6 ) y = (z = 10 + 6 ) : (z = 10 + 6 ) 16 y, y 16, ( y = (z = 10 + 6) ) 16 ;, x, y, z 16,,, 2, = ;,,, : = ;, x = x + y; x + = y;, x = x ( y + z) ; x = y + z;, + = = C, C 10 : + = ( ), - = ( ), = ( ),/ = ( ), % = ( ), & = ( ), = ( ),^ = ( ), < < = ( ), > > = ( ) 3.11 # include < stdio.h > { int a = 0, b = 3, c = 1 ; a + = (a = 2) ; printf( %d, % d\ n, a, b + = b - = b b) ; printf( %d, % d\ n, c = - - b + 2, c = 9) ; : 4, - 12-99,9, printf printf,,, VC + + 6.0,, c = 9 (, c 1, c 9 ), 9, c = - - b + 2, c = c ( - - b + 2 ) = 9 ( - 13 + 2) = - 99, printf, : 4, - 12-11,9 3.6.4 1?: C?,, :

1?: 2: 3 : 1,, 2, 1, 3,, x = ( a > b)? a : b a b y = ( x > = 0)? x: - x x 2,,,, : 1, 2, 3,, n, : 1, 2,...... n, n : a = 8 2, a 4 ; / 64, a 16 / (a = 8 2, a 4), a 2; / 128, a 16 / a = ( b = 5,5 2) ; a = b = 5, 5 2 ; /, 10, b 5 / /, 10, a b 5 /,,, 3.6.5,, 1,, : char ch = d ; int i = 6; float f = 10.0; double d = 0.2, result ; Result = (ch/ i) + (4 + f d ) ( f - i) ; 40.0 2, 3.6.1 :,,, int a ; long int b = 1.45645878454566E2 ; a = ( int) b;, a 145 ( ), int a; long int b = ( int ) 1.45645878454566E10; a = ( int ) b ;, a

1679685957,,,,,, b, : 3.7 3.7.1 C 4 : & ( ) ( ) ^( ) ( ) C : < < > > (1 ) ( : ) : < < > > & ^ (2 ) 3 5 3.5 x y x &y x y x^y x 0 0 0 0 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 & : 1, 1, 0 0,, a = 10110110, a & 0 00000000, : 0, 0; a & a 10110110, :, ; a & 0x0f 00000110, : a 4 0, 4 : 0, 0, 1 1 : a = 10110110, a 0 10110110, : 0, ; a a 10110110, :, ; a 0x0f 10111111, : a 4, 4 1 ^

3.7.2 :, 0, 1, : a = 10110110, a^0 10110110, : 0, ; a^a 00000000, :, 0; a^0x0f 10111001, : a 4, 4 :, :0 1,1 0 : a = 10110110, a 01001001 < < > > : : 1 > > 2 1 < < 2 ( : ) ( : ) 1, 2,, 0, 1,, 1, 0; 1, 1 0, 0,, 1, 3.12 x 4 7 { un signed int x, y, z ; scanf( % x, & x) ; / / x y = x > > 3 ; z = y & 0x0f; printf( x = % x, z = % x \ n, x, z) ; / / 3, 4 7, y : (, 5a) x = 5a, z = b / / y 0x0f( 4 0, 4 1 ) C,,,,,,, 1 1 1 1 1.0

1. 4, A. _main enclude sin B. If - max turbo C. txt REAL 3COM D. int k_2 _001 2., A. _1234_ B. _1_2 C. int_2_ D. 2_int_ 3. C A. 10101110B B. 0386 C. 0Xffa D. 0x2H 3 4. A. 5E2.0 B. E - 3 C..2E0 D. 1.3E 5.C A. % = B./ C. = D. < = 6. : int m = 7, n = 12;, 3 A. n% = ( m% = 5) B. n% = ( m - m%5 ) C. n% = m - m%5 D. ( n% = m) - ( m% = 5 ) 7. A. 0 < = x < 90 B. i = j = = 0 C. ( char) (42 + 3 ) D. x + 1 = x + 1 8. int m = 2, n = 1, q;, q = n/ m + 2.5 ;, q A. 2.5 B. 3 C. 3.0 D. 2 9., A. x1 = 26.8% 3; B. x2 = j > 0; C. x3 = 01A ; D. x4 = 1 + 2 = 3; 10., A. a = 1/ b = 2 B. + + (a + b) C. a = a/ ( b = 5) D. y = int( a) + b 1. : float t = 2, x = 3.5;, : ( (int) x + 0.5 )/ t 2. : char x = A ;, x + = x% = x - 5 3. x, y, z, k int, x = ( y = 4, z = 16, k = 32 ), x 4. int m = 3, n = 4, x;, x = - m + + ; x = x + 8/ + + n;, x 5. # include < stdio.h > { int y = 3, x = 3, z = 1;

printf( %d, % d\ n, ( + + x, + + y ), z + 2) ; 6. # include < stdio.h > { int a, b; float c, d; a = - 23; b = 4; printf( a/ b = % d\ n, a/ b) ; printf( a% b = % d\ n, a % b) ; c = d = 5; c = c + (c = 1 ) ; d + = 10; printf( d/ = c: % f\ n, d/ = c) ; printf( a = % d, b = %d, c = % f, d = % f\ n, a, b, c, d ) ; 7. # include < stdio.h > { int x = 3, y = 5, z = 8; y = x + 3 x + y; z % = x + y + 3; x = y > z; printf( %d, % d, % d\ n, x, y, z) ; z = ( x + = x = + + y - z - - ) ; printf( %d, % d, % d\ n, x, y, z) ; 8. # include < stdio.h > { int x, y, z; x = y = z = 1; y + + ; + + z; printf( y = % d, z = %d \ n, y, z) ; x = ( - y + + ) + ( + + z) ; printf( x = %d, y = % d, z = % d\ n, x, y, z) ; x = y = 1 ; z = + + x y + + ; printf( x = %d, y = % d, z = % d\ n, x, y, z) ;

1., a b c d 2. a, b, c, : area = s ( s - a) ( s - b ) ( s - c), s = ( a + b + c)/ 2, a, b, c, area : sqrt( x ), math.h

4 C / : : scanf printf 4.1 4.1.1 C 1, 3,,, C C C, C, C 5 : 1 ;, : ; : x = y + z ; / /, y z, x y + z; / /,, i + + ; / / i 1

2 ;, : ( ) ;,, ( 7 ) : printf ( C P rogram ) ;, C Program 3, C 9, : : if switch ; : do while while for ; : break goto continue return 4 {,, : { x = y + z ; a = b + c; printf( % d% d, x, a) ; : { ;, 5 ;, : while( getchar ( )! = \ n ) ;,,, :,,, / 4.1.2 C C, / C C / / /, / : scanf/ printf getchar/ putchar gets/ puts, C, # include < > VC + + 6.0, stdio.h, : # include < stdio.h > # include stdio.h,,, ( Warning)

4.2 C,,,,, 4.2.1 printf,,, ( ) 1 printf printf : printf(, ) ;,,,, (, ),,,,, : printf( % d % d, a, b) ;, % d % d, a b, : 2 : % [ ],,,,, (1 ),, 4.1 : %, 4 1 % : int d = 15; printf( d = % d, d ) ;, 1 d, ; 3 d, ; % 2 d, d : d = 15

4.1 % d, % u % x, % X % u % o % f ( ), 6 %e, % E % g, % G % f % e %c % s, \ 0 4.1 # include < stdio.h > { int a = 15; float b = 123.1234567; char d = p ; printf( a = % d, %o, % x\ n, a, a, a) ; printf( b = % f, % e \ n, b, b ) ; printf( d = % c \ n, d) ; printf( % s\ n, programming ) ; : a = 15,17, f b = 123.123459, 1.231235e + 002 d = p progra mmi ng, a 15, b, 6 ;, (2 ),,, :

int a = 123, b = 12345 ; printf( a = %d,, a) ; printf( b = % d\ n, b) ; printf( H appy birthday! \ n ) ; : a = 123, b = 12345 H appy birthday! 1 printf, a =,, 2 printf b =, \ n ( 3 ),, printf,, (3 ) : l, h, d f u 4.2 4.2 # include < stdio.h > { long int a = 1234567; int b = 12345, c = 45678; double d = 1234567.123456789; printf( a = % ld, b = % hd \ n, a, b ) ; printf( c1 = % d, c2 = % hd \ n, c, c) ; printf( c3 = % ld, d = % lf \ n, c, d) ; : a = 1234567, b = 12345 c1 = 45678, c2 = - 19858 c3 = 45678, d = 1234567.123457 4.2 % ld % hd %lf, b c ( VC + + 6.0, 4, + 2147483647 2147483648, 2, + 32767 32768 ),, b, ; c,,,,,, l L (4 ),, %,,,, %,, : %d, ; % f % e % E,

; % s,, :. 4.3 4.3 % md m, m % m.nf m, n % ms m, m % m.ns m n, m 4.3 # include < stdio.h > { int a = 1, b = 100, c = 1000; float d = 123.4567 ; char ch [ ] = Cprogram ; printf( %3d\ n% 3d\ n%3d \ n, a, b, c) ; printf( %0.3d\ n% 0.3d\ n%0.3d \ n, a, b, c) ; printf( %7.2f\ n%5.2f\ n%2.7f\ n, d, d, d) ; printf( %5s \ n%7.3 s\ n% 2.6s \ n, ch, ch, ch) ; : 1 100 1000 001 100 1000 123.46 123.46 123.4567032 Cprogr am Cpr Cprogr,,, ( m > 0) 0( m = 0 m ), ( ) ;, ;,,, ;,

:,, (5 ) printf, 4.4 - :,, +, +,, - # 0, 0x ( ), ( - ) 4.4 # include < stdio.h > { int a = 64, b = 12345; float c = 123.45678 ; printf( %3d\ n, a) ; printf( % - 3d\ n, a) ; printf( %7.2f\ n, c) ; printf( % - 7.2f\ n, c) ; printf( %10 s\ n, Cprogram ) ; printf( % - 10 s\ n, Cprogram ) ; printf( % + 5d\ n, b) ; printf( % 5d\ n, b) ; printf( % # o\ n, a) ; printf( %o\ n, a) ; : 64 64 123.45 123.46 Cprogr am Cprogr am + 12345 0100 100 12345

4.2.2 scanf, stdio.h, 1 scanf scanf : scanf(, ) ;,, printf,,, &,,, scanf( % d% d, & a, & b), ( ) C, ( ) :, 4.5 # include < stdio.h > { int a ; float b, c ; printf( input a, b, c\ n ) ; scanf( % d% f % f, & a, & b, &c) ; printf( a = % d, b = % f, c = % f\ n, a, b, c) ;, scanf %d% f % f,, scanf ( % d% f % f, & a, & b, & c) ;,,,, < Tab >, : 7 4.6 7.9 7 4.6 7.9 Tab 7 4.6 7.9 : a = 7, b = 4.6, c = 7.9 : scanf % d, % f, % f,,,,,,,, : 7, 4.6, 7.9, scanf, int

a ;, scanf( % d, a) ;, scanf( % d, & a) ; 2 scanf, : % [ ],, (1 ), scanf 4.5 4.5 scanf d o x u f e c s ( ), a, b c, scanf % d f,, scanf, scanf( % d% f % f, &a, & b, &c) ; scanf( % f % f% f, &a, & b, & c) ; (2 ) scanf : ( ) l h, 4.6 4.6 scanf l h :, : int a, b, c; scanf( %2d% 3d%4d, & a, & b, &c) ; : 123456789, a b c 12 345 6789, :, 4.6 # include < stdio.h >

{ int a, b, c; scanf( % d% d% d, &a, & b, &c) ; printf( a = % d, b = %d, c = % d\ n, a, b, c) ;, : 1 2 3, : a = 1, b = 3, c = - 858993460 ( ),1 a, 2, 3 b c, l h : ( l) ( h ) l h d o x, % ld % lo % lx % hd % ho % hx, l f e ( % lf % le), double : long a; short b; scanf( %10ld% hd, &a, & b) ; a 10, b :123456789011, a 1234567890, b 11 (3 ), scanf,,, int a, b; scanf( % d, % d, &a, & b) ;,, : 1 < > 2, a 1, b 2,,,, : 1, 2 : scanf( a = %d, b = % f, c = % c, &a, & b, &c) ;, : 1, 2.1, a,,, ( a =, b =, c = ) scanf,, : a = 1, b = 2.1, c = a,,,,,,,, : int a ; char ch ; scanf( % d% c, &a, & ch) ; :23 < > a, a 23, ch a, 3 ch, : scanf ( % d% c, &a, & ch ) ; scanf ( % d % c, &a, &ch ) ; % d, a,

4.7 # include < stdio.h > { char a, b; printf( input character a, b\ n ) ; scanf( % c% c, & a, & b) ; printf( % c% c \ n, a, b) ; :, M N, : M, scanf % c% c, : M N, M, : MN, MN,,, 4.8 # include < stdio.h > { float a, b, c; scanf( % f, % f, % f\ n, & a, & b, &c) ; printf( a = % f, b = % f, c = % f\ n, a, b, c) ;, 3.5,4.6,7.9,,,, \ n, (, : 3.5, 4.6, 7.9 \ n, ), \ n,,,,, 4.3 C : getchar putchar, 4.3.1 getchar getchar : getchar ( ) : ( ), getchar,, char c; c = getchar( ) ; 4.9 # include < stdio.h >

{ char c; printf( input a character \ n ) ; c = getchar( ) ; putchar( c) ; getchar : getchar, getchar ( ),,,, getchar, ; : abcde, getchar a, 96, c 9, getchar 9, 9 : putchar ( getchar( ) ) ; printf( % c, getchar( ) ) ; 4.3.2 putchar putchar : putchar(ch), ch ( ) : ( ), : putchar ( A ) ; ( : A) putchar ( x) ; ( : x, : x ) putchar ( \ 101 ) ; ( : A, \101 A ) putchar, :, : p utchar ( abc ) p utchar ( abc ),, putchar ( A ) ; 4.10 # include stdio.h { char o = M, k = Y ; putchar( o) ; putchar( k) ; putchar( \ n ) ;

putchar( ) ; : MY,, getchar putchar( ch ),, scanf printf, % s,, gets puts,, C,, \ 0, \ 0, C,, : char ch [100 ] = H ello World ; ( 6 ) 4.3.3 gets gets : gets ( ) : ( ) gets,, scanf 4.3.4 puts puts : puts( ) : 4.11 # include stdio.h { char c[ ] = Hello - World! \ n, st[ 15 ] ; printf( input string: ) ; gets ( st) ; printf( result is: % s \ n, st) ; puts (c) ; (, H ello World ) : input string: H ello World res ult is: H ello World H ello - World!

, puts printf, printf : / scanf/ printf, / getchar/ putchar, / gets/ puts /, C,, scanf printf 1. int n1 = 10, n2 = 20; printf(, n1, n2 ) ; : n1 n2,, n1 = 10 n2 = 20 2. : { int i, j; scanf( i = % d, j = % d, &i, & j) ; printf( i = %d, j = % d\ n, i, j) ; : i 10, j 20, 1. 3 ( 10.0, 20.0, 5.0 ), 3 sum product average 2. : sizeof ( ), 3. ( 20, 10 ), a b, : int 4, long int, float

5 if switch, while do - while for, :,, :,,, 5.1 C 3 1.1.3, ( ), : (1 ),, (2 ),,, (3 ),,,,,, ;

,,, ( ) ;,,,, 3,, 4.1.1 C,,,,, C, C, ( if switch ) ( while do - while for ) 5.2,,, 5.1 3, 1 2 3 C,,, {,,, x y, : 5.1 { temp = x; / / x temp x = y; / / y x y = temp; / / temp y temp temp, : { int temp; temp = x; x = y; y = temp;,,,, ( ),,,,,,,, ( ),,

, 5.1, C F : F = 1.8 C + 32 : # include < stdio.h > { float C, F; printf( : ) ; scanf( % f, & C ) ; F = 1.8 C + 32; printf( : %6.2f\ n, F ) ;, 37, : : 37 :98.60 / / 5.2 r = 1.5, h = 3,,,,, : : L = 2 r, S = r 2, V = r 2 h 3, # define, PI, PI 3.1415926 :, C,,, C, : # include < stdio.h > # define PI 3.1415926 / / PI { double r, h, l, s, v; printf( r = ) ; scanf( % f, & r ) ; / / printf( h = ) ; scanf( % f, & h ) ; / / l = 2 PI r ; s = PI r r ; v = PI r r h ; printf( l = %6.2f\ n, l ) ;

printf( s = %6.2f\ n, s ) ; printf( v = % 6.2f\ n, v ) ; : r = 1.5 h = 3 l = 9.42 s = 7.07 v = 21.21 5.3 2x 2 + x - 3 = 0 : ax 2 + bx + c = 0, b 2-4ac 0, : x1 = - b + b2-4ac 2a a = 2, b = 1, c = - 3, b 2 x2 = - b - b2-4ac 2a - 4ac = 25 > 0, : a b c, b 2-4ac p, sqrt,, math.h, math.h : # include < stdio.h > # include < math.h > { float a, b, c, x1, x2, m; printf( a, b, c : ) ; scanf( % f, % f, % f, &a, & b, & c) ; m = sqrt( b b - 4 a c) ; x1 = ( - b + m ) / ( 2 a ) ; x2 = ( - b - m) / ( 2 a ) ; printf( x1 = % f\ n, x1 ) ; printf( x2 = % f\ n, x2 ) ; : a, b, c : 2,1, - 3 x1 = 1.000000 x2 = - 1.500000

5.3,,,, 5 2 5.3 ax 2 + bx + c = 0, b 2-4ac 0, b 2-4ac < 0 b 2-4ac 0,,, ( ) C, if switch,, 5.3.1 if 1 if C if : if if - else (1 ) if : if ( ) 1; :, ( 0), 1 ; (, 0 ),, (if ) : if, 5.2 1,,,,,, 5.2 if 5.4, : x, x, x < 0, - x x ;, x if : # include < stdio.h > { int x; printf( x : ) ; scanf( % d, & x) ; if ( x < 0) x = - x; printf( x = % d\ n, x) ;

: x : x = 416-416 5.5 3, x y z, 3, :, x y, x ;, x z, x,,3 x ;, y z, y,, t : # include < stdio.h > { int x, y, z, t ; printf( 3 : ) ; scanf( % d% d%d, & x, & y, &z) ; if ( x < y) {t = x; x = y; y = t; / x, y / if( x < z) {t = z; z = x; x = t; / x, z / if( y < z) {t = y; y = z ; z = t ; / z, y / printf( : % d % d % d\ n, x, y, z) ; : 3 : 45 78 23 :78 45 23 (2 )if - else : if ( ) else 1; 2; :, ( 0), 1 ; (, 0 ), 2 : if - else,, 5.3, 1 2 5.6, :, 5.3 if - else

: # include < stdio.h > { char ch ; printf( Input a character: ) ; ch = getchar ( ) ; if( ch > = a & & ch < = z ch > = A & & ch < = Z ) printf( It is a lett er.\ n ) ; else printf( No, it is not a let ter.\ n ) ; : Input a character: A It is a let ter. Input a character: 8 No, it is not a letter. 2 if if, 1 2, C, if if, if (1 ) else - if else - if if, if - else 2 if, if else - if : if ( 1 ) 1; else if ( 2) 2 ; else else if ( n - 1) n - 1 ; else n; : 1, 1 ( 0 ), 1, if ;, 2, 2 ( 0), 2, if ;, ;,, n : else - if, 5.4, else - if if,,, else n,,

5 4 else - if 5.7,, 85, 60, : score, :, 85 score 100;,85 > score 60;, 0 score < 60, else - if : # include < stdio.h > { float scor e; printf( Input score : ) ; scanf( % f, & score) ; if ( score > = 85 & & score < = 100 ) printf( Excellent.\ n ) ; else if( score > = 60 & & score < 85) printf( Pass.\ n ) ; else if( score > = 0 & & score < 60 ) printf( No pass.\ n ) ; else printf( Error score.\ n ) ; : Input score : 90 Excellent. Input score : 75 Pass.?, score > = 60 score > = 0, (2 ) if if, if,, if : 1: if ( 1 )

if ( 2) 1; else 2 ; else 3; 2: if ( 1 ) { if ( 2 ) 1; else 2; 3: if ( 1 ) 1 ; else if ( 2 ) 2; else 3; 4: if ( 1 ) if ( 2 ) 1; else 2; else if ( 3 ) 3; else 4;,, if, if if - else, : if ( x > 0) if ( x > 100 ) y = 1; else y = 0; else if, : if if - else, else if if ( x > 0) if ( x > 100 ) y = 1; else y = 0; if - else 1 if, else if if ( x > 0) if ( x > 100 ) y = 1; else y = 0;, C : else if,, if,, : if ( x > 0) { if ( x > 100 ) y = 1 else y = 0;,,, else, if if 2,,,,, 5.8 ax 2 + bx + c = 0 : 5.3, ax 2 + bx + c = 0, b 2-4ac 0,, : a = 0 b 0,, x = - c/ b ; b 2-4ac = 0, : x = - b/ 2a ;

b 2-4ac 0, : x1 - b + b 2-4ac 2a, x2 - b - b 2-4ac ; 2a b 2-4ac < 0, : x1 = p + qi, x2 = p - qi, p = - b 2a q = - ( b 2-4ac) 2a, if, a b c, : if ( a = = 0 & & b = = 0 & & c = = 0 ) ; else if ( a = = 0 & & b!= 0 ) ; else { b 2 if ( m > = 0) else - 4ac m; ; { p ; : # include < stdio.h > # include < math.h > q; ; { float a, b, c, x1, x2, p, q, m; printf( Enter 3 coefficients a, b, c: ) ; scanf( % f, % f, % f, &a, & b, & c) ; if( a = = 0 & & b = = 0 & & c = = 0 ) printf( any value \ n ) ; else if ( a = = 0 & & b!= 0 ) else printf( x = % f\ n, - c/ b) ; { m = b b - 4.0 a c; if( m > = 0 ) { x1 = ( - b + sqrt( m) ) / ( 2.0 a ) ; else x2 = ( - b - sqrt( m) ) / ( 2.0 a ) ; printf( x1 = % f\ n, x1 ) ; printf( x2 = % f\ n, x2 ) ; / /

{ p = - b / ( 2.0 a ) ; q = sqrt( - m) / ( 2.0 a ) ; printf( x1 = % f + % fi \ n, p, q) ; printf( x2 = % f - : % fi \ n, p, q) ; Enter 3 coefficients a, b, c: 2, 1, - 1 x1 = 0.500000 x2 = - 1.000000 Enter 3 coefficients a, b, c: 2, 1, 1 x1 = - 0.250000 + 0.661438i x2 = - 0.250000-0.661438i 5.3.2 switch else - if if,,, if, C switch switch : switch ( ) { case 1 : 1; break ; case 2 : 2; break ; case n: n ; break; default : n + 1; :,,, ;, default, break, switch - case, ( ) : switch,,,, 5.5

5 5 break switch switch, : switch case, case,, { default case, case case default, default, case, switch, C, switch : switch ( x) { case 1: switch (y ) { case 0: a + + ; break ; case 1: b + + ; break; break; case 2: a + + ; break ; case : switch ( x) { case 1: case 2: case 3: a + + ; b + + ; break; case 4: c + + ; break;, switch break,, break break,,, break break switch ( 5 6) : switch ( )

{ case 1 : 1; case 2 : 2; case n: n ; default : n + 1; 5 6 break switch 5.6, 2, 2 n n + 1 switch : i = 1, switch (i) { case 0: printf( %d, i) ; break ; case 1: printf( %d, i) ; break ; case 2: printf( %d, i) ; break ; default : printf( % d, i) ; :1 switch (i) { case 0: printf( % d, i) ; case 1: printf( % d, i) ; case 2: printf( % d, i) ; default: printf( % d, i) ; :111, case 1 switch( y) break, case 0 a + + ; break;, switch ( y), case 2 a + + ; break;, switch( x), printf, : a = 2, b = 0 # include < stdio.h > { int x = 1, y = 0, a = 0, b = 0; switch ( x) { case 1: switch ( y) { case 0: a + + ; break; case 1: b + + ; break; case 2: a + + ; break; case 3: b + + ; break;

printf( a = %d, b = % d\ n, a, b) ; 5.9,, A B C D E 90 A, 80 89 B, 70 79 C, 60 69 D, 60 E, :, 6, score, else - if, 5.7 : if ( score > = 90 & & score < = 100 ) printf( A \ n ) ; else if( score > = 80 & & score < 90 ) printf( B\ n ) ; else if( score > = 70 & & score < 80) printf( C \ n ) ; else if( score > = 60 & & score < 70) printf( D\ n ) ; else if( score > = 0 & & score < 60 ) printf( B\ n ) ; else printf( error! \ n ) ; switch switch case score 0 100 101, 101 case ( 101 case, ), (case ), caes, 100, 10, 90 80 70 ;,,, 90, 9, 80, 8, score/ 10 switch, case 0 9, 100 10 : # include < stdio.h > { int score; printf( Please enter score : ) ; scanf( % d, & score) ; switch ( score/ 10 ) { case 10: case 9: printf( % d A \ n, score) ; break; case 8: printf( % d B\ n, score) ; break; case 7: printf( % d C\ n, score) ; break; case 6: printf( % d D\ n, score) ; break; case 5: case 4: case 3: case 2: case 1: case 0: printf( % d E \ n, score) ; break;

default : printf( Input error! \ n ) ; : Please enter score : 85 85 B Please enter score : 101 101 A Please enter score : 110 Input error!,,, 101, A,, 101 109, score/ 10 10, case 10:, A if, 100, if - else switch : # include < stdio.h > { int score; printf( Please enter score : ) ; scanf( % d, & score) ; if( score < 0 score > 100) else printf( Input error! \ n ) ; { switch ( score/ 10) { case 10: case 9: printf( %d A \ n, score) ; break; case 8: printf( %d B\ n, score) ; break; case 7: printf( %d C\ n, score) ; break ; case 6: printf( %d D \ n, score) ; break; case 5: case 4: case 3: case 2: case 1: case 0: printf( %d E \ n, score) ; break;

5.4,,,,, C while do - while for,, break continue 5.4.1 while while, :, while : : while ( ) ;, ( 0), ;,,,, ( 0), while, while, 5.7 : while :,, : (1 ), (2 ),, {,, 5 7 while (3 ), ;, ( ) 5.10 n, s = 1 + 2 + 3 + + n, while :, : s, 0,, s, n, n : # include < stdio.h > { int i, n, s ; printf( Please enter n: ) ; scanf( % d, & n) ; / / n,n s = 0 ; i = 1 ; / /

while (i < = n) / /, { s = s + i ; / / i i + + ; / / printf( 1 + 2 + 3 + + % d = % d\ n, n, s) ; : Please enter n:50 1 + 2 + 3 + + 50 = 1275 5.11,, : # include < stdio.h > { char c; int num = 0; printf( : ) ; / / num 0 while( (c = getchar( ) )! = \ n ) / /,, num + + ; printf( = % d\ n, num) ; : : hi, ABC = 6 5.4.2 do - while / / 1, do - while :, do - while : do{ ; while ( ) ; :,, ( 0 ),, 5.8 : do - while :, while,, do - while :,,,, 5 8 do - while

;,,, { 5.12 n, s = 1 + 2 + 3 + + n, do - while : # include < stdio.h > { int i, n, s ; printf( Please enter n: ) ; scanf( % d, & n) ; s = 0 ; i = 1 ; do / / { s = s + i ; / / i i + + ; / / while (i < = n ) ; / /, printf( 1 + 2 + 3 + + % d = % d\ n, n, s) ; : Please enter n:50 1 + 2 + 3 + + 50 = 1275,, while do - while,,,,,, : (1 ) while int i, s; s = 0 ; i = 5 ; while (i < 5 ) { s = s + i; i + + ; printf( s = % d, s) ; : s = 0 ( 2) do - while int i, s; s = 0; i = 5; do { s = s + i; i + + ; while ( i < 5) ; printf( s = % d, s) ; : s = 5 : while, i < 5, ; do - while,, i < 5, 5.4.3 for for C, for while, while for : for ( 1; 2; 3 ) ;

: 1, 2, ( 0),, 3, 2,, 5.9 : for, 1,, ; 2,, ; 3, : for,, for ( ; i < 10 ; i + + ) sum + = i; for ( ; ; ) sum + = i ; ; / / i for 1 3, for (i = 0, j = 0 ; i < 100 ; i + +, j + + ) b[i] = a[j] ; / /, 5 9 for,, { ;, 5.13 n, s = 1 + 2 + 3 + + n, for : # include < stdio.h > { int i, n, s ; printf( Please enter n: ) ; scanf( % d, & n) ; for (i = 1, s = 0; i < = n; i + + ) s = s + i ; printf( 1 + 2 + 3 + + % d = % d\ n, n, s) ; : Please enter n:50 1 + 2 + 3 + + 50 = 1275 5.14 n, n! :,, : s,, s 1,, s = s i(i = 1, 2, n ), n, n! : # include < stdio.h >

{ int i, n, s ; printf( Please enter n: ) ; scanf( % d, & n) ; for (i = 1, s = 1; i < = n; i + + ) s = s i ; printf( % d! = 1 2 %d = % d\ n, n, n, s ) ; : Please enter n:5 5! = 1 2 5 = 120,, 5.4.4 C while do - while for,,,, : (1 ),, ( 2 ) for while, ; do - while for while, do - while (3 ) while do - while,, for (4 ) do - while (5 ) for,, 5.4.5 C,,,, C,,,,,, 5.15 1! + 2! + 3! +...+ n!, n :,, i i, i n, j i,

i, i : # include stdio.h { int i, j, n, t, sum = 0; printf( please Input n : ) ; scanf( % d, & n) ; for (i = 1; i < = n; i + + ) { t = 1 ; for (j = 1 ; j < = i; j + + ) t = t j; sum + = t ; / / n, / / i, / / i printf( sum = % d, sum) ; / / : please Input n : 8 sum = 46233, i i - 1 i, : # include stdio.h { int i, n, t, s um = 0; printf( please Input n : ) ; scanf( % d, & n) ; t = 1 ; for (i = 1; i < = n; i + + ) { t = t i ; sum + = t ; printf( sum = % d\ n, sum ) ; 5.16, 1 1 = 1 1 2 = 2 1 3 = 3 1 8 = 8 1 9 = 9 2 2 = 4 2 3 = 6 2 4 = 8 2 9 = 18 9 9 = 81 :, 9 1,, i, 1 9, j i 9,

: # include < stdio.h > { int i, j, k ; for ( i = 1; i < = 9; i + + ) / /, 9 { for ( j = i; j < = 9; j + + ) / /, 9 - i + 1 { k = i j; printf( % d %d = % 2d, i, j, k ) ; printf( \ n ) ;, j = i; j < = 9; j = 1; j < = 9; j = 1; j < = i;,, 5.5,,, C break continue, C goto goto, goto, 5.5.1 break break : break; break switch, switch, switch, break switch, switch, switch 5.17 10,, : for,,, 10, i > 10 ;, break, : # include < stdio.h > { int s um = 0, x, i; printf( 10 : \ n ) ; for (i = 1; i < = 10; i + + ) / / i > 10, { scanf( % d, & x) ; / / x

if ( x < 0) break; / / x < 0, sum = sum + x ; printf( \ ns um = % d\ n, sum) ; : 10 : 5 4 3 8 12 61 0-1 sum = 93 5.5.2 continue continue : continue ; / / continue,, while do - while, ( ) ; for, 3 continue break : continue, ; break 5.18,, : while,, continue ( ),, : # include < stdio.h > { char c; printf( : ) ; while( (c = getchar( ) )! = \ n ) { if( c > = A & & c < = Z ) continue ; putchar (c) ; printf( \ n ) ; : : ABheKllow12 hellow12

5.6 5.19, : 1 1 2 1 1 2 3 2 1 1 2 3 4 3 2 1 1 2 3 4 5 4 3 2 1 1 2 3 4 5 6 5 4 3 2 1 1 2 3 4 5 6 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 :, 1 9, 9, i ( 1 i 9 ), 1 i, i 1,, i, ( for ) : # include < stdio.h > { int i, j; for (i = 1; i < = 9; i + + ) { for ( j = 1 ; j < i; j + + ) printf( % 3d, j) ; for ( j = i; j > 0; j - - ) printf( % 3d, j) ; printf( \ n ) ; : 1 1 2 1 1 2 3 2 1 1 2 3 4 3 2 1 1 2 3 4 5 4 3 2 1 1 2 3 4 5 6 5 4 3 2 1 1 2 3 4 5 6 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1,,,,, blank

# include < stdio.h > { int i, j, b lank = 30; for (i = 1; i < = 9; i + +, blank - = 3 ) { for ( j = 1 ; j < blank ; j + + ) printf( ) ; for ( j = 1 ; j < i; j + + ) printf( % 3d, j) ; for ( j = i; j > 0; j - - ) printf( % 3d, j) ; printf( \ n ) ; : 1 1 2 1 1 2 3 2 1 1 2 3 4 3 2 1 1 2 3 4 5 4 3 2 1 1 2 3 4 5 6 5 4 3 2 1 1 2 3 4 5 6 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 5.20 2008 8 8 ( ) : 2008 8 8, 2008, 2008, 7 ( ),, : # include < stdio.h > { int year = 2008, month = 8, day = 8 ; int weekday = 2 ; int i, num, yeardays = 0 ; / / 2008-8 - 8 2008 for (i = 1; i < month; i + + ) { / / switch (i) { case 1: case 3: case 5: case 7: case 8: case 10: / / 2008-1 - 1

case 12: num = 31 ; break ; / / 31 case 4: case 6: case 9: case 11: num = 30 ; break ; case 2: if ( ( year %4 = = 0 & & year %100! = 0) / / 30 year %400 = = 0) num = 29; / / 29 else num = 28; break ; default : n um = 0; yeardays + = num; yea rdays = yeardays + day; / / 2008-8 - 8 weekday = ( yeardays - 1 + weekday ) %7; / / 28 printf( % d % d % d % d\ n, year, month, day, weekday) ; : 2008 8 8,, : # include < stdio.h > { int year, month, day, weekday; int i, num, yeardays = 0 ; / /, : 2008-8 - 8 printf( : ) ; scanf( % d - % d - %d, & year, & month, & day) ; / / 1 1 printf( % d 1 1 :, year ) ; scanf( % d, & weekday) ; / / for (i = 1; i < month; i + + ) { / / switch (i) { case 1: case 3: case 5:

case 7: case 8: case 10: case 12: num = 31 ; break ; case 4: case 6: case 9: case 11: num = 30 ; break ; case 2: if ( ( year %4 = = 0 & & year %100! = 0 ) year % 400 = = 0 ) num = 29; else num = 28; break; default : n um = 0; yeardays + = num; yea rdays = yeardays + day; / / 1 yeardays = ( yeardays - 1) ; / / weekday = ( yeardays + week day) % 7; printf( % d % d % d % d\ n, year, month, day, weekday) ; : : 2008-5 - 1 2008 1 1 : 2 2008 5 1 5.21 100, 10 : 1, 1 k : k 2, 3, 4,, k - 1,, k,, k, 2, 3,, k for flag, 1, j 2 k,, k j, flag 0, for,, flag 1, k : flag = 1; for ( i = 2; i < = sqrt( k) ; i + + )

if ( k % i = = 0) { flag = 0; break; if ( flag = = 1) printf( %d, k) ;, 100, 100,, k 2 100, for for ( k = 2 ; k < = 100 ; k + + ) { k ;, k;, 10, num,, 1, 10,, : # include < stdio.h > # include < math.h > { int k, j, num = 0, flag; for ( k = 2 ; k < = 100 ; k + + ) { flag = 1; for ( j = 2 ; j < = sqrt( k) ; j + + ) if ( k % j = = 0 ) { flag = 0; break ; if ( flag = = 1) { printf( %3d, k ) ; num + + ; if ( num% 10 = = 0) printf( \ n ) ; printf( \ n 100 %d.\ n, num) ; : 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 100 25 5.22 e, e = 1 + 1 1! + 1 2! + 1 3! + + 1, n! 10-5, : : e = e + term, term,, 1 2! = 1 1! 2, 1 3! = 1 3,,, : term 2! n = t ermn - 1 n, C : term = t erm/ n;, term 1.0, n 1, n n = n + 1, while do - while, term <

10-5, count, 0, 1, count, n : 1 : (1 ) while # include < stdio.h > void { int n, count = 0 ; double term, e; e = 1; term = 1.0; n = 1; while (term > = 1e - 5 ) / / 1 e / / / / { term = term/ n; / / n + + ; e = e + term; count + + ; / / / / e / /, 1 printf( e = % lf, = %d \ n, e, count) ; (2 ) do - while # include < stdio.h > { int n = 1, count = 0; double term = 1, e = 0; do { e = e + term; / / e term = term/ n; n + + ; count + + ; while ( term > = 1e - 5) ; e = e + term; / / / / 1 / / printf( e = % lf, = %d \ n, e, count) ; : e = 2.718282, = 9,, 5.23 ( Fibonacci) 12 : 1,,

:, 3, 3, :, : f1 = 1, f2 = 1, fi = fi - 1 + fi - 2 (i 3 ), 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5,, 12 144, 12, for : # include < stdio.h > { int f1, f2, f, i; f1 = 1; / / f2 = 1; / / printf( %10d%10d, f1, f2 ) ; for ( i = 3; i < = 12; i + + ) { f = f1 + f2; / / printf( %10d, f) ; if( i % 4 = = 0 ) printf( \ n ) ; / / 4 f1 = f2; / / f2 = f; printf( \ n ) ; : 1 1 2 3 5 8 13 21 34 55 89 144, f = f1 + f2,, f1,, f f2 + f1, f1, f2, f2 : f1 = f1 + f2 ; f2 = f2 + f1 ;,, : # include < stdio.h >

int main( ) { int f1, f2, i ; f1 = f2 = 1 ; / / 1 2 printf( %10d%10d, f1, f2 ) ; for ( i = 2; i < = 6; i + + ) { f1 = f1 + f2 ; / / f2 = f2 + f1 ; / / printf( %10d%10d, f1, f2 ) ; if( i % 2 = = 0 ) printf( \ n ) ; / / 4 printf( \ n ) ; 5.24, 100 100, 5, 3, 1 3,, :, ;, ;,,? :,,,,,,,, x y z, : (1 ) : x + y + z = 100( ) (2 ) : 5x + 3y + (1/ 3 )z = 100 ( ), 15x + 9y + z = 300, x y z, 100 20, 33,, 100, 0 x 20, 0 y 33, 0 z 100, x y z, x y z,, : # include < stdio.h > int main( ) { int x, y, z; for ( x = 0; x < = 20; x + + ) for ( y = 0; y < = 33; y + + ) for (z = 0; z < = 100 ; z + + ) : if( x + y + z = = 100 & & 15 x + 9 y + z = = 300 ) printf( x = % d, y = % d, z = % d\ n, x, y, z) ; x = 0, y = 25, z = 75

x = 4, y = 18, z = 78 x = 8, y = 11, z = 81 x = 12, y = 4, z = 84 4, 21 34 101 = 72114, x y, z 100 - x - y,, x y, 714, : # include < stdio.h > { int x, y, z; for ( x = 0; x < = 20; x + + ) for ( y = 0; y < = 33; y + + ) { z = 100 - x - y; if( 15 x + 9 y + z = = 300 ) printf( x = % d, y = % d, z = % d\ n, x, y, z) ;, C, C ( ) {,,, C if switch, if, C if else switch break, while for do - while, while for,, ; do - while,,, for, while do - while break continue, : continue, break

1. ( s1 s2 C ), : A. if ( a) s1 ; else s2; B. if (! a) s2; else s1; C. if ( a! = 0) s1; else s2; D. if ( a = = 0 ) s1; else s2 ; 2. { int a = 3, b = 4, c = 5, d = 2; if( a > b ) if( b > c) else printf( % d, d + + ) ; printf( % d, + + d) ; printf( % d\ n, d ) ; A. 2 B. 3 C. 33 D. 34 3. while( x) x : A. x = = 0 B. x = = 1 C. x! = 1 D. x! = 0 4., 5!, A. for (i = 1, p = 1; i < = 5; i + + ) p = i; B. for( i = 1; i < = 5; i + + ){ p = 1 ; p = i; C. i = 1; p = 1; while(i < = 5 ){p = i; i + + ; D. i = 1; p = 1; do{p = i; i + + ; while(i < = 5 ) ; 5. { 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 5

1. 3, 2.C, if, else if 3. C, if - goto 4., break, continue 5. { int i; for (i = 0; i < 3; i + + ) switch(i) { case 0: printf( %d, i) ; case 2: printf( %d, i) ; default : printf( % d, i) ; 6. { int x = 1, y = 0, a = 0, b = 0; switch ( x) { case 1: switch ( y) { case 0: a + + ; break; case 1: b + + ; break; case 2: a + + ; b + + ; break ; printf( % d %d \ n, a, b) ; 7., while int i = 0; while (i < 10) { if (i < 1) continue ; if (i = = 5) break; i + + ; 8. 1234, { int n, sum = 0 ;

n = 1234; do { sum = sum + ( n%10) ( n%10) ; while( n ) ; printf( sum = % d, sum) ; 1. : y = e - x x > 0 ; 1 x = 0, x, y - e x x < 0 2. switch,, ( ) 3. 1 + 3 + 5 + 7 + + 99 4. 1-1/ 2 + 1/ 3-1/ 4 + + 1/ 99-1/ 100 +, 10-4 5. 20, : (1 ) ; (2 ) ; (3 ) 6. 1, 2, 3, 4 4, ( 4, : 1111,1122, 1212 ). 7., 3,., 153, 153 = 1 1 1 + 5 5 5 + 3 3 3 8.,, 9. 100m,, 10, ( m )? 10? 10.,

6, :, :, 6.1 6.1.1,,,,, 1 000, 1 000, 1 000,, C,,,,,,

6.1.2 1 (1 ),,, C : [ ] ;,,,,, : int n um[ 10] ;, num, 10, num [ 0 ] num [ 1 ] num [9 ], :,, int n; scanf( % d, & n) ; int a[ n ] ; 1 0, 1 (2 ), C ( static), C, : [ ] = { 1, 2,, n;, 0,,, 0,, int n um[ 5 ] = {10, 20,30, 40,50 ; num, num [ 0 ] num [ 1 ] n um [ 2 ] num [ 3 ] num[ 4] 10 20 30 40 50,, VC + + 6.0 0, int num[ 5] = {10, 20;, num num [ 0 ] = 10, num [ 1 ] = 20, num[ 2] num[ 3] num[ 4] 0, static int num[5 ] = {10,20 ;

VC + + 6.0,, int num [5 ] = {10,, 30, 40, 50; static int num[5 ] = {10,, 30,40, 50;, int num[ ] = {10, 20,30, 40,50 ; num num[ 0] num[ 1] num[ 2 ] num [3 ] num[ 4] 5, 10 20 30 40 50 : C,,, int num [5 ] ; num[ 5] = {10, 20, 30, 40, 50; 2 C : int num [10] ;, n um 10, num[ 0 ] num [ 9 ], 6.1 num num [0 ] num[1 ] num[2 ] num[ 3] num[4 ] num[ 5] num[ 6] num[ 7] num[ 8] num[ 9] 3 6.1 num,, : [ ], [ 0, - 1], int m = 3 ; int a[ 4], b[ 3] = {1,2,3; scanf( % d, a) ; / / a[0] a[1 ] = 10; a[2 ] = b[ m - 1] ; scanf( % d, & a[3 ] ) ; # define size 4 int a[ size], b[ size] ; scanf( % d, & a) ; / / printf( % d, a) ; / / printf( % d, a[ size] ) ; / / b = a ; / / C,

, ( ), b = a : a [ size] printf a [ size] size, size, printf a[ size], C 0 size - 1,,,,, 6.1 10, : 10, 10, ( ),, count1 count2, ;, 2, count2 1, count1 1; : # include < stdio.h > { int i, count1 = 0, count2 = 0; int data[ 10 ] ; for (i = 0; i < 10; i + + ) scanf( % d, & data[i] ) ; for (i = 0; i < 10; i + + ) { if( da ta[ i] %2 = = 0) count2 + + ; else count1 + + ; printf( : % d\ n, count2) ; printf( : % d\ n, count1) ; :,? 6.2 5.23, 6 : # include < stdio.h > { int i; int f[12] = {1, 1; / / for (i = 2; i < 12; i + + ) f[i] = f[i - 2] + f[i - 1 ] ; / /

for (i = 0; i < 12; i + + ) { printf( %10d, f[ i] ) ; if( (i + 1 ) %6 = = 0) printf( \ n ) ; / / 6.2 1 (1 ), : [ ] [ ] ;,,, 0, int xx [2 ] [ 2] ;, xx 2 2, 4, 1 xx [ 0] [ 0 ] xx [ 0] [ 1 ] 2, 2 xx [1 ] [ 0] xx[ 1] [1 ] 2, 4 (2 ) : [ ] [ ] = {{ 1,, { n, ;, int data[ 2] [3 ] = {{1, 2, 3, {4, 5, 6; data[0 ] [ 0] data[0 ] [ 1] data [0 ] [ 2] data[ 1] [0 ] data[1 ] [ 1] data[1 ] [ 2] 1 2 3 4 5 6 VC + + 6.0, (, ),, 0 ( ), int num [3 ] [ 3 ] = {{1, 2, {4, 5, 6;, num [0 ] [ 0] num[ 0] [1 ] num [0 ] [ 2] num [ 1 ] [ 0 ] num [ 1 ] [ 1] num [ 1] [2 ], num [2 ] [ 0] num[ 2] [1 ] num[2 ] [ 2] 1 2 0 4 5 6 0 0 0, int num [3 ] [ 3] = {{1, 2, 3, {, {4, 5, 6; int num [3 ] [ 3] = {{1, 2, 3,, {4, 5, 6; int num [3 ] [ 3] = {{1,, 3, {4, 5, 6; [ ] [ ] = { 1,, n, ;,,, int num[ 2] [2 ] = {1, 2, 3, 4; : num[ 0] [0 ] num [0 ] [ 1] num[ 1] [0 ] num[ 1] [1 ] 1 2 3 4,,, int num [3 ] [ 2] = {1, 2, 3, 6;,,, C

, int num[ ] [ 3 ] = {1, 2, 3, 4, 5, 6, 7, 8, 9 ;, int num [3 ] [ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9; 2,,, 1,, int a[2 ] [ 5 ] ;, a 6.2 a[0 ] [ 0] a[0 ] [ 1] a[ 0] [2 ] a[ 0] [3 ] a[ 0] [4 ] a[ 1] [0 ] a[ 1] [1 ] a[ 1] [2 ] a[ 1] [3 ] a[ 1] [4 ] 6.2 a,, a a[0 ] a[ 1] 2, a[0 ] a[1 ] 5, : a[0 ] : a[ 0] [0 ], a[0 ] [ 1], a[0 ] [ 2], a[ 0] [3 ], a[0 ] [ 4] a[1 ] : a[ 1] [0 ], a[1 ] [ 1], a[1 ] [ 2], a[ 1] [3 ], a[1 ] [ 4], 6.3 : 4 4, :,,,,, : # include < stdio.h > { int i, j, k, a[ 4] [4 ] ; printf( 16! \ n ) ; for (i = 0; i < 4; i + + ) { for (j = 0 ; j < 4 ; j + + ) scanf( % d, & a[i] [j] ) ; printf( \ n : \ n ) ; for (i = 0; i < 4; i + + ) { for (j = 0 ; j < 4 ; j + + ) printf( %5d, a[i] [j] ) ; printf( \ n ) ; printf( : \ n ) ; for (i = 0; i < 4; i + + ) { for (j = 0 ; j < 4 ; j + + )

3 { printf( %5d, a[j] [i] ) ; printf( \ n ) ; 3 3, : [ 1 ] [ 2 ] [ 3] ;,, : int x[ 2] [ 2 ] [ 3 ] ;, x 12, : x[ 0] [0 ] [ 0], x[ 0] [0 ] [ 1], x[ 0] [0 ] [ 2], x[ 0] [1 ] [ 0], x[ 0] [1 ] [ 1], x[ 0] [1 ] [ 2] x[ 1] [0 ] [ 0], x[ 1] [0 ] [ 1], x[ 1] [0 ] [ 2], x[ 1] [1 ] [ 0], x[ 1] [1 ] [ 1], x[ 1] [1 ] [ 2], 6.3 1,, : char str [10] ; str, str [ 0 ] str [ 1 ]... str [ 9 ], 10, char str[ 8 ] = { w, e, l, c, o, m, e ;, char str1[ ] = { w, e, l, c, o, m, e ;,,, str [7 ] ;,, str1 7 2 C,,, \ 0, : welcome 7, 8, \0 \0,, welcome 7, char str2 [ 8 ] = { w, e, l, c, o, m, e, \0 ;, str2, str1,

, char str2 [ 8 ] = { welcome ;,, char str2 [8 ] = welcome ;, welcome, \ 0, \0, \ 0, 1, : char str3 [ 7] = welcome ;,, \ 0 str3,,,, char str3[ ] = welcome ;,,,, str3 8, \0 3,,, \ 0 : char s1[ 10 ] = { w, e, l, c, o, m, e ; char s2[ 10 ] = welcome ; s1 7,, s2, \0, \ 0 welcome,, \0, 6.3 6.4 s1 s2 w e l c o m e 6.3 s1 w e l c o m e 0 6.4 s2,,, ;, \ 0, \ 0, \0, 4,, (1 ) getchar scanf, char str[ 5] ;, for (i = 0; i < 5; i + + ) str[ i] = getchar( ) ;, for ( i = 0; i < 5; i + + ) scanf( % c, & str [i] ) ;, getchar scanf, \ 0,

,,, getchar scanf, (2 ) gets scanf, char xx[ 10] ; gets ( xx ) ; char xx[ 10 ] ; scanf( % s, x x) ; (3 ) putchar printf, for (i = 0; i < 10 ; i + + ) putchar ( xx [i] ) for(i = 0; i < 10; i + + ) printf( % c, xx [i] ) ; (4 ) puts printf, puts ( xx) ; printf( % s, xx) ; 5,, : char name[ 10 ] [ 80 ] ;, name 10, 80 ( 79, \ 0 ),, char str [ 3 ] [ 6 ] = { Tom, Jack, Mike ; char str[ ] [ 6] = { Tom, Jack, Mike ;, 6 5: str[ 0] T o m \ 0 str[ 1] J a c k \ 0 str[ 2] M i k e \ 0 6.5 str 6.4, :,, : # include < stdio.h > { char str1 [40], str2[ 20 ] ; int i, k; printf( \ n ) ; scanf( % s, str1) ; printf( \ n ) ; scanf( % s, str2) ; for (i = 0; str1[ i]! = \ 0 ; i + + ) ; for ( k = 0 ; str2 [ k]! = \0 ; k + + ) { str1[i] = str2 [ k] ; i + + ; str1[i] = \ 0 ;

printf( % s\ n, str1 ) ; 6.5,,,, :,, ;,, : # include stdio.h # include string.h { char str[ 50 ] ; int i, k, num = 0; printf( please input a string! \ n ) ; scanf( % s, str) ; k = strlen( str) ; for (i = 0; i < k/ 2; i + + ) { if( str[ i] = = str[ k - 1 - i] ) num + + ; if( num = = k/ 2 ) printf(! ) ; else printf(! ) ; 6.4 C,,,, 6.6 10 :, ;,,,,,, : # include < stdio.h > { int i, j, mindata, minid; int xx[ 10 ] = {4, 2, 5, 9, 0, 1, 8, 6, 3, 7 ; for(i = 0; i < 9; i + + ) { mindata = xx [i] ;

minid = i; for( j = i + 1; j < 10; j + + ) if( mindata > xx[ j] ) { mindat a = xx[ j] ; minid = j; xx [ minid] = xx [i] ; xx [i] = mindata; for(i = 0; i < 10 ; i + + ) printf( %d, xx[i] ) ; 6.7 10 : :10 10,,,,,, 9, 9 : # include < stdio.h > { int i, j, temp; int xx[ 10 ] = {4, 2, 5, 9, 0, 1, 8, 6, 3, 7 ; for(i = 0; i < 10 ; i + + ) for( j = 0; j < 9 - i; j + + ) / /, if( xx [j] > xx [j + 1 ] ) / / {temp = xx[ j] ; xx[j] = xx[ j + 1 ] ; xx [j + 1 ] = temp; for( j = 0; j < 10; j + + ) printf( a[ % d] = % d\ n, j, xx[j] ) ;,, (, ) C, [ 0, - 1] ( : ),,,,, (,,, n n ) C,,, ( ), \ 0,

\ 0,,,, \0 1., 2., x[ 1 ] [ 2 ] [ 3 ], 6 3. int a[ 12 ] = {1, 4, 7, 10, 2, 5, 8, 11, 3, 6, 9, 12, i = 10;, a[ a [ i] ] 4. char s1 [12] = { string ; char s2 [12] = { string\ n ;, printf ( % d, %d, strlen( s1), strlen( s2 ) ) ; 5. char str [3 ] [ 20 ] = { computer, windows, Unix ;, printf ( % s \ n, str [2 ] ) ;, 6. int a[ ] [4 ] = {5, 6, 8, 7, 2, 4 ;, 7. char str[ ] = { INTEL \ ncpu ;, puts( str) ; ( ) 1. 10,, 2. x [10], Ok, Not Found : 3. x [ 4 ] [4 ],, sum1 sum2, ( ; ) 4., 5. x [4 ] [ 4],, x [0 ] [ 0] x [3 ] [ 3], x[ 0] [1 ] x[ 2] [3 ] 6.,,, 7. 5,

7, C :, :,, 7.1 C, main, C, C C,,,,, C 1, (1 ) C,,,, printf scanf getchar putchar

(2 ),,, 2, (1 ) ( ) (2 ),, 3, (1 ),, (2 ), ( ) ;, ( ), 4 C,,,, 7.2 7.2.1, ANSI C : ( ) { ; ;,,, : 1, 2,,, extern static extern, st atic,, extern

,,,, return ( ) ;, ( ) ( ), return, return ;, void,,, C : ( 1, 2,, n) 1; 2; n ; { ; ;,, 7.1, 4 int max4 (int a, int b, int c, int d) / / { int m1, m2 ; / / if( a > = b ) m1 = a ; / / else m1 = b; if( c > = d) m2 = c; else m2 = d; if( m1 > m2 ) return m1; else return m2; { int x, a1, b1; a1 = 5, b1 = 10 ; x = max4( 12,3 3, a1, b1) ; printf( \ nmax: %d, x) ;, max4 max4,,,,, 4 a b c d, m1 m2

7.2.2 1, : ( ) ;,,,, printf,,,,,,,, ( ),,, : # include < stdio.h > { int x, y = 2000 ; x = printf( H ere: y = % d,, y) ; printf( x = % d\ n, x) ; printf( Do you understand? \ n ) ; : ( ) H ere: y = 2000, x = 10 Do you understand?,, : ( ), int x; int max4(int u, int v, int s, int t ) ; x = max4 (12, 3 3,5,8 ) ; void,, int x; void s ub (int x1, int x2) ; x = sub (2, 3 ) ; : 2 :,, (1 ) ( ),, (2 ),,, (3 ), return; retur n,, return ( ) ;, (

, ) (4 ),, ;, 3, ( ), C,,,,,, 4 : (1 ) : (, ) ; : (, ) ; A NSI C, 7.2,, { float add( float a, float b) ; / / float x, y, z ; printf( \ n input float x, y: ) ; scanf( % f, % f, & x, & y) ; z = add( x, y) ; printf( \ n sum is % f\ n, z) ; float add (float a, float b) { float c ; c = a + b; return c; / / float, float, float add ( float a, float b) ; float add( float, float) ; (2 ) : ( ) ;

ANSI C,,, A NSI C,, 7.3 # include < stdio.h > double area( ) ; { double r; printf( input circle s radius: ) ; scanf( % lf, & r) ; / / printf( the circle s area is % f\ n, area( r) ) ; / / double area( double radius ) { return (3.1415926 radius radius ) ; (3 ) / / area, # include <.h > (4 ),,, : 7.2.3 extern (, ) ;,, C ( C99, int) ;,,, (1 ),, max max4 (2 ),, fwrite, (3 ),,, void void exit,

,,, printf,,, return,, :, ;, void : return ; return ( ) ; void return ( ), retur n 7.4 max 3 { int a, b, c; printf( please input a, b: \ n ) ; scanf( % d, % d, & a, & b ) ; c = max(a, b ) ; printf( max = % d\ n, c) ; a = 16; b = 24; / / printf( max = % d\ n, max( a, b) ) ; / / max (a + b, a b) ; max (int x, int y) { if( x > = y) return ( x) ; else return ( y) ; / /, max, main 3 max max, c; max printf, printf ; max, ( ), max, 7.3,,, 7.3.1 (1 ),,,,,,,

(2 ),,, (3 ),,, C,,, (4 ) C,,, 7.3.2 7.5 void swap(int a, int b) { a = a + b; b = a - b; a = a - b; printf( \ na = % d, b = % d, a, b) ; / / a = 20, b = 10 { int a = 10, b = 20; swap( a, b) ; printf( \ na = % d, b = % d, a, b) ; / / a = 10, b = 20,, swap, a = 20, b = 10, C,,, a 10, b 20, a b, swap, swap a b, 8, ( ) 7.4 C, 7.4.1,, C :, 7.1 main

f1, main, f1, f1 f2, f1, f2, f2, f1, f1, f1, main 7.1 7.6 1! + 2! + + n! :, 5 5.15 n main, Sfac, Sfac fac : double fac(int n) { double j = 1.0; int i ; for (i = 1 ; i < = n; i + + ) j = i; return j; double Sfac(int n) { double s = 0; int i ; for (i = 1 ; i < = n; i + + ) return s ; { double s; int n; s + = fac(i) ; printf( \ ninput n : ) ; scanf( % d, & n ) ; s = Sfac( n) ; printf( \ n1! + 2! +... + %d! = % f, n, s) ; / / fac, / / Sfac, : n,???

7.4.2 : n! = n ( n - 1)! ( n - 1)! = ( n - 1 ) ( n - 2)! 1! = 1 7.7 n! : n! = 1 n = 0 n = 1 : n ( n - 1)! n > 1 # include < stdio.h > long fac(int m) ; { int n; printf( \ n n = ) ;, C n! / / scanf( % d, & n ) ; / / printf( %d! = % ld\ n, n, fac( n) ) ; / / long fac(int m) { long p; if( m > 1) else p = m fac( m - 1) ; / / n! p = 1L ; return( p) ; / /, : 5, : 5! = 120,,,,,,,,,,,

7.5 C,,, ;,, ;,,, 7.5.1,, {,,, C,,,, 7.8 # include < stdio.h > void func( ) ; / / { int a = 10; / / a, main printf( \ n a = % d,, a) ; { int a = 20; / / a, func( ) ; printf( a = % d,, a) ; printf( a = % d\ n, a) ; void func( ) { int a = 30; / / a, func printf( a = % d,, a) ; : a = 10, a = 20, a = 30, a = 10 a, main func, a a, a a, a func, a, 30, a ( 20 ), func, func a C 7.9 void Func( ) { int n;

scanf( % d, & n) ; / / int m; m = 10 n; printf( m = % d\ n, m ) ; / /,, m int m; scanf ( % d, & n ) ;, Func,,,,,,,,,,, 7.5.3 7.5.2,,, a, b, sub1 sub2 main, a1, b1 s ub2 main float a, b; sub1 (int x) { int i; int a1, b1 ; sub2 (int y ) { int j; { / / / / C,,, ( ), 7.10 # include < stdio.h > int a = 1, b = 2 ; void fac( ) / / a, b { int a = 3 ; / / a a

printf( \ nfac : a = % d, b = % d\ n, a, b ) ; { int b = 4 ; / / b b fac( ) ; printf( main: a = %d, b = % d\ n, a, b) ; : fac: a = 3, b = 2 main : a = 1, b = 4,,,,, :,,, 7.5.3 C, :,, :,, ;, C 4, 4 : ( ) ( ) extern static register auto,, : 1 ;, auto,,,,,, 2 register CPU,,,

CPU,, register,,, & C,, register,,,, 3 static,,,,, st atic, :,,,,, ;, 7.11 int s um(int x) { static int j = 0; / / j j = j + x; return j; { int i = 1 ; printf( sum(i) = ) ; for( ; i < = 5 ; i + = 2 ) printf( % d,, sum (i) ) ; printf( i = %d \ n, i) ; : sum(i) = 1,4,9, i = 7, 3 sum, j, 0;, j, j 4 extern C, A B ( ), A extern, C, A, extern, 7.12

7.5.4 # include < stdio.h > int n = 0; { int n = 10; printf( %d, n) ; { ext ern n; / /, 0 n n + + ; / / 0 n printf( % d, n ) ; / / 1 n printf( %d \ n, + + n ) ; / /, n : 10 1 11,, ;,,,,,, 7.1 7.1 static ( auto) auto register static,, :,, ;,,,, ;

,,,, ;,,, 7.6 7.13 LeapYear, y, 1, 0 : 4 100 400, : int LeapYear(int y) { if( y%4 = = 0 & & y% 100! = 0 y%400 = = 0) else return 1; return 0; 7.14 s = a + aa + aaa + + aa aa( n a), a, a = 2, n = 5, s = 2 + 22 + 222 + 2222 + 22222, 24690 : : n a, s long sub(int a, int n) { long m = 0; int i; for (i = 1; i < = n; i + + ) m = m 10 + a; return m; { int A, N, i; long s = 0; printf( \ ninput A, N : ) ; scanf( % d%d, & A, & N) ; for(i = 1; i < = N ; i + + ) s + = sub (A, i) ; printf( s = % ld\ n, s ) ; : ( :2 5 ) s = 24690 / / n, 1 a, n a

7.15,,,, : # include < stdio.h > int gcd( int x, int y) ; int gcm (int x, int y) ; { int m, n; printf( input data : ) ; scanf( % d, % d, & m, & n ) ; if( m < n) m = m + n, n = m - n, m = m - n;/ / m n, m, n printf( \ ngcd = % d, gcd( m, n) ) ; printf( \ ngcm = % d, gcm( m, n ) ) ; int gcd( int x, int y) { int t ; while( y! = 0) { t = x%y; return x; x = y; y = t; int gcm (int x, int y) { int t ; t = x y/ gcd ( x, y) ; return t; / / / / / / 7.16 e 1 + 1/ 1! + 1/ 2! + 1/ 3! + 1/ n!, 10-5 : : n! fac 1/ n! dfac, dfac e double fac(int n) ; double dfac(int n ) ; { int i = 1 ; double e = 1.0; while( dfac(i) > 1e - 5 ) e + = dfac(i + + ) ; printf( e = % lf\ n, e) ; / /

double fac(int n) { double f = 1.0; int i ; for (i = 1 ; i < = n; i + + ) f = i; return f; double dfac(int n ) { double d; d = 1/ fac( n) ; return d;, dfac, dfac fac,,,,,, C,,,,,,,, retur n,,, void,, C,,, ;, C,,,,,,, ;,,, extern,

1.C, A. B. C. D. 2.C, A., B., C. D. 3. C, A. C,,, B. C C. C, D. C 4.C A. B. C. main D. 5.C A. auto B. static C. exter n D. 6. f( ( e1, e2), ( e3, e4, e5) ) ; A. 5 B. 4 C. 2 D. 1 7.C,, A. static B. sta tic auto C. auto register D. register static 8. A. B. C. D. 9., A. B. C. D. retur n 10. f, f(4 ), int f(int n) { if( n) return f( n - 1) + n; else return n ; A. 10 B. 4 C. 0 D. 1. 7

2.,, 3.,,,, 4., i int i; int f(int x ) { static int k = 0; x + = k + + ; return x; { i = f( f(1 ) ) ; 1.,,,, 2. days : : y, m, d : : 3., 123, 321 4.,, 5., 6 = 1 + 2 + 3, 6 : factor( n) n, PriFac( n ) n,, 1 30 000

8, :,,, :,, main 8.1 C, C,, p a, p a,,,,, 8.1.1,, ( ),

C,, C,,,? C,, ( ),,,, ( type) ( name) ( value) (address) C,, char c = a ; int i = 10;,, c, i 4, C 8.1, 8.1 8 1 c 0x1000 i 0x2000 8.1, i = c;, : c, c ( ) 0x1000, a ( 97), i, i 0x2000, i, 4, 97 0x2000 0x2003 8.1.2,,,,, : [ = ] ;,,, : int i;, i, i, : int a ; int p1 = &a ; / / p1 a

8.1.3 int p2 = p1; / / p2 p1 a char p3 = H ello! ; / / p3 H ello! 1 : =,, : int a, p; p = & a;,, a, p;, a p, &,,,,,,,!, int p; p = 1000;, 0, p = 0 ;, 0, N ULL, stdio.h, : int a[ 5], m, p1, p2, p3, p4 ; float f, fp = &f; p1 = & m; p2 = p1 ; p3 = a ; / / fp, f / / p1 m / / p2 m p4 = & a[1 ] ; / / p4 a[ 1] / / p3 a, : float f, fp = &f; float fp = & f, f;?? 2 :,, ( ),,,,, 8.1 { int a = 10, p; / / p p p = & a ; / / a p, p a printf( \ na = % d, a = % d\ n, a, p) ; / / p a : a = 10, a = 10

8.2 ( 8 2 ) & ( ) ( ) :, 2, 8.2,, C,,,, 8.2.1 : ; ; 1, p, p = p + n p n : int a[ 5 ], p = a;, p a [0 ], p = p + 2;, p a[ 2], p + 2 p, p a[0 ], a[1 ], a[ 2 ],, a[ 0] 0x1000, p = a, p 0x1000, 4, : p + 2 = 0x1000 + sizeof ( int) 2 = 0x1000 + 4 2 = 0x1008, 0x1008 a[2 ], p + n( p - n ) ( ) n 1,, ; 1, 4 ( ),,,, p n, p = p + 1, p n,, 2,,, 1 : int a[ 5], p = & a[ 3] ;, p a[3 ], p - - ;, p a[2 ] 3,

, : int a[ 5], p1 = & a[1 ], p2 = & a[ 4] ; / / p1 a[1], p2 a[ 4] printf( % d, p2 - p1) ; / / 3 :, 8.2.2,,, : int a[ 5 ], p1 = &a [ 1 ], p2 = & a[ 4 ] ;, p1 p2 a[1 ] a[4 ], printf ( % d, p2 > p1 ) ; 1 ( ) :, 0, p = = 0 p 8.3,,,, 8.3.1 C,, : int a[ 10 ], p;, p ( a), : p = a; p = &a[ 0], a a [0 ],, p a, a[i], p + i a + i a[i], 4 : ( p + i) (a + i) p [i] a[i],, ;, [ ], 1, i, 8.2 : # include < stdio.h > { int i, a[10], p = a ; / / p a printf( \ ninput data: ) ; for(i = 0; i < 10 ; i + + ) scanf( % d, p + i) ; / / p + i while( p < = a + 9) / / a + 9 a[9] { printf( %d, p) ; / /, p

p + + ; / / p printf( \ n ) ; p = a; for (i = 0; i < 10 ; i + + ) / / p a printf( %d, ( p + i) ) ; / /, p printf( \ n ) ;,,, p, p ;, p,, p = a; p, p, i 8.3 10,, :, float f [ 10 ],, 10 f, f, p_min, f [0 ], p_ min, p_min, p_ min,,, p_min,, p_min, ;,, : # include < stdio.h > { float f[ 10 ], p, p_min, t ; printf( \ n input data: ) ; for( p = f; p < f + 10; p + + ) scanf( % f, p ) ; / / p_min = & f[0 ] ; for( p = f + 1; p < = &f[ 9] ; p + + ) / / p_min / / p_min if ( p < p_min ) p_min = p; / / p_min if( p_min! = f) t = p_min, p_min = f, f = t; for ( p = f; p < f + 10; p + + ) / / p_min f[0] / /

printf( %10.2f, p) ; printf( \ n ) ; 8.3.2 1 C,,, 8.4 : : # include < stdio.h > { char a[20], p = a ; / / p a gets (a) ; / / while( p!= \ 0 ) / / \ 0 putchar( p + + ) ; printf( \ n ) ; 8.5 : :,, gets a, a b, a[i] b[ i], i, a b a[i] \ 0,,, b \0, a b : # include < stdio.h > { char a[20], b[ 20 ] ; int i = 0 ; gets (a) ; while( a[i]! = \0 ) { b [i] = a[i] ; i + + ; b [i] = \0 ;

puts ( b) ; : : a b, a, b, pa pb, a b a, pa pb, pa pb, a b, pa, \ 0, : # include < stdio.h > { char a[20], b[ 20 ], pa = a, pb = b; gets (a) ; while( pb + + = pa + + ) ; puts ( b) ;, :,?, b \0? 2 C,, : char p; p = abcd ; C,,, p char a[ 20 ] ; a = abcd ; a, a, a, a = abcd,, a,!, : char p ; scanf( % s, p ) ;, p, p, scanf, : char a[ 20 ], p = a ; scanf( % s, p) ; char a [20] ; scanf( % s, a) ; 8.6 :,, a;, n 0;, p, a ; gets a,, p,, n,, p,,, 0,

,, : # include < stdio.h > { char a[100 ], p = a; int n = 0 ; printf( \ n input string: ) ; gets ( p) ; while( p + + ) n + + ; printf( \ nlen = % d, n ) ; printf( \ n ) ; / / / / 8.7 :,, a, b,, pa, pb, a, b, a, b, a, b,, gets, b a, pa a, a \0, pb,, pa, pa, pb,, pb \ 0, b, a \ 0,, a \0, : # include < stdio.h > { char a[100 ], b[50], pa = a, pb = b; printf( \ n input string a : ) ; gets ( pa) ; / / a printf( \ n input string b: ) ; gets ( pb) ; / / b while ( pa!= \ 0 ) pa + + ; / / pa a \ 0 while ( pb ) pa + + = pb + + ; / / b a pa = \ 0 ; / / a puts (a) ;

8.3.3 : [ ] ; : int p[ 3] ;, 3 p, p [ 0], p [ 1 ], p[ 2 ] 8.8 3 : a 3, p( 3 ) p[0 ] p[1 ] p [2 ] a[0 ] a[1 ] a[ 2] p [0 ] a[ 0 ] a[ 1 ],, p[0 ] p [1 ] ; p[ 0] a[0 ] a[ 2],, p [0 ] p [2 ] ; p[ 1] a [ 1 ] a [2 ],, p [1 ] p [2 ], p[ 0] p[ 1] p[ 2] : # include < stdio.h > { int a[ 3], p[3 ], i, t ; for(i = 0; i < 3; i + + ) p [i] = & a[i] ; / / p[ 0] a[ 0],p[ 1] a[ 1],p [2] a[ 2] printf( \ n input data: ) ; for(i = 0; i < 3; i + + ) scanf( % d, p[i] ) ; / / if ( p[ 0] > p [1 ] ) t = p[ 0], p[0 ] = p[ 1], p[ 1] = t ; if ( p[ 0] > p [2 ] ) t = p[ 0], p[0 ] = p[ 2], p[ 2] = t ; if ( p[ 1] > p [2 ] ) t = p[ 1], p[1 ] = p[ 2], p[ 2] = t ; / / p[ 0] p[ 0] p [1] / / p[ 0] p[ 0] p [2] / / p[ 0] / / p[ 1] p[ 1] p [2] printf( \ n% d, % d, %d, a[0 ], a[1 ], a[2 ] ) ; / / printf( \ n% d, % d, %d, p[ 0], p[1 ], p[2 ] ) ; / / 8.9 :, strcmp ( 1, 2 ), 1 > 2 1 = 2 1 < 2, 0 0 0,,, : # include < stdio.h >

# include < string.h > / / { char d[ ] = { su nday, monday, tuesday, wednesday, thursday, friday, saturday ; / / C 7 char t ; int i, j, k; for (i = 0; i < 6; i + + ) { k = i; for( j = i + 1; j < 7; j + + ) if ( strcmp( d [ k], d[j] ) > 0) k = j; if ( k!= i) t = d[ k ], d[ k] = d[i], d [i] = t ; for(i = 0; i < 7; i + + ) puts ( d[i] ) ; / / / / / / 7, 6 / / d[ k] d [j], j / / i / / 7,, 7,, d [ 0 ], d [ 1],, d[6 ] 8.3.4,,, : ;, 2, n n, n - 1,,, 8.10 # include < stdio.h > { int a = 5, p = &a, q = & p; printf( %d, % d, % d, a, p, q) ; printf( \ n ) ; :

5, 5, 5 p a, q p, q, q p, q p, p a, p a, q p & a, q p a 8.3.5 1, : ( ) [ ] ; : int ( a) [ 5] ;, a, 5 a + +,, 5 a 1000, a + + 1000 + 4 5, i, ( a) [i], int a[ 5], 2, a[ 2 ] [ 4 ], 2 4, a a[ 0] a[ 1 ], a[ 0 ], 4, : a[ 0] [0 ] a[0 ] [ 1] a[0 ] [ 2 ] a[ 0 ] [ 3 ],, a[1 ], 4, : a[ 1] [0 ] a[1 ] [ 1] a[ 1] [2 ] a[ 1 ] [ 3 ], a, a[ 0] a[ 1], ( 8.2 ) 8.2, a + 1,, a a [ 0 ], &a[ 0], a a[ 0], a[0 ], : a + 1 &a[ 1] (a + 1) a[1 ] a[0 ] a[ 1], a[ 0], a[ 0] + 1, a[ 0] [1 ], (a[0 ] + 1 ) a[0 ] [ 1], : ( (a + 1) + 3) a[1 ] [ 3] a + 1 a[1 ], (a + 1 ) a [ 1 ], ( a + 1 ) + 3 a [ 1 ] [ 3 ], ( ( a + 1) + 3) a[ 1] [3 ], a?,,,, a + 1, 8.11 # include < stdio.h >

{ int a[ 3] [4 ] = {{1, 2, 3, 4, {5, 6, 7, 8, {9, 10, 11, 12; int ( p ) [ 4] ; / / int q; int i, j; printf( \ n ) ; for(i = 0; i < 3; i + + ) for( j = 0; j < 4; j + + ) printf( %4d, a[i] [ j] ) ; / / printf( \ n ) ; for( q = a ; q < = &a[ 2] [3 ] ; q + + ) printf( %4d, q) ; printf( \ n ) ; p = a; for (i = 0; i < 3; i + + ) for ( j = 0; j < 4; j + + ) printf( %4d, ( ( p + i) + j) ) ; printf( \ n ) ; / / / / for (i = 0; i < 3; i + + ) / / for ( j = 0; j < 4; j + + ) printf( %4d, ( ( a + i) + j) ) ; printf( \ n ) ;,,, a a[ 0], a [0 ] [ 0 ] ;, a, a[ 0] 8.4, 8.4.1 C,,,,,,, 8.12, # include < stdio.h > { int a = 10, b = 20;

void swap(int, int ) ; / / printf( : a = % d, b = % d\ n, a, b ) ; swap( & a, & b ) ; printf( : a = % d, b = % d\ n, a, b ) ; void swap(int p1, int p2 ) { int t ; t = p1, p1 = p2, p2 = t ; / / a b / / p1 p2,,, swap, a b swap, p1 p2 t,, a, b, 8.3, 8.4.2 8.3,, C,, 8.13,, # include < stdio.h > { char str [100 ], c; int countc(char, char ) ; / / printf( \ n input string: ) ; gets ( str) ; printf( \ n input char: ) ; c = getchar( ) ; / / printf( countc = % d, countc( str, c) ) ; / / printf( \ n ) ; int countc(char ch[ ], char x) { int s = 0; while( ch) { if( ch = = x) s + + ; / /

return s ; ch + + ;, : int countc(char ch, char x), 8.14, : find main, 10 a, find, find main # include < stdio.h > void find(int p, int Max, int Min, int Sum) { int i; Sum = Max = Min = p; for (i = 1; i < 10; i + + ) / / Sum Max Min / / { if( ( p + i) > Max) / / i Max Max = ( p + i) ; if( ( p + i) < Min) Min = ( p + i) ; Sum + = ( p + i) ; { int a[ 10 ], max, min, Summ; int i; printf( \ n input data: ) ; for(i = 0; i < 10 ; i + + ) scanf( % d, a + i) ; / / for(i = 0; i < 10 ; i + + ) / / i Max / / i Min / / i Min printf( %4d, a[i] ) ; / / 10 find(a, & max, & min, &Summ ) ; / /, printf( \ n max = % d, min = % d, Summ = % d\ n, max, min, Summ) ; 8.4.3, : ( ){

8.15, # include < stdio.h > int findmax(int p) { int i, max, m_i ; max = p [0 ], m_i = 0 ; for (i = 1; i < 10; i + + ) if( p [i] > max) max = p [i], m_i = i ; return p + m_i; { int a[ 10 ], q; int i; printf( \ n input data: ) ; for(i = 0; i < 10 ; i + + ) scanf( % d, a + i) ; for(i = 0; i < 10 ; i + + ) printf( %4d, a[i] ) ; q = findmax( a) ; / / / / / / max, m_i / / m_i / / findmax printf( \ n max = % d, q) ; / / 8.5 main main, main, main, C exe,,,, main, C main, main : main (int argc, char argv [ ] ) { : argc, argv,, argv argv[0 ], argv [ 1 ], argv[ 2 ], argc argv,,

: 1 2 n, exe,, ( exe ) 8.16,, disp.c # include < stdio.h > main (int argc, char argv[ ] ) { int i; for(i = 1; i < argc ; i + + ) printf( % s,, argv[i] ) ; printf(! \ n ) ; retur n 0;, disp.exe, : disp 2008 beijing china, :2008, beijing, china! argv[0 ], argv[ 1 ], 4, argc 4, argv 4, disp 2008 beijing china, 8.4,,, 8.4 8.17,, add.c :,, C < stdlib.h >, atoi : # include < stdio.h > # include < stdlib.h > / / main (int argc, char argv[ ] ) { int x, y, s; x = atoi(argv[ 1] ) ; y = atoi( argv[2 ] ) ; s = x + y; printf( %d + % d = % d, x, y, s ) ; / /

retur n 0; add.c, add.exe, : add 3 5, :3 + 5 = 8 main, C, main, main return exit, return, C 0 main, 8.6 8.18 n ( n ) : a b,, a,, : # include < stdio.h > # include < string.h > void mycopy(char p1, char p2, int n) ; / / { char a[80], b[ 80 ] ; int n; printf( \ n input string: ) ; gets (a) ; printf( \ n input n : ) ; scanf( % d, & n ) ; mycopy(a, b, n) ; puts ( b) ; void mycopy(char p1, char p2, int n) { int i = 0; if( n > strlen ( p1 ) ) { printf( \ n error! ) ; exit( 1) ; while(i + + < n - 1 ) p1 + + ; while( p1) p2 + + = p1 + + ; p2 = \ 0 ; / / / /,

exit,, main return exit, OS, exit ( 0 ), exit (1 ) 8.19 :, :,,, 8.5, n, n/ 2 n,,,, 8.5 p1 p2, p1 p2, p1 p2 p1, p2, p1 < p2, : # include < stdio.h > { int a[ 10 ], p1, p2, t ; printf( \ n input data: ) ; for( p1 = a ; p1 < a + 10 ; p1 + + ) scanf( % d, p1 ) ; for( p1 = a, p2 = a + 9; p1 < p2; p1 + +, p2 - - ) t = p1, p1 = p2, p2 = t ; for( p1 = a ; p1 < a + 10 ; p1 + + ) printf( %4d, p1 ) ; printf( \ n ) ; 8.20 : ; ; C n m = m! n! ( m - n )! :, main, : : # include < stdio.h >

double fac(int n) ; { int m, n; double c; printf( \ n input m, n: ) ; scanf( % d%d, & m, & n) ; if( m < n) m = m + n, n = m - n, m = m - n; c = fac( m)/ ( fac( n) fac( m - n ) ) ; printf( c = %10.0lf\ n, c) ; double fac(int n) { double f = 1.0; int i ; for (i = 1 ; i < = n; i + + ) f = i; return f; : : # include < stdio.h > void fac(int n) ; double k; { int m, n; / / k / / m < n, m n / / m! n! (m - n)! double c, m1, n1, m_n; / / m1 m!,n1 n!, m_n (m - n)! printf( \ n input m, n: ) ; scanf( % d%d, & m, & n) ; if ( m < n) m = m + n, n = m - n, m = m - n; fac( m ) ; / / m, fac m! m1 = k; / / m! k, k, fac( n ) ; / / n, fac n! n1 = k; fac( m - n ) ; / / m - n, fac (m - n )! m_n = k; c = m1/ ( n1 m_n ) ; printf( c = %10.0lf\ n, c) ;

void fac(int n) { double f = 1.0; int i; for (i = 1; i < = n; i + + ) k = f; f = i;, fac, m, fac m!, k, fac,, k,,, m1, m1 m! n! ( m - n )! : : # include < stdio.h > void fac(int n, double p) ; { int m, n; double c, m1, n1, m_n; / / m1 m!,n1 n!, m_n (m - n)! printf( \ n input m, n: ) ; scanf( % d%d, & m, & n) ; if( m < n) m = m + n, n = m - n, m = m - n; fac( m, & m1 ) ; fac( n, & n1 ) ; fac( m - n, & m_ n) ; c = m1/ ( n1 m_n ) ; / / m, fac m!, m1 / / n, fac n!, n1 / / m - n, fac ( m - n)!, m_n printf( c = %10.0lf\ n, c) ; void fac(int n, double p) { double f = 1.0; int i; for (i = 1; i < = n; i + + ) p = f; f = i; / / p,,, 8.21

) : 4 (, : # include < stdio.h > { int a[ 3] [4 ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12; / / int p1 [3 ] ; int ( p2) [4 ] ; int p3; int i, j; / 1 / for(i = 0; i < 3; i + + ) { for ( j = 0; j < 4; j + + ) printf( %4d, ( ( a + i) + j) ) ; printf( \ n ) ; / / / / / / / / a printf( - - - - - - - - - - - - - - - - - - - - - - - - - - \ n ) ; / 2 / for(i = 0; i < 3; i + + ) p1[i] = a[i] ; for (i = 0; i < 3; i + + ) { for( j = 0; j < 4; j + + ) printf( %4d, ( ( p1 + i) + j) ) ; printf( \ n ) ; / / / / a printf( - - - - - - - - - - - - - - - - - - - - - - - - - - - \ n ) ; / 3 / p2 = a ; for(i = 0; i < 3; i + + ) { for( j = 0; j < 4; j + + ) printf( %4d, ( ( p2 + i) + j) ) ; printf( \ n ) ; / / p2 / / printf( - - - - - - - - - - - - - - - - - - - - - - - - - - - \ n ) ; / 4 / p3 = a ; for(i = 0; i < 3; i + + ) { for( j = 0; j < 4; j + + ) printf( %4d, ( p3 + i 4 + j) ) ; / / / /

printf( \ n ) ; 4 : 1:, (a + i) &a[i] (a + i) a[i] (a + i) + j a[i] + j &a[i] [j] ( ( a + i) + j) (a[i] + j) a[i] [j] 2:, p1 [ 0 ] a [ 0 ] [ 0 ], p1[ 1] a[ 1] [0 ], p1[ 2] a[ 2] [0 ] 1 3: p2, 4 1 4: 4, printf ( ( p3 + i) + j)?,,, 4 ( ), p3 a, a[0 ] [ 0], p3 + 1 a[ 0] [1 ], ( p3 + 1) a[ 0] [1 ] 2, ( ( p3 + 1 ) + 1 ) = ( a[0 ] [ 1] + 1) = (2 + 1) = (3 ) (3 ) 3,,,,,,, C C, : ;,, ;,,,,,,, 1. int a = 3, b, p = & a;,, b 3 A. b = &a ; B. b = p; C. b = a ; D. b = a; 8

2., A. - B. = C. + D. = = 3. A. int p = &i, i; B. int p, i; C. int i, p = &i; D. int i, p; 4. int p[3 ], a[3 ] ;, A. p = a; B. p = a[ 0] ; C. p = &a[ 0] ; D. p[ 0] = a[0 ] ; 5. int a [ 10 ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, p = a;, 3 A. p + = 2, ( p + + ) C. p + = 3, p + + B. p + = 2, + + p D. p + = 2, + + p; 6. char a[10] = { abcd, p = a ;, ( p + 4) A. abcd B. d C. \ 0 D. 7. int a[3 ] [ 4] ;, a[i] [j] ( 0 < = i < 3, 0 < = j < 4 ) A. ( a + 4 i + j) B. ( (a + i) + j) C. ( a + i) [j] D. a[i] + j 8. int ( ptr ) [ 10 ] ;, ptr A. 10 B. 10 C. 10 D. 10 9. p1 p2,, k, A. k = p1 + p2 C. p2 = k B. k = p1 ( p2) D. p1 = p2 10. int w[3 ] [ 4] = {{0, 1, {2, 4, {0, 1, {0, 1, ( p ) [4 ] = w ;, 4 A. w[1 ] + 1 B. p + +, ( p + 1) C. w[2 ] [ 2] D. p [1 ] [ 1] 11., int a[12] = {0, p [3 ], pp, i; for(i = 0; i < 3; i + + ) p[i] = &a[i 4] ; pp = p; A. pp[ 0] [1 ] B. a[ 10 ] C. p[ 3] [1 ] D. ( ( p + 2) + 2) 12. main A. main(int argc, char argv[ ] ) B. main (ac, av) int ac; char av; C. main (c, v) int c ; char v[ ] ; D. main (int argc, char argv ) ; 13., int pp, p, a = 10, b = 20; pp = & p; p = &a ; p = & b ; printf( % d, % d\ n, p, pp ) ;

A. 10, 20 B. 10, 10 C. 20, 10 D. 20, 20 14. int w [ 2 ] [ 3 ], ( pw ) [ 3 ] ; pw = w ;, w A. (w[ 0] + 2) B. pw[2 ] C. pw[ 0] [0 ] D. ( pw[ 1] + 2) 15. x 25, printf ( % d \ n, + + x ) ; A. 23 B. 24 C. 25 D. 26 16. : int i, j = 7, p = & i; i = j ; A. i = p; B. p = &j ; C. i = &j; D. i = p; 17. int a[ ] = {1, 2, 3, 4, 5, p = a, i;, 0 < = i < 5, A. (a + i) B. a[ p - a] C. p + i D. ( &a[i] ) 18. int a[ 5], p = a ;, A. a[ p ] B. p[ a] C. ( p + 2) D. p + 2 19. int a[ ] = {1, 2, 3, 4, 5, p = a, i;, 0 < = i < 5, A. & (a + i) B. a + + C. & p D. & p [i] 20., A. char s[ 5] = { ABCDE ; B. char s [5 ] = { A, B, C D, E ; C. char s; s = ABCDE ; D. char s; scanf( % s, & s ) ; 1. d, d p 2.&,,,, &, 3. int sz[4 ], p = sz ;,, 4. int p; int p[ n] ; int ( p) [ n] ; int p( ) ; int p; 5. char a = ABCD ;, printf ( % s \ n, a ) ;, printf ( % c \ n, a) ; 6. int a[3 ] [ 2] = {10, 20,30, 40, 50, 60, ( p ) [ 2] ; p = a;, p a[2 ], [1 ] 7.C,, 8. C, 9. C,

10., & 11.,, 12. int a[ 10 ], p = a; a[ 3] p[ ] ( p ) 13. ( ),, # include stdio.h # include ctype.h { char str [81], sptr; int i; for(i = 0; i < 80 ; i + + ) { str [i] = getchar ( ) ; if( str [i] = = \ n ) break; str [i] = ; sptr = str; while( sptr ) putchar ( sptr ) ; 14. 10, # include < stdio.h > # include < string.h > { char str [10] [80], sp; int i; for(i = 0; i < 10 ; i + + ) gets( str[ i] ) ; sp = str [0 ] ; for(i = 0; i < 10 ; i + + ) if( strlen( sp) < strlen ( str [i] ) ) ; printf( : % s \ n, ) ; printf( : % d\ n, ) ; 15. : int a[ 4] = {2,4,6,8; int p[ 4] = {a, a + 1, a + 2, a + 3; int q = p; ( p + 2 ), ( p + 1) 16. int c[ ] = {1,7,12 ; int k; k = c;

printf( next k is %d, + + k) ; ( ) 1. 3, 2. n 3., 4. 3, 5. 2 6. 10,, 1 7. 10, 4, 8., 3 3,

9 C :, :, 9.1,,,,,,,?,??,,, ( ),,??,,?, C,, C, C,

,,,,,, ( ) ;,,,,,,,,,,,, Bohn Jacobini 1966,,? :, ; ; 9.1.1,,,,,,,,,,,,,,,,,,,,,,,,,, 9.1,, : ( 50 ) ( 10 ),,, :,, :,,,,,, ; :,,, 9.1

9 1 9.1.2,, ( 9.1 ) :,, : (1 ),,, (2 ),, (3 ),,, (4 ) C,, C,, 50,,,,,,,,,,,, 9.1 :,, : main; : in_data ; : cal_da ta; : ave_ stu ;

: ave_cour ; : high_low ; : out_ data main in_ data, main cal_dat a, out_ data cal_data, ave_stu, ave_cour, high_low 9.1.3 1,,, :, (,, ),,, ( ) N - S,,??,,,,, : (1 ) ; (2 ) ; (3 ) ; (4 ) ( 2) (3 ) ( 9 2 ) 9.2 ( 2) (4) 9.3 (3 ) 9.2 (4 ), 3,, 9.4,

,,,,, 9.4,,, 9.3 (3) (4) 9.4 9.2 9.1 main in_data cal_ data ave_stu ave_cour high_low out_data : : M = 50 N = 10 score[ M] [ N] a_stu[ M] a_cor[ N] n_s n_c max_s[ N] min_s [ N] s_max[ N] s_min [ N] 9.5 9.6 9.7 9.8 9.9 9.10 9.11

9 5 main 9 6 in_data 9 7 cal_data 9 8 ave_stu

9 9 ave_cour 9 10 high_low 2 9 11 out_data,,

,,, C, C, 9.3, : # define M 50; # define N 10 ; C : float a_stu[ M ], a_cor [ N] ; int score[ M ] [ N], n_ s, n_c, max_s [ N], min_s [ N], s_max[ N], s_min[ N] ; 9.5 : Main ( ) / / { printf( \ n input n_s, n_c : ) ; scanf( %d, % d, & n - s, & n - c) ; in_data( ) ; cal_da ta( ) ; out_data( ) ; 9.6 : void in_data( ) { int i = 0, j; while(i < n_ s) ; { j = 0; while( j < n_c) / / { printf( \ n input % d % d, i + 1, j + 1) ; i = i + 1; scanf( % d, & score[i] [j] ) ; j = j + 1 ; 9.7 : void cal_data( ) { ave_stu( ) ; ave_cour( ) ; high_low( ) ; 9.8 : void ave_stu( ) / / / /

{ int i = 0, j; while (i < n_ s) { j = 0; a_stu[i] = 0; while(j < n_c) { a_stu[i] = + score[i] [j] ; j = j + 1 ; a_stu[i] = a_stu[i]/ j; i = i + 1; 9.9 : void ave_cour( ) / / { int i = 0, j; while(i < n_c) j = 0; a_cor[i] = 0; while(j < n_ s) { a_cor[i] + = score[i] [j] ; j = j + 1 ; a_cor[i] = a_cor[i]/ j; i = i + 1; 9.10 : void high_low( ) / / { int i = 0, j; while(i < n_c) { max_s [i] = score[i] [0 ] ; min_s [i] = score[i] [0 ] ; j = 0; while(j < n_ s) { if( score[i] [j] > max_s[ i] ) { max_s [i] = score[i] [j] ; s_ max [i] = j + 1; if( score[i] [j] < min_s [i] ) { min_s [i] = score[i] [j] ;

j = j + 1 ; i = i + 1; s_ min[i] = j + 1; 9.11 : void out_data( ) { int i = 0; while(i < n_ s) / / { printf( \ n % d, _ % f\ n, i + 1, a_stu[i] ) ; i = i + 1; i = 0; while(i < n_ s) { print( \ n % d _% f, % d, % d, _% d, % d \ n, i + 1, a_cor [i], max_s [i], s_max[i], min_s [i], s_min[i] ) ; i = i + 1; 9.2 9.2.1,,,,,,,,,,,,,,, :,,, ; ;,,,,

, :,,,,,,,, 1,, : (1 ) ( ),,,,, :,,,,, :,, ;,, ; ; :,, :, C,, C,,,, main < >, ( ) < >,, C, Main main, C,,, for,,, 3,,,, for,, if, if,,,,, 9.3,, : 9.5 Main main M, N, main & n - s, & n - c & n_s, & n_c,,

c n_c n_c, n - c n - c, n - s n_ s, n - ave_stu,, a_stu [i] = + score [i] [ j] a_ stu [i] + = score[i] [j] in_data cal_data out_dat a,, ave_ stu ave_cour high_low,,,, (2 ),,,,,, 2,,,,,,, 9.4 9.3, 9.3 : # define M 50 / / # define N 10 float a_stu[ M ], a_cor [ N] ; / / int n_s, n_c, s_max[ N], s_ min[ N], score[ M] [ N], max_s[ N], min_ s[ N] ; void in_data( ) ; void cal_data( ) ; void ave_stu( ) ; void ave_cour( ) ; void high_low( ) ; void out_data( ) ; # include < stdio.h > { printf( \ n input n_s, n_c : ) ; scanf( % d, % d, & n_s, & n_c) ; in_data( ) ; cal_data( ) ; out_data( ) ; void in_data( ) { int i = 0, j; / / / /

while(i < n_ s) ; { j = 0; void cal_data( ) { ave_stu( ) ; while(j < n_c) { printf( \ n input % d % d, i + 1, j + 1) ; i = i + 1; ave_cour( ) ; high_low( ) ; void ave_stu( ) { int i = 0, j; while (i < n_ s) scanf( % d, & score[i] [j] ) ; j = j + 1 ; { j = 0; a_stu[i] = 0 ; while(j < n_c) / / { a_stu[i] + = score[i] [j] ; j = j + 1 ; a_stu[i] = a_stu[i]/ j; i = i + 1; void ave_cour( ) { int i = 0, j; while(i < n_c) j = 0; a_cor[i] = 0; while(j < n_ s) { a_cor[i] + = score[i] [j] ; j = j + 1 ; a_cor[i] = a_cor[i]/ j; i = i + 1; / / / /

void high_low( ) / / { int i = 0, j; while(i < n_c) { max_s [i] = score[i] [0 ] ; min_s [i] = score[i] [0 ] ; j = 0; while(j < n_ s) { if( score[i] [j] > max_s[ i] ) i = i + 1; void out_data( ) { int i = 0; while(i < n_ s) i = 0; { max_s [i] = score[i] [j] ; s_ max [i] = j + 1; if( score[i] [j] < min_ s[i] ) { min_s [i] = score[i] [j] ; j = j + 1 ; s_ min[i] = j + 1; / / { printf( \ n % d, _ % f\ n, i + 1, a_stu[i] ) ; i = i + 1; while(i < n_ s) { print( \ n % d _ % f, % d, %d, _% d, % d \ n, i + 1, a_cor [i], max_s [i], s_max[i], min_s[ i], s_min[i] ) ; i = i + 1; 9.5 9.4 : VC + + 6.0, 9.4 score.c D ;, score.c,,, score.c,,,,

: VC + + 6.0, 9.4 VC + +, score.c D,, ( 9.12 ), ( ),,,,,,, ( 9.13),,,,,, ( score.c ) : Compiling score.c score.obj - 0 error ( s ), 0 warning( s ) 9.12 VC + + 6.0

9.13 VC + + 6 0, score.obj, score.c build compile score.c( ctrl + F7 ), 9.14,,,, 9.12 score.c, 9.14,, 9.12 9.14 9.12 ( 4 ),, 9.13,,,, 5,, 6 7,, (,, 8-1 = 7, 4 ), out_data printf,,, 2, 2, ( 3 ),

,,,, printf print, 9.15,, score.obj 9.15,,,,, include,,,, score.obj,, score.exe build build score.exe ( ctrl + F7 ), 9.16,, score.exe 9.16 score.exe,,,,,

,,,,,,,, if( x = = y) if( x = y),,,! : x y, ; : y ( x y ),,,, build Execute score.exe ( ctrl + F5 ), 9.17, 2,3, n_s( ) n_c( ) 2 3, 9.18,,,,,, ctrl + c 9 17 9 18,,,,, in_dat a, in_da ta int i = 0, j; printf( \ n i = % d, i) ;,, 9.19, printf( \ n i = % d, i) ; while( i < n_s ) ;,,, 9.18,, while(i < n_ s) ;,, while, while ( i < n_ s) ;, i,, while,,, 1 1, 9.20 9 19 9 20

( ),,! 9.21,, in_data printf( \ n \ n ) ;,,, 9.22,, 9 21 9 22, in_data, F5,, 9.23 ( 9.22 ), Debug ( view/ debug window/ w atch/ Debug ) Watch 9.23, N ame ( score[ 0 ] [0 ] score [ 0 ] [ 1 ] score [0 ] [ 2 ] score [ 1 ] [ 0 ] ), V alue, 9.22 9.23,, in_ data, Debug ave_stu, :,,, 9.24, 9 23

9 24, ave_cour while, Debug, while, F5 9.25, score.obj score.exe,,,,,,,, 9.22,,, j = 0;, 9.26,,, 9.27, : 9 25 score.exe score.obj void ave_cour ( ) { int i = 0, j; while(i < n_c) { j = 0 ; a_cor [i] = 0; while(j < n_s ) { a_cor[i] + = score[i] [j] ; j = j + 1 ; a_cor [i] = a_cor[ i]/ j; i = i + 1 ; 9 26 ave_cour

9 27 ave_cour, ; ; ;,, ave_cour high_low, out_data ave_cour,,, ( : n_ s, n_c ),,,,,,, : a_ cor [i] + = score[i] [j] ;, a_cor [i] + = score [ j] [ i] ( :, ),,,,, high_ low, high_low, : void high_low( ) { int i = 0, j; while(i < n_c) { max_s [i] = score[0 ] [i] ; / / : max_ s[i] = score[i] [0 ] ; min_s [i] = score[0 ] [i] ; / / : [ min_ s[i] = score[i] [0 ] ; j = 0; while(j < n_ s) { if( score[j] [i] > max_s[ i] ) / / : if( score[i] [j] > max_ s[i] ) { max_s [i] = score[j] [i] ; / / : max_ s[i] = score[i] [j] ; s_ max [i] = j + 1;

if( score[j] [i] < min_s [i] ) / / : if( score[i] [j] < min_s [i] ) { min_s [i] = score[j] [i] ; / / : min_s [i] = score[ i] [j] ; i = i + 1; j = j + 1 ; s_ min[i] = j + 1;,,, 1, 4, out_data, while (i < n_ s ), n_ s,, n_c, (i < n_s ) (i < n_c) 1 ( : 9.11,,,,!),,,, 1,, 0,,,, 9 28, 9 28,,,,,,, :,

( ),!,,,, 9.2.2 C,,,,,,,,,, 9.6, :,, # include < stdio.h > # define M 1001 int score[ M ] ; void in_score(int n) { int i; for (i = 1; i < = n; i + + ) { printf( \ ninput % d :, i) ; float aver(int n) scanf( % d, & score[i] ) ; { int i; float ave = 0; for(i = 1; i < = n ; i + + ) ave + = score[ i] ; ave/ = (i - 1) ; return ave; void out_test(int n) { int i; printf( \ n = % f, aver( n ) ) ; for (i = 1; i < = n; i + + ) { if( score[i] > = aver ( n) ) printf( \ n % d - -!, i) ; if ( score[i] < aver ( n) ) printf( \ n % d - -,!, i) ;

printf( \ n \ n ) ; { int num; printf( \ ninput ( < = 1000 ) : ) ; scanf( % d, & num ) ; in_score( num ) ; out_test( num ) ; :, : out_test for, if, if,,, if,,, if if - else out_test for,,, aver,,, for, aver,,,, aver ave + = score[i] ;, ave, score[ i],,,, ; ave1, ave2,,,,, ave1 ave2, : # include < stdio.h > # define M 1001 int score[ M ] ; void in_score(int n) { int i; for (i = 1; i < = n; i + + ) { printf( \ ninput % d :, i) ; float aver(int n) scanf( % d, & score[i] ) ; { int i, ave1 = 0; float ave2;

for (i = 1; i < = n ; i + + ) ave1 + = score[i] ; ave2 = 1.0 ave1/ (i - 1 ) ; return ave2; void out_test(int n) { int i; float k; k = aver( n ) ; printf( \ n = % f, k) ; for (i = 1; i < = n; i + + ) { if ( score[i] > = k ) else printf( \ n \ n, i) ; { int num; printf( \ n % d - -!, i) ; printf( \ n % d,!, i) ; printf( \ ninput ( < = 1000 ) : ) ; scanf( % d, & num ) ; in_score( num ) ; out_test( num ) ;,,,,,,,,,,, 9.3,????,,,,,,, 9.7

:? 1 1,, 1 n ( 1, n), : 1 n, n ;, 1;, 2, : int isprine(int n ) { int count = 0, i; for (i = 1; i < = n; i + + ) if( n %i = = 0) count + + ; return( count = = 2 ) ;, n( n > = 3 ), 2 n - 1 ( 2, n - 1), n,, : int isprine(int n ) { int flag = 1, i ; for (i = 2; i < = n - 1 ; i + + ) if( n %i = = 0) {flag = 0 ; break; return ( flag) ;, n = 1, ( 1, 1 ), : int isprine(int n ) { int flag = 1, i ; if( n = = 1) flag = 0; for (i = 2; i < = n - 1 ; i + + ) if( n %i = = 0) {flag = 0 ; break; return ( flag) ; : n 1 n, n n n, n 2, n, 1 n n 2,, 0 ;, : # include < math.h > int isprine(int n ) { int i, k; if( n %2 = = 0 ) return 0 ; k = sqrt ( n) ;

for (i = 3; i < = k; i + = 2) if( n %i = = 0) return 0; return 1; : n 1 2, : 1,2, : 1, 2,,, # include < math.h > int isprine(int n ) { int i, k; if( n = = 1) retur n 0; if( n = = 2) retur n 1; if( n %2 = = 0 ) return 0 ; k = sqrt ( n) ; for (i = 3; i < = k; i + = 2) if( n %i = = 0) return 0; return 1;,,,,,,, n 49, 7 n 49, sqrt( 49 ) 7,, 49 7,, sqrt ( 49 ) 6.999999999999, 7.000000000001 sqrt ( 49 ) 6.999999999999, 6.999999999999 7.0,, i < = k, i 7 k 6.999999999999, 7 < 6.999999999999,, 49 7, sqrt (49 ) 7.000000000001,,, k 1 + sqrt( n),,, : # include < math.h > int isprine(int n ) { int i, k; if( n = = 2) retur n 1; if( ( n = = 1 ) ( n %2 = = 0 ) ) return 0; k = sqrt ( n) + 1; for (i = 3; i < = k; i + = 2) if( n %i = = 0) return 0;

return 1; :?,,,,,,,,, 9.4,,,, ( ), C,, C C, C main,, C main,! 1 : # include < > # include : # include, # include # include,, # include,, C, ; 9.6, t est1_ i.c, : / / test1_i.c { int num; printf( \ ninput ( < = 1000 ) : ) ; scanf( % d, & num ) ; in_score( num ) ; out_test( num ) ; test2_i.c, : / / test2_i.c # define M 1001 int score[ M ] ; void in_score(int n) { int i;

for (i = 1; i < = n; i + + ) { printf( \ ninput % d :, i) ; float aver(int n) { int i, ave1 = 0; float ave2; scanf( % d, & score[i] ) ; for(i = 1; i < = n ; i + + ) ave1 + = score[i] ; ave2 = 1.0 ave1/ (i - 1 ) ; return ave2; void out_test(int n) { int i; float k; k = aver( n ) ; printf( \ n = % f, k) ; for (i = 1; i < = n; i + + ) { if ( score[i] > = k ) else printf( \ n \ n ) ; printf( \ n % d - -!, i) ; printf( \ n % d - -,!, i) ;, VC + +, test1_i.c, main # include < d: \ test2_i.c > ( t est2_i.c D ), test1_i.c 2 test1_i.c test2_i.c, VC + + 6.0,, : (1 ) VC + +, test1_i.c, ( build/ compile test1_i.c ) (2 ) test2_i.c ( project/ add to project/ files /, test2_i.c, OK ) (3 ), C, C test1_i.c,,,,,,

,, 3,,,, C,,,,,,, extern,,,,,,,,,,,,,,,,,,,, 9 1 9.5, 2 3 9.7, # include < math.h >,,?

10 :,, :,, 10.1 10.1.1,,,,,, C? 10.1 c001 T om 1985 M 88 90 88 c002 Jack 1983 M 89 58 80 c003 Rose 1986 F 77 83 74 c004 David 1985 M 72 63 77 c005 Mike 1986 M 54 62 58 c006 John 1984 F 70 65 85

10 1,,,,,,,,,,, ( ), 1 C,,,,,,, : struct { 1; ; 2; n ;, struct,, C ( ),,,,,, 10.1, : struct cj_ list { char num[ 10 ] ; / / ; char name[10] ; int year ; char sex ; float math, english, computer ; / / / / / / / /, cj_list, num name year sex math englis h computer,,,,, 10.1, 3, :

struct birthday { int year; ; int month; int day; struct cj_ list.new 2 { char num[ 10 ] ; ; char name[10] ; struct birthday date ; char sex; float math, english, computer ;,,,, 3 (1 ) : struct { 1; ; 2; n; struct ; struct cj_list stu1, stu2, stu3; struct cj_list, stu1 stu2 stu3, (2 ) : struct { 1; 2; n; ; : struct cj_ list { char num[ 10 ] ;

char name[10] ; int year; char sex; float math, english, computer ; stu1, stu2, stu3; (3 ) : struct { 1; 2; n; ;,,,, : struct { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; stu1, stu2, stu3;,,,,, 3,,, stu1 10.1, 10.1 c001 T om 1985 M 88 90 88 10.1 stu1, stu1, sizeof ( ), printf ( % d, sizeof ( stu1 ) ) ; printf ( % d, sizeof ( struct cj_ list) ) ; stul

10.1.2 1,,,,,, : struct { 1; 2; n; = { ; struct = { ; : struct cj_list stu1 = { c001, Tom,1985, M, 88, 90, 88;,, : struct birthday { int year; int month; int day; ; struct cj_ list { char num[ 10 ] ; char name[10] ; struct birthday date ; char sex; float math, english, computer ; stu2 = { c002, Jack, {1983, 5, 23, M, 89,58, 80;, =,, : struct cj_ list stu1 = { c001, Tom, 1985, M, 88, 90, 88, stu2; stu2 = stu1;,,,, 2,,,., :

.., 1, : ( ). - >, ;. ;,,.,,., (. ), ; - >, - >, - > : struct cj_list stu1, stu2, p1; p1 = & stu1; strcpy ( stu1.name, Tom ) ; / stu1 name / ( p1 ).sex = M ; / stu1 sex / p1 - > year = 1985; / stu1 year /, stu, ps, : stu.date.year = 1983; ps - > date.year = 1983; ( ps ).date.year = 1983; 10.1 10.1,,,, ( ) :, scanf, printf : # include < stdio.h > { st ruct cj_list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer, total ; stu1; printf( \ ninput name, n um, year, sex, ma th, english, computer\ n ) ; scanf( % s% s %d% c % f % f % f, stu1.name, stu1.num, & stu1.year, & stu1.sex, & stu1.math, & stu1.english, & stu1.computer) ; stu1.total = stu1.math + stu1.english + stu1.computer; printf( : % s, : % s, : % d, : % c, : % f, : % f,

: % f, : \ n% f, stu1.name, stu1.num, stu1.year, stu1.sex, stu1.math, stu1.english, stu1.computer, stu1.total) ; 10.1.3, 10.1 10.1, ( ),,6 6,,,, 1, 10.1, : struct cj_ list : { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; stu[ 6] ; struct cj_ list { char num[ 10 ] ; ; char name[10] ; int year; char sex; float math, english, computer ; struct cj_list stu [6 ] ;, stu 6, stu [0 ] stu[5 ], 10.1, {, : struct cj_ list stu [ 6 ] = {{ c001, Tom, 1985, M, 88, 90, 88, { c002, Jack, 1983, M, 89,58,80, { c003, Rose,1986, F,77, 83, 74; stu [ 0 ] stu [ 1 ] stu [2 ], : 2.

[ ]. : stu[ 0].sex = M ; strcpy ( stu[0 ].name, Tom ) ; stu 0 stu[ 0] sex name, : stu [0 ].sex stu.sex, stu, : struct cj_ list stu [ 6 ], ps ; ps = & stu[ 0] ; ps - > sex = M ;,, : stu [ 1 ] = stu [ 0 ] ;, stu [0 ] stu[ 1] 10.2 10.1,, :, stu [6 ],, Max Min : # include < stdio.h > { st ruct cj_list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; stu[ 6] ; int i, Max, Min; printf( 1 ( name, num, year, sex, ma th, english, computer) : \ n ) ; scanf( % s % s% d% c% f% f% f, stu[ 0].name, stu[ 0].num, & stu [0 ].year, & stu [0 ].sex, & stu[ 0].ma th, & stu[ 0].englis h, & stu [0 ].computer ) ; Max = 0, Min = 0; for (i = 1 ; i < 6 ; i + + ) { printf( % d : \ n, i + 1 ) ; scanf( % s % s% d% c% f% f% f, stu[i].name, stu [i].num, & stu [i].year, & stu [ i ]. sex, & stu [ i ]. math, & stu [ i ]. english, & stu [ i ]. computer) ; if( stu [i].comput er > stu[ Max].computer) Max = i; if( stu [i].comput er < stu[ Min].comput er) Min = i; printf( : % s, %10.2f\ n, stu[ Max].name, stu[ Max].computer) ; printf( : % s, %10.2f\ n, stu[min].name, stu[min].computer) ;

10.1.4 1,,, : : struct ;,,, : struct cj_ list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; stu1, ps; ps = & stu1 ; 2,, 10.3 10.1 :, 3, : # include < stdio.h > { st ruct cj_list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; stu[ 6], ps; int i = 1; float m_ sum = 0.0, e_s um = 0.0, c_ sum = 0.0; printf( name, num, year, sex, math, englis h, computer: \ n ) ; for ( ps = stu; ps < stu + 6; ps + + )

{ printf( % d \ n, i + + ) ; scanf( % s%s%d%c% f% f % f, ps - > name, ps - > num, &ps - > year, &ps - > sex, & ps - > math, &ps - > english, &ps - > computer) ; m_ sum + = ps - > math; e_sum + = p s - > english; c_sum + = ps - > computer; printf( %10.2f, %10.2f, % 10.2f\ n, m_ sum/ 6.0, e_ sum/ 6.0, c_s um/ 6.0 ) ;, ps = stu;, : ps = & stu[ 0] ;, ps + +, - > - > + + - -, : n = + + ps - > year; p s year 1 n, n = + + ( ps - > year ) ;, - > + + - - 10.4 10.1, :, : # include < stdio.h > # define N 6 struct cj_ list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; ps; struct cj_list stu [ N] ; void data_input ( str uct cj_list stu[ ] ) ; int stat ( struct cj_list p) ; { int k, count = 0; ps = stu; data_input( stu) ; for ( ps = stu; ps < stu + N; ps + + ) { k = stat( ps) ; / /, / /, / / k,0,1 / /,

if( k = = 0 ) count + + ; printf( \ n ) ; printf( : %d \ n, count) ; void data_input ( str uct cj_list stu[ ] ) { int i; printf( name, num, year, sex, ma th, english, computer: \ n ) ; for (i = 0; i < N; i + + ) { printf( % d \ n, i + 1) ; scanf( % s% s% d% c% f % f% f, stu[i].name, stu[i].num, & stu [i].year, & stu[i].sex, & stu[ i].math, & stu[i].englis h, & stu [i].comput er) ; int stat ( struct cj_list p) { int flag = 1; if( p - > math < 60) if( p - > englis h < 60) {flag = 0; printf( % s :, p - > name) ; {if( flag = = 0) printf(, ) ; else {flag = 0 ; printf( % s :, p - > name) ; if( p - > computer < 60 ) {if( flag = = 0) printf(, ) ; printf( \ n ) ; return flag; else { flag = 0; printf( % s :, p - > name) ;,,, : struct cj_list compute( struct cj_list ave) ; ave, 10.2 10.2.1 ( ),,,

1,, : union { 1; 2; n; ;,,,, : union cj { float scor e; char rank; ; struct course { int id; int grade; / / char type ; char t eacher[ 10 ] ; u nion cj course_cj; ;,,, C, : struct course { int id; int grade; char type ; char t eacher[ 10 ] ; u nion { float score ; char rank; course_cj; ; 2,

10 2 course_cj 10 2,,, 10.2 course_cj : printf( % d, sizeof( union cj) ) ; printf( % d, sizeof(course_cj) ) ;,,,, 10.2.2 1,., union cj course_ cj, p; p = &course_ cj;, course_ cj. score p - > score ( p).score,,,, st.rank = A ; st.score = 80; printf( % c, st.rank) ;,, 2,,,,,,,,,, 10.5 ( ), ( A B C D),, :,,,,,, :

# include stdio.h # include string.h # define N 10 struct course { int id, grade; char type ; char t eacher[ 10 ] ; u nion cour[ N] ; { int i; { int score; char rank; course_cj; / / E P printf( \ ninput,, ( E or P ),! \ n ) ; for(i = 0; i < N ; i + + ) { printf( %d \ n, i + 1 ) ; scanf( % d, % d, % c, % s, & cour [i].id, & cour [ i].grade, & cour[ i].type, getchar( ) ; cour[ i].teacher ) ; if(cour[i].type = = E ) scanf( % c, &cour[i].cour se_cj.rank) ; else if(cour[ i].type = = P ) scanf( % d, &cour[i].course_cj.score) ; else printf( input error! ) ; printf( the result : \ n ) ; for (i = 0; i < N; i + + ) { if(cour[i].type = = E ) printf( % d, %d, % c, % s, % c\ n, cour [i].id, cour[i].grade, cour[i].type, cour [i].teacher, cour [i].course_cj.rank ) ; else printf( % d, % d, %c, % s, %d\ n, cour [i].id, cour[i].grade, cour[i].type, cour [i].teacher, cour [i].course_cj.score) ; : scanf, rank, getchar ( ) ;, rank

10.3, 7, 12 C,,, 1 : enum { 1, 2,, n; : enum week{sun, Mon, T ue, Wed, Thu, Fri, Sa t; week,,, 2 enum, : (1 ) : enum { 1, 2,, n; enum ; (2 ) : enum { 1, 2,, n ; (3 ), : enum{ 1, 2,, n ; 3 : (1 ),,, (2 ), 0 : 0, 1, 2 : enum week{sun, Mon, Tue, Wed, T hu, F ri, Satweek_day; 0 1 2 3 4 5 6 (3 ) : enum week {Sun = 7, Mon = 1, Tue, Wed, T hu, Fri, Satweek_day;, Tue = 2, Wed = 3 (4 ), : a = Sun; b = Mon; ; : a = 0; b = 1;,, : a = (enum weekday)2 ; 2 a, : a = T ue ;,, (5 ), : if(week_day = = Sun)

10.6 A B :,, :,,, : enum guess{ s1, s2, s3a, b; : s1 s2 s3, a, b A B : # include stdio.h { enum guess{s1, s2, s3a, b ; for( a = s1; a < = s3; a + + ) {for ( b = s1; b < = s3; b + + ) {switch (a) { case 0: printf( A: - ) ; break ; switch ( b) case 1: printf( A: - ) ; break ; case 2: printf( A: - ) ; break ; default : break; { case 0: printf( B: ) ; printf( \ n ) ; { if( a = = b) printf( : ) ; else if( a - b = = 1 a - b = = - 2) printf( : A : Win ) ; else printf( : B: Win ) ; break; case 1: printf( B: ) ; { if( a = = b) printf( : ) ; else if( a - b = = 1 a - b = = - 2) printf( : A : Win ) ; else printf( : B: Win ) ; break; case 2: printf( B: ) ; { if( a = = b) printf( : ) ; else if( a - b = = 1 a - b = = - 2) printf( : A : Win ) ; else printf( : B: Win ) ; break; default : break;

10.4, C,,,,,,, C 1,, ;,,,,,,,,,,,?,,, C 4 : calloc malloc free realloc stdlib.h malloc.h, malloc free 2 (1 ) malloc malloc : void malloc( size) ; : size, size, NULL,,,, : struct cj_list p; p = ( struct cj_list ) malloc( n sizeof( struct cj_list) ) ; n, p (2 ) free free : void free( void p) ; : p,, p,, malloc calloc

p N ULL, free,, free 10.7 10.3 # include < stdio.h > # include < stdlib.h > { st ruct cj_list { char num[ 10 ] ; char name[10] ; int year; char sex; float math, english, computer ; ps, p; int i = 1, k ; float m_ sum = 0.0, e_s um = 0.0, c_ sum = 0.0; printf( please input the number s of struct cj_list: \ n ) ; scanf( % d, & k) ; p = ( struct cj_list ) malloc( k sizeof( struct cj_list) ) ; printf( name, num, year, sex, math, englis h, computer: \ n ) ; for ( ps = p; ps < p + k; ps + + ) { printf( % d \ n, i + + ) ; scanf( % s%s%d%c% f%f% f,ps - > name,ps - > num, &ps - > year, &ps - > sex, &ps - > math, &ps - > english, &ps - > computer) ; m_sum + = ps - > math,e_sum + = ps - > english, c_sum+ = ps - > computer; printf( %10.2f\ n % 10.2f\ n %10.2f\ n, m_ sum/ k, e_s um/ k, c_ sum/ k) ; : [ 10 7] [ 10 3 ],?? 10.5 10.1,,,,,,,,,,

10.5.1 : (1 ) :,,,,, (2 ) :, (3 ) :, ( N ULL ),, ;,, (4 ) :,,,,,,, :,,,, 10 3 10.3,, : struct node { ; struct node ; ;, (,,, ) : struct worker { int id; int age; char sex; float salary; char grade[ 10 ] ; struct worker next ;

; 10.5.2 : ( ), 1 :,,,, : ; ; ; 10.8, 10.5.1 :, - 1 :, head, p s tail, ps, tail p s, tail, ps, next N ULL, : struct worker creat_list( ) { struct worker head, p s, tail; int i; / / p s = ( struct worker ) malloc( sizeof( struct worker ) ) ; head = ps; tail = ps ; printf( : \ n ) ; scanf( % d, &i) ; while(i! = - 1) { p s - > id = i; printf( \ n : \ n ) ; scanf( % d, % c, % f, % s, & ps - > age, & ps - > sex, & ps - > salary, ps - > grade) ; p s = ( struct worker ) malloc( sizeof( struct worker ) ) ; printf( \ n : \ n ) ; scanf( % d, &i) ; if(i! = - 1 ) { tail - > next = ps ; / / tail = ps ; / / tail,

else tail - > next = N ULL; free( p s) ; retur n head; :? 2,,, 10.9, 10.8 : void printlist( struct worker p) { struct worker ps; ps = p; printf( % d, % d, % c, % f, % s\ n, ps - > id, ps - > age, ps - > sex, ps - > salary, p s - > grade) ; while( ps - > next! = N ULL ) { ps = ps - > next ; 3 printf( % d, % d, % c, % f, % s\ n, ps - > id, ps - > age, ps - > sex, ps - > salary, p s - > grade) ;,, ;,, : pn ptr pc, pc, ptr, pn pc - > next pn, pn - > next ptr 10.10, 10.8, : void insert_ node( struct worker p) { struct worker pc, ptr, pn ; int id; pc = p; printf( \ n : \ n ) ; scanf( % d, &id ) ; /, / while( pc - > id! = id)

{ if( pc - > next! = NULL) else pc = pc - > next ; { printf(,! \ n ) ; break; / / ptr = pc - > next ; pn = ( struct wor ker ) malloc( sizeof( struct wor ker ) ) ; printf( : \ n ) ; scanf( % d, % d, % c, % f, % s, & pn - > id, & pn - > age, & pn - > sex, & pn - > salary, pn - > grade) ; pc - > next = pn; pn - > next = ptr; 4, pc ptr, ptr - > next = pc - > next,, ph = ph - > next 10.11, 10.8, : struct worker del_node( str uct worker p) { struct worker ph, pc, ptr; int id; ph = p ; pc = ph; printf( : \ n ) ; scanf( % d, &id) ; if( pc - > id = = id) ph = pc - > next ; else { while( pc - > id! = id) if( pc - > next! = N ULL) {ptr = pc; pc = pc - > next ; else {printf(! \ n ) ; break; if( pc - > id = = id) {ptr - > next = pc - > next ; retur n p h;

10.6 : typedef,,, : typedef int IN TEGER; typedef char charp ; int char, : INTEGER a, b; / / int a, b; charp p1, p2; / / char p1, p2 A, B A, 4, B, 2,, : typedef int IN TEGER; B,, typedef long INTEGER ;,,,,,,,,,,,,,,,,,,,

1. : union { int x; a ; struct{char c1, c2 ;b ; 10 : a.x = 0x1234, a.b.c1 ( ) 2. typedef : typedef int ARRAY[ 10 ] ; a[10] 3. : struct { int x, y; s [2 ] = {{10, 20, {3,4, p = s; ( ), a.b.c2 : + + p - > x, ( + + p ) - > x 4. : struct { int x; char y; tab [2 ] = {{1, ab, {2, cd, p = tab; ( p).y, ( ( + + p ) ).y 5.,, struct node { int data ; 6. : struct {int day; char month ; int year;a, b; b = &a ; a.day day, b a.day 7. typedef struct { long x [2 ] ; int y[ 4] ; char z[ 8] ; MY TYPE ;

MYTYP E a ; { printf( % d\ n, sizeof(a) ) ; 8. : struct dent { int n; ; int m; int a = 1, b = 2, c = 3; struct dent s [3 ] = {{101, & a, {102, & b, {103, &c; struct dent p = s ;, ( + + p) - > m 9. : struct rr{int a; float b; b1 ; union ss{char a ; float b; b2; struct tt{int a ; u nion ss c; b3; int 4, char, float 4, b1 b2 b3 10. enum month {Jan, Feb, Mar, Apr = 8, May, J un, Jul, Aug, Sept, Oct, Nov, Dec ; enum month mon1 = Mar, mon2 = Sept ; printf( % d, % d, mon1, mon2) ; 1. ( ( m) ( kg) ), / ( 2), 18 25, 18, 25 2. 10, ( 60 ) ( 60 80, 60 80 ) ( 80), 3. n ( ), ( N 1000, ) 4. ( ID,,, ( ) ),, ( T ),, ( S ), 5.,, 6.,,, - 1 7., 100

11 C : # define, # include : 11.1 C, #, C, C C : ( # define # undef) ( # include) ( # if # else # elif # endif # ifdef ifndef ) #, ;, C 11.2 11.2.1 1, : # define, : # define PI 3.14159

# define fmt s is % f\ n { float r = 5.0, s; s = P I r r; printf( fmt, s) ; : s is 78.539750,,, PI fmt,, PI 3.14159 2 # undef C, C C,, # undef # undef, # u ndef : # undef : # define PI 3.14159 { # undef PI, PI # define #, 3.14159, 3, : undef P I, # undef PI (1 ) #,, TAB (2 ), : # define PI 3.1415926 # define r 1.0 # define S PI r r (3 ),, \ : # define PI 3.1\ 415926 { printf( \ n% 9.7f\ n, PI) ;

3.1415926 : (4 ) VC + +, (5 ),, printf( PI\ n ) PI 3.14159 11.2.2 (6 ), 1, : : # define MU ( x, y) ( ( x) ( y ) ) # define ( ) MU ( x, y), MU, (,,,, 2, : ( ) : a = MU( 3, 6) ; b = 10.0/ MU (a + 5, 7) ;, : (1 ), ; (2 ),, ;,, (3 ),, ;, 3 : (1 ),, : (2 ),, # define MU( x, y) ( x) ( y ) # define MT ( x, y ) ( x y) a = 10.0/ MU( 3 + 5, 4-2) ; b = 10.0/ MT ( 3 + 5, 4-2) ; a = 10.0/ ( 3 + 5 ) ( 4-2 ), a = 10.0/ ( ( 3 + 5 ) (4-2) ) ; b = 10.0/ ( 3 + 5 4-2 ), b = 10.0/ ( (3 + 5) (4-2) )

(3 ), # undef 11.3 11.3.1 C,,,, 1 C # include, : # include : # include < > # include :, ; 2 (1 ) # include,,,.h (2 ) # include, # include (3 ) # include, (4 ), 3,,, # include,,, : define PI 3.14159 define T RUE 1 define FLASE 0 define NULL \ 0 define ESC 27 def.h, # include def.h 11.3.2 # include, C, stdio.h, : # include stdio.h,,

C,, I/ O, 1 I/ O I/ O, scanf printf stdio.h 11 1 11.1 scanf( format, ) printf( format, ) puts ( str) gets ( str) getchar( ) putchar( c) str str c 2, ma th.h, 11 2 11.2 pow( x, y) ; exp ( x) ; fabs ( x) ; log( x) ; sqrt( x) ; sin( x) ; x y e x x x x ( x ) x ( x ) 3 ctype.h, 11 3 11.3 isalnum(c) isalpha(c) isspace(c) islower(c) isupper (c) isdigit( c) ispunct(c) c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c ( ), 0

4,, string.h, 11 4 11.4 strchr( str, c) strlen( str) strcpy( str1, str2 ) strcmp( str1, str2) strcat( str1, str2 ) strstr ( str, substr) str c, c str, 0 str, \ 0 str2 str1, str1 str2 str1 str2 : 0 ; str1 str2, ; str1 str2, str2 str1, str1 str1 str2 substr str, substr str, 0 5 C,,, stdlib.h, 11 5 11.5 atof( str) atoi( str) exit( status ) free( pstr) malloc( size) rand( ) str, str str, str, sta tus,, 0, pstr size, 0 RAND_MAX 5,, C, C 11.4 C,,,,,,,

1. # if # if : # if 1 1 # elif 2 2 # elif n # else # endif : n n + 1 : 1,, 1, ; 1,, n + 1 # elif # else, # if # else # endif # if # endif : # define BUFSIZE 256 { # if BUFSIZE > 64 printf( BU FSIZE > 64 \ n ) ; # else printf( BU FSIZE < 64 \ n ) ; # endif : BU FSIZE > 64 :,, 2. # ifdef # ifdef : # ifdef 1 # else 2 # endif :, 1, 2

, # else, # ifdef # endif 3. # ifndef # ifndef : # ifndef 1 # else 2 # endif : # ifdef,, 1, 2 # else, # ifndef # endif,, : (1 ), #, (2 ),,,.exe,, (3 ),,, C, C,, # include,, # include C,, 11 1. 2.C,,, 3. # include 4. # define PR ( a) printf( = % d\ n, a) { int x = 1, y = 1, z = 1; x + = y + = z;

5. PR( x < y? y: x ) ; PR( x) ; PR( y ) ; PR( z) ; # include < stdio.h > # define PR ( a) printf( a = % d, (int) ( a) ) # define PRINT (a) PR( a) ; putchar( \ n ) ; { float x = 3.1415, y = 1.823; PRINT ( 2 x) ; PRINT ( 3 y y ) ; 6. # define MIN( x, y ) ( x ) < ( y)? ( x) : ( y ) { int i = 10, j = 15, k; k = 10 MIN (i, j) ; printf( %d \ n, k ) ; 7. # define N 2 # define M N + 1 # define NUM ( M + 1) M/ 2 { int i; for(i = 1; i < = N UM; i + + ) ; printf( %d \ n, i) ; 8. # define A 3 # define B(a) ( ( A + 1) a) { int x; x = 3 ( A + B(7 ) ) ; printf( x = %4d\ n, x) ; 9.

{ int b = 5 ; # define b 2 # define f( x ) b ( x) int y = 3; printf( %d,, f( y + 1) ) ; # undef b printf( %d,, f( y + 1) ) ; # define b 3 printf( %d \ n, f( y + 1) ) ; 10. # define DEBUG { int a = 14, b = 15, c; 0 c = a/ b; # ifdef DEBUG printf( a = % d, b = %d,, a, b) ; # endif printf( c = % d\ n, c) ; 1. MY AL P H A ( c), c,, 1;, 2. AREA( a, b, c), a, b c 3., 4. 1! + 2! + 3! + n!,

12 : : 12.1 C,,,,,,,,, ( ) C, ( ), ( ), ASCII ASCII,, ASCII, 1024 : ASCII : 00110001 00110000 00110010 00110100 : 1 0 2 4 4, ASCII, ASCII, 1024 : 00000100 00000000

,, C,,, 1,, :, stdio.h, F ILE FILE, : struct_iobuf { char _ptr; / / ; int _cnt; char _base; int _flag; int _file ; int _charbuf; int _b ufsiz; char _tmpfname; typedef struct_iobuf F ILE ; / / / / / / / / / / / / / /, # include < stdio.h > # include stdio.h stdio.h,, F ILE, F ILE fp; FILE fp, fp,, n, n ( F ILE ), n ( ), 2 C, ;, U NIX,,,, ;,,, ( ) : (1 ), 512, 512 ;, (2 ),,,

CPU,,,,, A NSI C, 12.2,,,,, C,, stdio.h 12.2.1 fopen A NSI C, fopen, stdio.h fopen : F ILE fopen (char fname, char mode) ; : fname,, = fopen (, ),, FILE,, : FILE fp; fp = fopen ( myfile.txt, r ) ;, myfile.txt,, fp : FILE fp; fp = fopen ( c: \ \ soft \ \ test.lib, rb ) ;, c: \ soft test.lib,, ( \ \ \, \ ) 12, 12 1 : r w a t b + 6, : r( read ) : w( write) : a(append) : t( text) :, b( binary) : + :

12.1 r w a rb wb ab r + w + a + rb + wb + ab +,,,,,,, r,, w,, ;,,, a,, fopen N ULL, : # include < stdio.h > # include < stdlib.h > # include < conio.h > { FILE fp; if( ( fp = fopen( c: \ \ soft \ \ test.lib, rb ) ) = = N ULL ) { printf( error on open file c: \ \ soft \ \ t est.lib! \ n ) ; getchar( ) ; exit(1 ) ; :, c : \ soft test.lib,, getchar,,,,, exit

, exit 0, 0, ( ) ( ) ( ),,, 3 :,, 12.2.2 fclose,, A NSI C fclose fclose : int fclose( FILE stream) ; : stream,, ;,, stream,, 0;, 0 12.1, # include < stdio.h > # include < stdlib.h > { FILE fp; if( ( fp = fopen( test.dat, rb ) ) = = N ULL) { printf( cannot open file\ n ) ; exit(0 ) ; / / if( fclose( fp) ) printf( file close error! \ n ) ; 12.3,,, ;,

12.3.1 1 fgetc fgetc fgetc : int fgetc( F ILE fp) ; :, fgetc EOF : ch = fgetc( fp) ; fp ch : fgetc,,,, fgetc,, fgetc,,,,,,,, 2 fputc fputc fputc : int fputc(char ch, FILE fp ) ; : : fputc(ch, fp), ch ( ) fp :,,,,,, fputc,, ;, EOF 12.2,, # include < stdio.h > # include < stdlib.h > # include < conio.h > main (int argc, char argv[ ] ) { char ch; FILE fp;

if( ( fp = fopen( argv[1 ], w + ) ) = = N ULL) { printf( \ n T he file: % s can not be opened \ n, argv[1 ] ) ; getch( ) ; exit(1 ) ; printf( Input a string: \ n ) ; ch = getchar ( ) ; while( ch! = \ n ) { fputc(ch, fp) ; rewind( fp) ; ch = getchar ( ) ; ch = fgetc(fp) ; while( ch! = EO F ) { putchar( ch ) ; ch = fgetc(fp) ; printf( \ n ) ; fclose( fp ) ; / / main,, argc, argv,, argc dispfile.exe, : dispfile filename.txt < CR >, 2, argc 2, dispfile, filename.txt argv[ 0] dispfile, argv [1 ] filename.txt,, fp, T he file: filename can not be opened,,,, getchar, fputc filename.txt rewind, fgetc, putchar,,, 12.3.2 1 fgets fgets : char fgets( char str, int num, FILE fp) ; : char fgets (, int num, F ILE fp) ; : fp num - 1,

str, ;, NULL, str ;, N ULL, str, str, n um,, fp : fgets num - 1 \ n EOF,, \ n fgets \0, ( \ 0 ) num str A NSI gets,, str,, gets 2 fputs fputs : int fputs (char str, F ILE fp) ; : int fputs(, FILE fp ) ; : str fp, \ 0, 0, EOF, str, fp 12.3, : # include < stdio.h > # include < stdlib.h > # define SIZE 512 main (int argc, char argv[ ] ) { char buffer[ SIZE] ; FILE fpsrc, fpdes ; if(argc! = 3 ) / / 3 { printf( \ n Error in format, Usage: linkfile file1 file2 ) ; exit(0 ) ; if( ( fpdes = fopen (argv[ 1], a ) ) = = N ULL) / / fpdes file1 {printf( T he file: % s can not opened\ n, argv[ 1] ) ; exit(0 ) ; if( ( fpsrc = fopen(argv[ 2], r ) ) = = N ULL ) / / fpsrc file2 {printf( T he file: % s can not opened\ n, argv[ 2] ) ; exit(0 ) ; / file2 buffer / while( fgets( buffer, SIZE, fpsrc)! = N ULL) fputs ( buffer, fpdes) ; fclose( fpsrc) ; fclose( fpdes) ; / / file2 file1

linkfile.exe, file1 file2, file1, : linkfile file1 file2, 3, linkfile.exe file1 file2, file2 file1, fpdes file1 a,, fpsrc, r, 12.3.3,,,, N ULL,, ANSI C 1 fread fread : int fread( void str, unsigned size, unsigned count, F ILE fp) ; : fp, count size str,, count ( ) ;, ; size count 0, 0, str, ; size ; count, size ; fp 2 fwrite fwrite : int fwrite( void str, unsigned size, unsigned count, F ILE fp) ; : fread,,, str, count, size fp 12.4 student.dat, : # include < stdio.h > # include < stdlib.h > # include < memory.h > struct st udent Info { char no[9 ] ; ; char name[10] ; char sex; int age; char address [20] ; typedef struct studentinfo ST UINFO ;

void WriteT ofile ( S TUINFO pstu, int num) ; void ReadFromFile( S TUIN FO pstu, int num ) ; { int i, n um; ST UINFO pstu; printf( input the number of students: ) ; / / scanf( % d, & num ) ; fflus h( stdin) ; / / pstu = ( ST UINF O ) malloc( num sizeof( S TUINFO) ) ; / / if( pstu = = N ULL) { printf( no enough memory\ n ) ; retur n 0; for(i = 0; i < num; i + + ) { printf( the % dth student : no =, i + 1) ; gets ( pstu[i].no) ; fflus h( stdin) ; printf( the % dth student : name =, i + 1) ; gets ( pstu[i].name) ; fflus h( stdin) ; printf( the % dth student : sex =, i + 1 ) ; scanf( % c, & pstu[i].sex ) ; fflus h( stdin) ; printf( the % dth student : age =, i + 1 ) ; scanf( % d, & pstu[i].age) ; fflus h( stdin) ; printf( the % dth student : address =, i + 1 ) ; gets ( pstu[i].address ) ; fflus h( stdin) ; WriteToFile( pstu, num) ; / / / / / / memset( pstu, 0, num sizeof( S TUIN FO) ) ; / / pstu ReadF romfile( pstu, num ) ; / / / / pstu printf( %10s%12s %6s% 5s% 20s \ n, no, name, sex, age, address ) ; for (i = 0; i < num; i + + ) free( pstu ) ; printf( %10s%12s %6c% 5d%20 s\ n, pstu[i].no, pstu[ i].name, pstu [i].sex, pstu [i].age, pstu [i].address ) ; / /

/ pstu student.dat / void WriteT ofile( S TUINFO pstu, int num) { F ILE fp; fp = fopen( student.dat, wb ) ; if( fp = = N ULL) { printf( Can t create student.da t \ n ) ; free( pstu ) ; exit( 0) ; fwrite( pstu, sizeof( S TUINFO), num, fp ) ; fclose(fp) ; / student.dat pstu / void ReadFromFile( S TUIN FO pstu, int num ) { F ILE fp; fp = fopen( student.dat, rb ) ; if( fp = = N ULL) { printf( Can t open student.dat \ n ) ; free( pstu ) ; exit( 0) ; fread( pstu, sizeof( S TUIN FO), num, fp ) ; fclose(fp) ; S TUINFO,,,,, ;, for, pstu WriteToFile student.dat,, ;, pstu fwrite student. dat memset, ReadFromFile, student.dat,, pstu, ;,, 12.3.4 /, / /, /

,, scanf printf, ; scanf printf, 1 fprintf fprintf : int fprintf( FILE fp, char format, [argument, ] ) ; :,, fp, ;, EOF, fp, format, printf, argument fprintf ( ASCII ),,, b = 13; fprintf( fp, % d, b ) ;, b (00000 01101) 1 3, ASCII 49 51 2 fscanf fscanf : int fscanf( FILE fp, char format, [ argument, ] ) ; : fp,,, ;, EOF, fp, forma t, scanf, argument fscanf( fp, % d, % f, & a, & b) ; % d, % f, fp a, b 12.5 1 1 1 1,, : # include < stdio.h > # include < stdlib.h > { FILE fp; char ch, str[80] ; int i; float f; fp = fopen( format.dat, wb + ) ; if( fp = = N ULL ) { printf( Can t open forma t.dat \ n ) ; exit(0 ) ; printf( \ n input a charact er: ) ;

scanf( % c, &ch ) ; printf( \ n input an integer: ) ; scanf( % d, &i) ; printf( \ n input a float : ) ; scanf( % f, & f) ; printf( \ n input a string, less than 80 character: ) ; scanf( % s, str ) ; fprintf( fp, % c % d % f % s, ch, i, f, str) ; rewind( fp) ; fscanf(fp, % c %d % f % s, &ch, &i, & f, str) ; fclose( fp ) ; printf( \ n\ nresult : \ n ) ; printf( character: % c\ n, ch ) ; printf( integer: %d \ n, i) ; printf( float : % f\ n, f) ; printf( string: % s\ n, str) ; / / 12.4 1,,,,,,, 2 fseek fseek : int fseek( FILE fp, long offset, int base) ; : fp base offset,, 0;, 0, fp, base, base 12 2 ; offset, base 12.2 SE EK_SE T 0 SEEK_CU R 1 SEEK_END 2 offset,, 0,

fseek( fp, 20L,0 ) ; fseek( fp, 70L,1 ) ; fseek( fp, - 30L,2 ) ; : / / 20 / / 70 / / 30,, L l ;, ( long) ( ) fseek,, ;,, 12.6 12.4 student.dat 10, : # include < stdio.h > # include < stdlib.h > struct st udent Info { char no[9 ] ; ; char name[10] ; char sex; int age; char address [20] ; typedef struct studentinfo ST UINFO ; { int i = 1 ; ST UINFO pstu, stu; FILE fp; pstu = & stu; fp = fopen( student.dat, rb ) ; if( fp = = N ULL ) { printf( Can t open student.da t \ n ) ; exit(0 ) ; fseek (fp, i sizeof( S TUIN FO), 0) ; / / fread( pstu, sizeof( S TUIN FO), 1, fp ) ; fclose( fp ) ; / / printf( %10 s%12s% 6s%5s%20s \ n, no, name, sex, age, address ) ; printf( %10 s%12s% 6c%5d% 20 s\ n, pstu - > no, pstu - > name, pstu - > sex, pstu - > age, pstu - > address) ;

3 rewind,, rewind rewind : void rewind( FILE fp) ; : fp 4 ftell ft ell : long int ftell( FILE fp) ; : fp,, ;, - 1L : i = ft ell( fp ) ; if(i = = - 1L ) printf( error ) ;, i, ( ), error 12.5 1 feof feof : int feof( FILE fp ) ; : fp, 0 ; 0, 12.7 a.txt,, b.txt : # include < stdio.h > # include < stdlib.h > { FILE fpa, fpb; if( ( fpa = fopen ( a.txt, r ) ) = = N ULL) { printf( Can t open a.txt \ n ) ; exit(1 ) ; while(! feof( fpa) ) putchar( fgetc( fpa) ) ; if( ( fpb = fopen ( b.txt, w ) ) = = NULL) { printf( Can t open b.txt \ n ) ; exit(1 ) ; rewind( fpa ) ; / / feof / / a.txt / / a.txt

while(! feof( fpa) ) fputc(fgetc(fpa ), fpb) ; / / a.txt b.txt fclose( fpa) ; fclose( fpb) ; 2 ferror ferror : int ferror( FILE fp) ; : fp ( ), 0 ;, 0 12.6 12.8 addr.txt, t el.txt, addrtel.txt : addr.txt hejie tianjing liying shanghai liming chengdu wangpi n chongqing tel.txt liying 12345678 hejie 34567812 wangpi n 56781234 liming 78123456, 14, 14,, 0,,,,,,,, : # include < stdio.h > # include < stdlib.h > # include < string.h > { FILE fptr1, fptr2, fptr3 ; / / char t emp[ 15 ], temp1 [15], temp2 [15] ; if( ( fptr1 = fopen( addr.txt, r ) ) = = N ULL) / /

{ printf( cannot open file addr.txt \ n ) ; exit(1 ) ; if( ( fptr2 = fopen( tel.txt, r ) ) = = N ULL) { printf( cannot open file tel.txt \ n ) ; exit(1 ) ; if( ( fptr3 = fopen( addrtel.txt, w ) ) = = N ULL ) { printf( cannot open file addrtel.txt \ n ) ; exit(1 ) ; while( (fgets ( temp1, 15, fptr1 ) )! = N ULL ) { fgets( temp2, 15, fptr1) ; / / fputs (t emp1, fptr3) ; fputs (t emp2, fptr3) ; strcpy( temp, temp1 ) ; do fclose( fptr1 ) ; fclose( fptr2 ) ; fclose( fptr3 ) ; { fgets( temp1, 15, fptr2) ; fgets( temp2, 15, fptr2) ; while( strcmp( temp, temp1 )! = 0 ) ; rewind( fptr2 ) ; fputs (t emp2, fptr3) ;, addrtel.txt, : addrtel.txt hejie 34567812 liying 12345678 liming 78123456 wangpi n 56781234 tianjing shanghai chengdu chongqing / / / / / / / / / / / /, / / / /

,, C : C, C, C ASCII C,,,, ( ), fopen, fgetc fputc fgets fputs fread fwrite fprintf fscanf, fclose, fopen N ULL,,, 4,,, 12 1.,,,, # include < stdio.h > # include < stdlib.h > main (int argc, char argv[ ] ) { FILE fpsrc, fpdes ; char ch; if(argc!= 3) { printf( You forget to enter a filename\ n ) ; exit( 1) ; if( ( fpsrc = fopen( ) ) = = N ULL) { printf( cannot open source file\ n ) ; exit( 1) ; if( ( fpdes = fopen ( ) ) = = N ULL) { printf( cannot open destina tion file \ n ) ; exit( 1) ; while(! feof( fpsrc) ) { fputc(, fpdes) ; fclose( fpsrc) ; fclose( fpdes) ; 2. 10 integer.dat,

# include < stdio.h > # include < stdlib.h > { int i, j; FILE fp; if( ( fp = fopen(, wb ) ) = = N ULL) { printf( cannot open source file\ n ) ; exit(1 ) ; for(i = 0; i < 10 ; i + + ) { scanf( % d, &j) ; fclose( fp ) ; fwrit e(, sizeof( int),1, ) ; 1., compare OK ;, not equal 2.,, ( AbCDefG, abcdefg ), 3., : ( 10 ) (4 ) (1 ) ( ),, 4.,

13 C + + C + + : C + + : 13.1, 20 60, 20 80,, :,,,,,, ;,, 20 80,,,, ( ), ( ), ( Object - Oriented Analysis, OOA ) ( Object - Oriented Design,

OOD), 1967 SIMULA - 67, SIMULA - 67 1981 XEROX Palo Alto ( PARC ) Smalltalk - 80, SIMULA - 67,, 20 90, ( OOA ) (OOD) :,,,, :,, ( ), ( ),, ( ),,, ( ),,, ( ), 1,,, (1 ),,,, ;,,,,,, ;,,,, ( Object) ( ) ( )

, 13 1, ( class),,, ( ),,,,,,, 13.1 :,,,, student course, student course,,,,,, (2 ) ( ) ( ),,,, ( bit ) ( byt e) (word),,,, C,,,, ( Instance),,,,,,,,

(3 ),,,,,,,,, ( ),,,, :,,,, 2, : (1 ) ( Encapsulation ),,,,,,, ( ), ( ),,,,,,,,,,, ;,, (2 ) ( Inheritance),,,,,,,,, 13.2 (a), ; 13.2 ( b )

, 13.2 ( reusability),, (, ),,, windows,,,, (3 ) ( PolymoRphism),? ( polymorphism ), poly ( ) morphos( ), many forms,,,,,,,,,,,,,,,, : ( ),,, : int max(int i, int j) { return i > j? i: j; float max( float i, float j) { return i > j? i: j; i, j 3 17 1.2 0.5,, max ( 3, 17 ) max ( 1.2, 0.5),,,,,,,,

, ( binding, ),,,,,,, : ( static binding) ( dynamic binding ),,, ( early binding),,, (late binding ),,,,,,,,, 13.2 C + + 13.2.1 C + + C Dennis Ritchie B, 1972 DEC PDP 11 C,, C, :,,, C, U NIX, U NIX, C 20 80, C,, C + + C 1980, Bjarne Strou strup C Simula C,, C 1983, C + +, C 100%, C + + C 1985 Bjarne Stroustrup C + +, C + + 1.0 Bjarne Stroustrup C + + 1.0, 1988 C + + 2.0

, C + + C + + 2.0, C + +, C + + C + +, C + +, 1989, 1994 A NSI C + +,, C + + 13.2.2 C + + C + + C,, C + + C C, C,C + +, C + + C C + + C, C C + +, C C + +, C C + +, C C + +, C + +, C + +,, 10% 20% C + + (, ),,, 13.2.3 C + +, C + + C, 13.1 C + + hello world # include < iostream.h > { cout < < hello world! \ n ; : retur n 0; cout, C printf,, < < cout, cout cin,, C scanf,,, # include # define, main, C + +, C + + C + +.cpp, C + + C C + +,.h, C + + C + +.hpp,,,, ( )

13.2.4 C + + C + +, C + + C + +, 1,,,,,,, C + +, :,, class { private : ; protected: pub lic: class, C + +,, :, ; ( ),, ( public ) ( private ) ( protected),, public private protected, privat e,,, protected,,, public,,,, Cube, : class Cube { private :

; int height, width, depth; / /, pub lic: void SetData(int x, int y, int z) { height = x; width = y; depth = z; int CalVolume( ) { return height width depth; / /, / /, ( ), private,, Cube,,, Cube SetData CalVolume 2,, C + +,,,,, C + +, ( SetData CalVolume),,, : ; : Cube mycu be;, Cube mycube,,,,,,,,,., :. ( ), mycube.calvolume( ) mycube,,,,,, 13.2 Cube cube_a cube_b : # include < iostream.h > class Cube

{ private : ; int height, width, depth; / /, pub lic: void SetDa ta( int x, int y, int z) { height = x; width = y; depth = z; int CalVolume( ) { return height width depth ; / /, / /, { Cube cube_a, cube_ b; / / cube_a.setdata(10, 20, 30) ; cout < < cube_a.calvolume( ) < < \ n ; / / cube_a cube_b.setdata(40, 50,60) ; cout < < cube_b.calvolume( ) < < \ n ; / / cube_b retur n 0;, C + +, C + + ( C,,, ) 1.? 2. 3.?? 4. public private,? 5.?? 1. Rectangle,, 2. Student, 4, in sert, change, display main, Student, 13

1 1 2 3 4 5 ( ) [ ] - >! + + - - - ( ) & size of / % + - < < > > 1 2 2 2 6 < < = > > = 2 7 = =! = 2 8 & 2 9 2 10 2 11 & & 2 12 2 13? : 3 14 = + = - = = / = % = > > = < < = & = = : = 2 15, ( )

2 ASCII ASCII ( ) ASCII ( ) ASCII ( ) ASCII ( ) NU L 0 SPACE 32 @ 64 96 SO H 1! 33 A 65 a 97 ST X 2 34 B 66 b 98 E T X 3 # 35 C 67 c 99 EO T 4 36 D 68 d 100 E N Q 5 % 37 E 69 e 101 ACK 6 & 38 F 70 f 102 BEL 7 39 G 71 g 103 BS 8 ( 40 H 72 h 104 H T 9 ) 41 I 73 i 105 LF 10 42 J 74 j 106 V T 11 + 43 K 75 k 107 F F 12, 44 L 76 l 108 CR 13-45 M 77 m 109 SO 14. 46 N 78 n 110 SI 15 / 47 O 79 o 111 DLE 16 0 48 P 80 p 112 D C1 17 1 49 Q 81 q 113 D C2 18 2 50 R 82 r 114 D C3 19 3 51 S 83 s 115 D C4 20 4 52 T 84 t 116 N AK 21 5 53 U 85 u 117 S YN 22 6 54 V 86 v 118 E T B 23 7 55 W 87 w 119 CA N 24 8 56 X 88 x 120 EM 25 9 57 Y 89 y 121 SU B 26 : 58 Z 90 z 122

E SC 27 ; 59 [ 91 { 123 FS 28 < 60 \ 92 124 GS 29 = 61 ] 93 125 RS 30 > 62 ^ 94 126 US 31? 63 _ 95 DEL 127 : BEL( bell) : ; BS ( backs pace) : ; H T( horizontal tab) : ; FF ( form feed) : ; LF (line feed) : ; VT (vertical tab ) : ; SUB ( substitute) : ; CAN (cancel) : ; CR(carriage return) : ; ESC(escape) : ; SP ( space) : ; DEL( delete) :

3 C VC + + 6.0 1 C (1 ) VC + + 6.0, / / Microsoft Visual Studio/ Microsoft Visual C + + 6.0, VC + + 6.0, 1 1 VC + + 6.0 1, File/ New 2, Files, C + + Source File, 2

(,.cpp ), ok, 3,, 3 (2 ) Build/ Compile,,, 4, 5, 4 5,, : ;, 6 6

, 0, Build/ Build,, 7, Build/ Execut e (3 ) 8 8,,, 8 7 Build : 9 9,, C!,,,, File/ Close Work space ( 10 ),, main 10

2 VC + + 6.0 :,, VC + + 6.0,,,, ( ),, VC + + 6.0 (1 ),, 11 11 (2 ) ( F5),,,, 12 12 : Debug,

Go:, Restart : Stop Debugging:, Step Into:, Step Over:,,, Run to Cursor:, QuickWatch:,, 12,, sum, - 858993460, s um = acc( 100 ), sum ( ) Step Into( F11 ), acc( ),, 13 13 acc (3 ) Debug/ QuickWatch, Debug ( Deb ug QuickWatch ), 14

14, Recalculate,, Add Watch, 15 15

3 VC.opt.aps.clw.dsp.dsw ( ) ( A ppstudio File), ClassWizard, INI ( DeveloperStudio P roject), ( DeveloperStudio Workspace), dsp,,.plg.hpj.mdp error warning ( html ) Tools - > Options ( Help P roject), Microsfot Help Compiler ( Microsoft DevStudio Project),, dsp.bsc.map.pch.pdb.exp.ncb, Source Browser, Project Options Generate Browse Info File,,, ( Pre - Compiled File),, ( Program Database), dll, dll ( no compile browser)

4 1 VC + + 6.0 1 2 fa tal error C1010 : un expec ted e ndof file w hile looking for prec ompiled hea der directiv e fa tal error C1083: Cannot op en include file & # 58 R.h : No su ch file or directory, R.h : 3 error C2011 : C : class typ e red efinition 4 error C2018 : unknown c haract er 0xa3 C 0 xa3 ( ) 5 error C2057 : expec ted c on st ant expression ( swit ch case ) 6 error C2065 : IDD_M YDI A LO G : undeclared identifi er 7 error C2082 : red efinition of formal paramet er br ese t br ese t 8 error C2143 : s ynt a x error : missing ; before { { ; 9 errorcc2146 : synt ax error d c : missing ; b efore id entifier d c ; 10 error C2196 : case v alu e 69 already used 69 ( s witc h case ) 11 error C2509: O n Timer : memb er function not declared in CH elloview On T imer C HelloView 12 error C2660 : Set T imer : fun ction does not ta k e Se t Timer 2 2 p arame ter s 13 war ning C4035: f : no retur n va lu e f retu rn 14 15 war ning C4553 : = = : op era tor h as no effec t; did you inte nd =? war ning C4700 : lo ca l variable brese t u sed wit hout ha ving bee n initialized = = ; =? brese t 16 error C4716 : CMyApp: : InitIn sta nce : mus t re turn CMyApp: : InitIn st an ce a v alu e 17 L IN K: fa tal er ror L NK1168 : cannot ope n De bug/ p1.ex e for w riting : p1.e xe, ( p1.ex e, ) 2 VC + + LNK2001 VC + + LNK2001,,,

,, LN K2001, VC + +, LN K2001 : unresolved external symbol symbol ( ),, : ; LN K2001 : (1 ) LN K2001 (.DE F ) LNK2001, C + + var1, var1,.cpp, LN K2001, LN K2001 LNK2001,, LNK2001 ( ) (2 ) LN K2001 / N OD(/ NODEF A ULTLIB), MFC,, / NOD LN K2001 wwinmaincrt Startup, Unicode M FC unresolved external on_bluesky@ahu LN K2001 / ML, LIBCMT.LIB _errno LNK2001, LNK2001;,, LN K2001 C + + (/ Ob1 / Ob2 ), ( inline ),, inline, LN K2001,,

5 C 1, : # include math.h aco s asin a ta n a ta n2 cos cos h e xp fa bs floor fmod log log10 double acos ( x ) double x double asin ( x) double x double a ta n( x ) double x double a ta n2 ( x, y) double x, y double cos ( x ) double x double cos h( x ) double x double exp ( x) double x double fab s ( x) double x double floor ( x) double x double f mod ( x, y) double x, y double log( x) double x double log10 ( x ) double x cos - 1 ( x) - 1 < = x < = 1 sin - 1 ( x ) - 1 < = x < = 1 ta n - 1 ( x ) ta n - 1 ( x/ y) cos ( x ) x x cosh ( x ) e x x x x/ y log e x lnx log 10 x ( ) ( ) modf double modf ( val, ipt r) double v al int iptr val, iptr val pow double pow ( x, y ) double x, y x y sin double sin ( x) double x sin( x) x sinh double sinh ( x) double x x sinh( x ) sqrt double sqrt ( x) double x x, x 0 ta n double t a n( x ) double x ta n( x) x ta nh double t a nh( x ) double x x t anh ( x)

2, : # include ctype.h isal num int isalnu m (c h) int ch c h 1, 0 isalph a int isalph a( ch ) int ch c h 1, 0 iscnt rl int isc ntrl(c h) int ch c h ( ASC 0 0xlF ) 1, 0 is digit int isdigit (c h) int ch c h 1, 0 is gra ph int isgraph (c h) int ch c h ( A SC 0x21 0x7e ), 1, 0 islower int islower ( ch ) int ch c h ( a z) 1, 0 is print int isprint (c h) int ch c h ( A SC 0x20 0x7e ), 1, 0 is pun ct int ispunc t( ch ) int ch c h ( ) 1, 0 issp ace int iss pace( ch ) int ch c h ( ), 1 ;, 0 is upp er int isupper (c h) int ch c h ( A Z ) 1, 0 is xdigit int isxdigit (c h) int ch c h 16 ( 0 9, A F, a f ), 1 ;, 0 tolower int tolower ( ch ) int ch ch c h toupp er int toupper (c h) int ch ch c h

3, : # include string.h memch r void memc hr ( buf, ch, count ) void buf ; c har ch; unsign ed int c ount ; buf count ch buf c h ; ch, NU LL memcmp int memcm p( buf1, buf2, count) void buf1, buf2 ; unsign ed int c ount ; buf1 buf2 count buf1 < buf2, buf1 = buf2, 0 buf1 > buf2, void memcpy( to, f rom, count ) from count memcpy void to, from ; to from to to unsign ed int c ount ; st rca t c har strcat ( s tr1, st r2 ) c har str1, str2; s tr2 s tr1, s tr1 \ 0 st r1 st rc hr c har strch r( str1, c h) c har str ; int ch ; str ch,, N U L L st rcm p int st rcm p( str1, st r2 ) c har str1, str2; st r1 st r2 s tr1 < str2, s tr1 = str2, 0 s tr1 > str2, st rc py c har strcpy( str1, s tr2) c har str1, str2; str2 s tr1 st r1 st rlen unsign ed int s trlen ( str ) c har str ; s tr ( \ 0 ) c har strn cat ( s tr1, st r2, count ) st r2 st rnca t c har str1, str2; count str1, st r1 unsign ed int c ount ; N U LL st rncm p int str ncmp ( st r1, str2, count ) c har str1, str2; unsign ed int c ount ; str1 str2 count s tr1 < str2, s tr1 = str2, 0 s tr1 > str2, st rnc py c har strn cpy( str1, s tr2, count) c har str1, str2; unsign ed int c ount ; str2 count str1 st r1 st rse t void st rset ( buf, ch ) void buf ; c har ch; buf ch buf st rs tr c har str str ( str1, s tr2) c har str1, str2; st r2 str1 st r2, N U L L

4, : # include stdio.h cl earerr void cl earerr ( fp) F IL E fp close int close( fp) int fp ( AN SI ) 0, - 1 creat int crea t( filen ame, m od e) c har filen ame; int mode mod e ( A NSI ), - 1 eof int eof( fp ) int fp ( AN SI ) 1, 0 fcl ose int fclose( fp) F IL E fp fp, 0, 0 fe of int feof( fp) F IL E fp fp 0, 0 fer ror int fer ror ( fp ) F IL E fp fp 0; 0 fflus h int fflus h( fp ) F IL E fp fp 0 ; 0 fget s c har fge ts ( buf, n, fp) c har buf; int n ; F IL E fp fp ( n - 1 ), buf buf; E O F fget c int fge tc( fp) F IL E fp fp ; E O F fop en F IL E fope n( fil en ame, mode) c har filen ame, mod e mod e file na me, ; 0 fprin tf int fprintf ( fp, forma t, args, ) F IL E fp; c har for ma t args for mat fp fputc int fputc( ch, fp) c har c h; F IL E fp c h fp ; E O F fputs int fputs ( str, fp) c har s tr; F IL E fp str fp 0 ; E OF fread int frea d( pt, size, n, fp) c har pt; unsign ed size, n ; F IL E fp fp size n, pt, 0 fscanf int f sca nf( fp, for mat, arg s, ) F IL E fp; c har forma t fp for mat args ( args )

fsee k int f see k ( fp, offse t, b ase) F IL E fp; long offse t; int b ase fp b ase offset ;, - 1 fwrit e int fw rite( pt r, size, n, fp) c har ptr ; un signed size, n; F IL E fp ptr n size fp fp ge tc int g et c( fp ) F IL E fp; fp ; E O F ge tc har int g et char ( ) ; - 1 ge ts c har g ets ( str ) c har str st r st r, N U L L open int ope n( filen ame, m od e) c har filen ame; int mode m od e file name ( A NSI ) ( ), - 1 prin tf int printf ( forma t, args, ) c har for ma t for mat, arg s, putc int put c( ch, fp) int ch ; F IL E fp; ch fp c h, E OF putc har int put ch ar ( ch ) c har c h; c h ch, E OF puts int put s( st r) c har str ; s tr ; \0, E OF putw int putw ( w, fp) int w; FI LE fp; w ( ) fp ( AN SI ),, E O F int rea d( fd, buf, count ) fp count read int fd; ch ar buf; buf (, 0, unsign ed int c ount ; A NSI ) - 1 remove int rem ove( fn ame) c har fn ame; fname 0, - 1 ren ame int re name( on ame, nname) c har oname, nname ; ona me nna me 0, - 1 rewind void rewind( fp) F IL E fp; fp, sca nf int sca nf( for mat, arg s, ) c har for ma t for mat, args args arg s EO F, 0 w rite int writ e( fd, buf, count) int fd; ch ar buf; unsign ed count; buf count fd ( AN SI ), - 1

5, : # include stdlib.h call loc void calloc( n, size) unsign ed n ; unsign ed size ; n, size, 0 free void free( p) void p; p mal loc void malloc( size) unsign ed size ; size,, 0 void reallo c( p, size) p realloc void p; size size, unsign ed size ; N U L L 6 C,,, : # include stdlib.h a bs int ab s ( num ) int nu m nu m a tof doubl e a tof ( s tr ) c har str s tr double a toi int a toi( st r) c har str str int a tol long a tol( st r) c har str str long e xit void exit ( s ta tus ) int st atu s; st atu s c har itoa( n, str, ra dix ) n radix itoa int n, radix ;, str s tr c har str l abs long l ab s( num ) long num num rand int ra nd( ) 0 R AND_ M AX RA ND_ MAX random int ra ndo m ( num ) int nu m ; 0 nu m

[1 ].C. :, 1999,2004 [2 ].. :,2003 [3 ].C. :, 2006 [4 ].C. :, 2004 [ 5].C. :, 2006 [6 ],,.C. :, 2005 [7 ].. :,2004 [8 ].C. :, 2000 [9 ].C. :, 2003 [10].C/ C + +. :, 2000 [11]. C. :,2004 [12] H.M.Deitel,.C. :, 2000 [13] Dennis M.ritchie( ),.C ( ). :,2001 [14] H erbert Schild,.C ( ). :, 1994 [15]. ( 2007 ). :, 2007 [16 ]. - C. :, 2002 [17].C. :,2000 [18].C. :,1999 [19].C. :,2004 [20].C. :,2003 [21],,.C. :,2005 [22].C. :,2005 [23]. ( C ). :,2006 [24],.C. :, 2005 [25],.C. :, 2005 [26].C/ C + +. :, 2004

, C ( ) C,,,, ( ) ( CIP ) C / :,2008 ISBN 978-7 - 81110-326 - 7.C..C.T P312 CIP (2008) 017465 C ( 3 230039 ) 0551-5107784 787 1092 1/ 16 E-mail ahdxchps@ mail.hf.ah.cn www.ahupress.com.cn 2008 2 1 2008 2 1 ISBN 978-7 - 81110-326 - 7 00.00,