PowerPoint Presentation

Transcription

1

2 p.130 p.198 p.208 2

3 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight 3

4 maxof(a, b); int maxof( int x, int y ) maxof(a, b c); int maxof( int x, int y int z ) 4

5 p.130 main int eng[5]; int max_e; /* */ /* */ eng max_e = maxof( eng, 5 ); [] int maxof( int vc[], int no ) int vc[0] vc[4] main maxof main eng maxof eng[2] vc eng[4] vc[4] eng[0] eng[1] eng[3] vc[0] vc[1] vc[2] vc[3] 5

6 list0611.c (p.130) #include <stdio.h> #define NUMBER 5 int max_of(int vc[], int no) int i; int max = vc[0]; for (i = 1; i < no; i++) if (vc[i] > max) max = vc[i]; return (max); int main(void) int i; int eng[number]; int mat[number]; int max_e, max_m; printf("%d n", NUMBER); for (i = 0; i < NUMBER; i++) printf("[%d] ", i + 1); scanf("%d", &eng[i]); printf( " "); scanf("%d", &mat[i]); max_e = max_of(eng, NUMBER); max_m = max_of(mat, NUMBER); printf(" %d n", max_e); printf(" %d n", max_m); return (0); 6

7 main int main(void) int na, nb, max; na = 24; nb = 62; max = maxof( na, nb ); return int maxof( int x, int y ) if (x > y) return (x); else return (y); na, nb x, y 7

8 p.132 8

9 #include <stdio.h> void set_value( int x, int y ) x = 0; y = 0; int main(void) int na, nb; na = 10; nb = 5; set_value( na, nb ); printf( na= %d n, na ); printf( nb= %d n, nb ); return (0); 9

10 #include <stdio.h> void set_value( int? vc[] ) vc[0] = 0; vc[1] = 0; int main(void) int x[2]; x[0] = 10; x[1] = 5; set_value( x? ); printf( x[0]= %d n, x[0] ); printf( x[1]= %d n, x[1] ); return (0); main x[0] x[1] = = vc[0] vc[1] set_value

11 list0612.c (p.132) #include <stdio.h> void int_set( int vc[], int no ) int i; for (i = 0; i < no; i++) vc[i] = 0; int main(void) int i; int ary1[] = 1, 2, 3, 4, 5; int ary2[] = 3, 2, 1; int_set(ary1, 5); int_set(ary2, 3); for (i = 0; i < 5; i++) printf( ary1[%d] = %d n, i, ary1[i]); for (i = 0; i < 3; i++) printf( ary2[%d] = %d n, i, ary2[i]); return (0); 11

12 p.140 x, #include <stdio.h> int x = 77; int main(void) int x=7; void print_x1(void) int x = 777; printf( "x = %d n", x ); void print_x2(void) printf( "x = %d n", x ); printf( "x = %d n", x ); print_x1(); print_x2(); printf( "x = %d n", x ); return(0); 12

13 p.140 #include <stdio.h> int main(void) int x = 77; int x=7; main void print_x1(void) int x = 777; printf( "x = %d n", x ); void print_x2(void) printf( "x = %d n", x ); printf( "x = %d n", x ); print_x1(); print_x2(); printf( "x = %d n", x ); return(0); main 13

14 p.140 #include <stdio.h> int x = 77; int main(void) int x=7; printf( "x = %d n", x ); print_x1(); print_x2(); printf( "x = %d n", x ); main return(0); 14

15 p.140 x, #include <stdio.h> int x = 77; int main(void) int x=7; void print_x1(void) int x = 777; printf( "x = %d n", x ); void print_x2(void) printf( "x = %d n", x ); printf( "x = %d n", x ); print_x1(); print_x2(); printf( "x = %d n", x ); return(0); 15

16 p.140 main #include, #define main 16

17 count.c #include <stdio.h> int count = 0; int main(void) int i; void func1(void) func1(); func2(); printf( fun1 was called n" ); count++; for(i=0; i < 5; i++) func1(); void func2(void) for(i=0; i < 3; i++) func2(); printf( fun2 was called n" ); printf( count = %d n", count ); count++; return(0); 17

18 list0619.c #include <stdio.h> int fx = 0; void func(void) static int sx = 0 ; int ax = 0; printf("%3d%3d%3d n", ax++, sx++, fx++); int main(void) int i; puts(" ax sx fx"); puts(" "); for (i = 0; i < 10; i++) func(); puts(" "); ax sx fx return (0); 18

19 p.198 getchar #include <stdio.h> int getchar(void) EOF -1 19

20 getchar list0808.c (p.199) #include <stdio.h> int main(void) int i, i, ch; int cnt[10] = 0; while (1) ch = getchar(); if (ch == EOF) break; puts(" "); for (i = 0; i < 10; i++) printf("'%d' %d n", i, cnt[i]); return (0); switch (ch) case '0' : cnt[0]++; break; case '1' : cnt[1]++; break; case '2' : cnt[2]++; break; case '3' : cnt[3]++; break; case '4' : cnt[4]++; break; case '5' : cnt[5]++; break; case '6' : cnt[6]++; break; case '7' : cnt[7]++; break; case '8' : cnt[8]++; break; case '9' : cnt[9]++; break; 20

21 C p.200, Table8-1. JIS

22 p.210 A, B, 1 puts( ); = NULL ABCD A B C D

23 char char char ABCD A B C D char str[5];? 5 23

24 p.210 list0902.c char #include <stdio.h> int main(void) char str[4]; str[0] = 'A'; str[1] = 'B'; str[2] = 'C'; str[3] = ' 0'; /* /* */ */ /* /* */ */ /* /* */ */ /* /* */ */ /* /* */ */ printf(" str %s n", str); /* /* */ */ return (0); 24

25 printf %s printf( n, %s str ); (a) char ss[ ] = A, B, C, D, 0 ; (b) char ss[ ] = ABCD ; 25

26 p.211 list0903.c printf #include <stdio.h> int main(void) char str[ ] = "ABC"; /* */ printf(" str %s n", str); /* */ return (0); 26

27 scanf char name[40]; 39 scanf scanf( %s, name ); 27

28 p.212 list0904.c #include <stdio.h> int main(void) char name[40]; printf(" "); scanf("%s", name); printf(" %s!! n", name); return (0); 28

29 -1 int search_value( int x[ ], int key ); -1 5 int 5 5 search_value search_value 29

30 5 report5.c subjet, L02001 aoki ( ) :00 ) 1 report5.c 20 A : **** B : ******* C : **** D 0-59 ** void display_graph( int tensu[ ], int num ); void heikin_bunsan( int tensu[ ], int num ); 30

31 31