A/B (2010/10/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2010 10 8 A/B 1 2010 10 8 2 1 1 1.1 OHP.................................... 1 1.2....................................... 1 1.3.......................... 1 1.3.1 sample-001................................... 1 1.3.2 sample-002................................... 2 1.3.3 sample-003................................... 4 1.3.4 sample-004................................... 6 1.3.5 sample-005................................... 6 1.3.6 sample-006................................... 7 1.3.7 sample-007................................... 8 1.3.8 sample-008................................... 10 1.3.9 sample-009................................... 11 1.3.10 sample-010................................... 12 1.3.11 sample-011................................... 14 1.3.12 sample-012................................... 15 1.3.13 sample-013................................... 16 1.3.14 sample-014................................... 18 1.3.15 sample-015................................... 18 1.3.16 sample-016................................... 20 1.3.17 sample-017................................... 21 1.3.18 sample-018................................... 23 1 http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2 http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/20101008/20101008.html 1
1 1.1 OHP OHP (HTML) 3 (PDF) 4 1.2 8.1 ( Text p.184-189 ) > 1.3 1.3.1 sample-001 Download : sample-001.c 5 ( SJIS 6 ) 1: sample-001.c * 5 * * main int main ( void ) { int numbers[5]; int index; // 5 // printf ( "5 \n" ); for ( index = 0; index < 5; index++ ) { printf ( "%2d : ", index + 1 ); scanf ( "%d", &numbers[index] ); // index printf ( "--- ---\n" ); for ( index = 0; index < 5; index++ ) { printf ( "%5d\n", numbers[ 4 - index ] );? : 3 ohp/html/index.html 4 ohp/ohp.pdf 5 program/sample-001.c 6 program/sjis/sample-001.c // 4 1
47304 3 2957 602 73 1: sample-001 5 1 : 47304 2 : 3 3 : 2957 4 : 602 5 : 73 --- --- 73 602 2957 3 47304 2: sample-001.c 1.3.2 sample-002 Download : sample-002.c 7 ( SJIS 8 ) 2: sample-002.c 7 program/sample-002.c 8 program/sjis/sample-002.c 2
* NUMBER_OF_NUMBERS * * * NUMBER_OF_NUMBERS * 5 sample-001.c * 5 #define NUMBER_OF_NUMBERS 5 * main int main ( void ) { int numbers[number_of_numbers]; int index; //NUMBER_OF_NUMBERS // printf ( "%d \n", NUMBER_OF_NUMBERS ); for ( index = 0; index < NUMBER_OF_NUMBERS; index++ ) { printf ( "%2d : ", index + 1 ); scanf ( "%d", &numbers[index] ); // index printf ( "--- ---\n" ); for ( index = 0; index < NUMBER_OF_NUMBERS; index++ ) { printf ( "%5d\n", numbers[ (NUMBER_OF_NUMBERS-1) - index ] ); 47304 3 2957 602 73 3: 3
sample-002 5 1 : 47304 2 : 3 3 : 2957 4 : 602 5 : 73 --- --- 73 602 2957 3 47304 4: sample-002.c 1.3.3 sample-003 Download : sample-003.c 9 ( SJIS 10 ) 3: sample-003.c * NUMBER_OF_NUMBERS * * * END_OF_NUMBERS = NUMBER_OF_NUMBERS - 1 #define NUMBER_OF_NUMBERS 5 #define END_OF_NUMBERS (NUMBER_OF_NUMBERS-1) * main int main ( void ) { int numbers[number_of_numbers]; int index; //NUMBER_OF_NUMBERS // printf ( "%d \n", NUMBER_OF_NUMBERS ); for ( index = 0; index < NUMBER_OF_NUMBERS; index++ ) { 9 program/sample-003.c 10 program/sjis/sample-003.c 4
printf ( "%2d : ", index + 1 ); scanf ( "%d", &numbers[index] ); // index printf ( "--- ---\n" ); for ( index = 0; index < NUMBER_OF_NUMBERS; index++ ) { printf ( "%5d\n", numbers[ END_OF_NUMBERS - index ] ); // END_OF_NUMBERS 47304 3 2957 602 73 5: sample-003 5 1 : 47304 2 : 3 3 : 2957 4 : 602 5 : 73 --- --- 73 602 2957 3 47304 6: sample-003.c 5
1.3.4 sample-004 Download : sample-004.c 11 ( SJIS 12 ) 4: sample-004.c * * SOME_VALUE 2 + 3.. 5..? #define SOME_VALUE 2 + 3 printf ( "%d\n", SOME_VALUE * 4 ); // 5 4 = 20? sample-004 14 7: sample-004.c 1.3.5 sample-005 Download : sample-005.c 13 ( SJIS 14 ) 5: sample-005.c * * 11 program/sample-004.c 12 program/sjis/sample-004.c 13 program/sample-005.c 14 program/sjis/sample-005.c 6
#define SOME_VALUE (2 + 3) printf ( "%d\n", SOME_VALUE * 4 ); // 20 4.0 3 8: sample-005 20 9: sample-005.c 1.3.6 sample-006 Download : sample-006.c 15 ( SJIS 16 ) 6: sample-006.c * if then else * IF / THEN / ELSE / ENDIF #define IF if ( #define THEN ) { 15 program/sample-006.c 16 program/sjis/sample-006.c 7
#define ELSE else { #define ENDIF int num; int abs; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num ); IF num < 0 THEN abs = - num; printf ( "%d \n", num ); ELSE abs = num; printf ( "%d \n", num ); ENDIF printf ( "%d %d \n", num, abs ); -3 10: sample-006 : -3-3 -3 3 11: sample-006.c 1.3.7 sample-007 Download : sample-007.c 17 ( SJIS 18 ) 17 program/sample-007.c 18 program/sjis/sample-007.c 8
7: sample-007.c * ever * #define ever (;;) int num; printf ( "-1 \n" ); for ever { //.. printf ( " : " ); scanf ( "%d", &num ); if ( num == -1 ) { break; printf ( " %d \n", num ); printf ( "%d \n", num ); 4 9 1-5 0 6-1 12: 9
sample-007-1 : 4 4 : 9 9 : 1 1 : -5-5 : 0 0 : 6 6 : -1-1 13: sample-007.c 1.3.8 sample-008 Download : sample-008.c 19 ( SJIS 20 ) 8: sample-008.c * fromto * fromto int fromto ( int from, int to ) { return to - from + 1; int num1; int num2; 19 program/sample-008.c 20 program/sjis/sample-008.c 10
printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num1 ); printf ( " : " ); scanf ( "%d", &num2 ); printf ( "%d %d %d \n", num1, num2, fromto( num1, num2 ) ); 15 34 14: sample-008 : 15 : 34 15 34 20 15: sample-008.c 1.3.9 sample-009 Download : sample-009.c 21 ( SJIS 22 ) 9: sample-009.c * fromto * fromto 21 program/sample-009.c 22 program/sjis/sample-009.c 11
#define fromto(from,to) ((TO) - (FROM) + 1) int num1; int num2; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num1 ); printf ( " : " ); scanf ( "%d", &num2 ); printf ( "%d %d %d \n", num1, num2, fromto( num1, num2 ) ); 15 34 16: sample-009 : 15 : 34 15 34 20 17: sample-009.c 1.3.10 sample-010 Download : sample-010.c 23 ( SJIS 24 ) 10: sample-010.c 23 program/sample-010.c 24 program/sjis/sample-010.c 12
* ( ) * sqr_int / int sqr_int( int x ) { return x * x; * sqr_double / double sqr_double ( double x ) { return x * x; int num_int; double num_double; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d %d \n", num_int, sqr_int ( num_int ) ); printf ( " \n" ); printf ( " : " ); scanf ( "%lf", &num_double ); printf ( " %lf %lf \n", num_double, sqr_double ( num_double ) ); 13
4 7.6 18: sample-010 : 4 4 16 : 7.600000 7.600000 57.760000 19: sample-010.c 1.3.11 sample-011 Download : sample-011.c 25 ( SJIS 26 ) 11: sample-011.c * ( ) * ( ) #define sqr(x) ((X)*(X)) int num_int; double num_double; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d %d \n", num_int, sqr ( num_int ) ); 25 program/sample-011.c 26 program/sjis/sample-011.c 14
printf ( " \n" ); printf ( " : " ); scanf ( "%lf", &num_double ); printf ( " %lf %lf \n", num_double, sqr ( num_double ) ); 4 7.6 20: sample-011 : 4 4 16 : 7.600000 7.600000 57.760000 21: sample-011.c 1.3.12 sample-012 Download : sample-012.c 27 ( SJIS 28 ) 12: sample-012.c * ( ) 27 program/sample-012.c 28 program/sjis/sample-012.c 15
* ( ) #define sqr(x) ((X)*(X)) int num_int; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d + 1 ", num_int ); printf ( " %d \n", sqr ( ++num_int ) ); 5 22: sample-012 : 5 5 + 1 42 23: sample-012.c 1.3.13 sample-013 Download : sample-013.c 29 ( SJIS 30 ) 13: sample-013.c 29 program/sample-013.c 30 program/sjis/sample-013.c 16
* ( ) * sqr_int / int sqr_int( int x ) { return x * x; int num_int; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d + 1 ", num_int ); printf ( " %d \n", sqr_int ( ++num_int ) ); 5 24: sample-013 : 5 5 + 1 36 25: sample-013.c 17
1.3.14 sample-014 Download : sample-014.c 31 ( SJIS 32 ) 14: sample-014.c * * input #define input(msg,type,var) #define output(msg,var); (printf (MSG), scanf(type,&var)) (printf (MSG,VAR)) int num_int; double num_double; input( " \n", "%d", num_int ); output( " %d \n", num_int ); input( " \n", "%lf", num_double ); output( " %f \n", num_double ); 4 7.6 26: 1.3.15 sample-015 Download : sample-015.c 33 ( SJIS 34 ) 15: sample-015.c 31 program/sample-014.c 32 program/sjis/sample-014.c 33 program/sample-015.c 34 program/sjis/sample-015.c 18
sample-014 4 4 7.600000 7.600000 27: sample-014.c * * make_swap #define make_sqr(name,type) \ Type Name( Type n ) {\ return n * n;\ * make_sqr(sqr_int,int) make_sqr(sqr_double,double) int num_int; double num_double; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d %d \n", num_int, sqr_int ( num_int ) ); printf ( " \n" ); 19
printf ( " : " ); scanf ( "%lf", &num_double ); printf ( " %lf %lf \n", num_double, sqr_double ( num_double ) ); 4 7.6 28: sample-015 : 4 4 16 : 7.600000 7.600000 57.760000 29: sample-015.c 1.3.16 sample-016 Download : sample-016.c 35 ( SJIS 36 ) 16: sample-016.c * * int factrial ( int n ) { 35 program/sample-016.c 36 program/sjis/sample-016.c 20
if ( n < 2 ) { return 1; else { return n * factrial ( n - 1 ); int num_int; printf ( " \n" ); printf ( " : " ); scanf ( "%d", &num_int ); printf ( " %d %d \n", num_int, factrial ( num_int ) ); 5 30: sample-016 : 5 5 120 31: sample-016.c 1.3.17 sample-017 Download : sample-017.c 37 ( SJIS 38 ) 17: sample-017.c 37 program/sample-017.c 38 program/sjis/sample-017.c 21
* * int sum_two ( int n, int m ) { return n + m; * int sum_three ( int l, int m, int n ) { return sum_two ( sum_two ( l, m ), n ); * int sum_four ( int a, int b, int c, int d ) { return sum_two ( sum_three ( a, b, c ), d ); int a; int b; int c; int d; printf ( " 4 \n" ); scanf ( "%d", &a ); scanf ( "%d", &b ); scanf ( "%d", &c ); scanf ( "%d", &d ); printf ( " 4 %d \n", sum_four ( a, b, c, d ) ); 22
5 2 8 9 32: sample-017 4 5 2 8 9 4 24 33: sample-017.c 1.3.18 sample-018 Download : sample-018.c 39 ( SJIS 40 ) 18: sample-018.c * * N int sum_array ( int ary[], int size ) { if ( size > 0 ) { return sum_array ( ary, size - 1 ) + ary[ size - 1 ]; else { 39 program/sample-018.c 40 program/sjis/sample-018.c 23
#define NUM 4 int a[num]; int i; printf ( " %d \n", NUM ); for ( i = 0; i < NUM; i++ ) { scanf ( "%d", &a[i] ); printf ( "%d %d \n", NUM, sum_array ( a, NUM ) ); 5 2 8 9 34: sample-018 4 5 2 8 9 4 24 35: sample-018.c 24