C演習I 09 - OIT Archive

work91.c

#include <stdio.h>
 
#define NUMBER 8
 
int main(void){
    int data[NUMBER];
    int i;
    int sum;
 
    for (i=0; i<NUMBER; i++){
        scanf("%d", &data[i]);
    }
 
    sum = 0;
    for (i=0; i<NUMBER; i++){
        sum = sum + data[i];
    }
    printf("平均: %f\n", (double)sum/NUMBER);
 
    return 0;
}
 

work92.c

#include <stdio.h>
 
#define N 10
 
int main(void){
    int a[N] = {0, 10, 20, 30, 40, 50, 60, 70, 80, 90};
    int x, y;
    int tmp;
 
    printf("整数xを入力してください: ");
    scanf("%d", &x);
 
    printf("整数yを入力してください: ");
    scanf("%d", &y);
 
    printf("交換前: a[%d]=%d, a[%d]=%d\n", x, a[x], y, a[y]);
 
    tmp = a[x];
    a[x] = a[y];
    a[y] = tmp;
 
    printf("交換後: a[%d]=%d, a[%d]=%d\n", x, a[x], y, a[y]);
 
    return 0;
}
 

work93.c

#include <stdio.h>
 
#define N 12
 
int main(void){
    int a[N] = {0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110};
    int i;
    int tmp;
 
    printf("配列a = ");
    for (i=0; i<N; i++){
        printf("%3d ", a[i]);
    }
    printf("\n");
 
    for (i=0; i<N-1-i; i++){
        printf("a[%d]とa[%d]を交換します\n", i, N-1-i);
        tmp = a[i];
        a[i] = a[N-1-i];
        a[N-1-i] = tmp;
    }
 
    printf("配列a = ");
    for (i=0; i<N; i++){
        printf("%3d ", a[i]);
    }
    printf("\n");
 
    return 0;
}
 

work94.c

#include <stdio.h>
 
#define N 5
 
int main(void){
    int a[N] = {0, 10, 20, 30, 40};
    int b[N] = {0, 10, 20, 30, 40};
    int c[N] = {0, 10, 20, 30, 40};
    int i;
    int cnt;
    int tmp;
 
    for (cnt=0; cnt<N; cnt++){
 
        /* 配列aを左シフト */
        for (i=0; i<N-1; i++){
            a[i] = a[i+1];
        }
 
        printf("%d回目: a = ", cnt+1);
        for (i=0; i<N; i++){
            printf("%2d ", a[i]);
        }
        printf("\n");
 
 
        /* 配列bを右シフト */
        for (i=N-1; i>=1; i--){
            b[i] = b[i-1];
        }
 
        printf("%d回目: b = ", cnt+1);
        for (i=0; i<N; i++){
            printf("%2d ", b[i]);
        }
        printf("\n");
 
        /* 配列cを循環右シフト */
        tmp = c[N-1];
        for (i=N-1; i>=1; i--){
            c[i] = c[i-1];
        }
        c[0] = tmp;
 
        printf("%d回目: c = ", cnt+1);
        for (i=0; i<N; i++){
            printf("%2d ", c[i]);
        }
        printf("\n\n");
    }
    return 0;
}
 

work95.c

#include <stdio.h>
#define MAXSIZE 10
int main(void){
    int a[MAXSIZE] = {10, 20, 30, 40, 50};
    int index;  /* キーボードから入力した添字を格納 */
    int data;   /* キーボードから入力した値を格納 */
    int i;
 
    printf("a: ");
    for (i=0; i<MAXSIZE; i++){
        printf("[%d]=%d ", i, a[i]);
    }
    printf("\n\n");
 
    /* 1回目の入力 */
    printf("index: ");
    scanf("%d", &index);
    printf("data: ");
    scanf("%d", &data);
    printf("a[%d]に%dを挿入します\n", index, data);
 
    /* 挿入 */
    for (i=MAXSIZE-1; i>index-1; i--){
        a[i] = a[i-1];
    }
    a[index] = data;
 
    printf("a: ");
    for (i=0; i<MAXSIZE; i++){
        printf("[%d]=%d ", i, a[i]);
    }
    printf("\n\n");
 
    /* 2回目の入力 */
    printf("index: ");
    scanf("%d", &index);
    printf("a[%d]を削除します\n", index);
 
    /* 削除 */
    for (i=index; i<MAXSIZE-1; i++){
        a[i] = a[i+1];
    }
    a[MAXSIZE-1] = 0;
 
    printf("a: ");
    for (i=0; i<MAXSIZE; i++){
        printf("[%d]=%d ", i, a[i]);
    }
    printf("\n");
 
    return 0;
}
 

work96.c

#include <stdio.h>
#define N 10
int main(void){
    int a[N];
    int i, j;
    int min_index;
    int tmp;
 
    for (i=0; i<N; i++){
        scanf("%d", &a[i]);
    }
 
    /* iを0からN-1まで増やしながら，以下を繰り返す */
    for (i=0; i<N; i++){
 
        /* a[i]?a[N-1]の中から最小値をもつ要素の添字を
           見つけ，その添字をmin_indexに格納する */
        min_index = i;
        for (j=i; j<N; j++){
            if (a[j] < a[min_index]){
                min_index = j;
            }
        }
 
        /* a[i]とa[min_index]を交換する */
        tmp = a[i];
        a[i] = a[min_index];
        a[min_index] = tmp;
    }
 
    printf("配列a = ");
    for (i=0; i<N; i++){
        printf("%d ", a[i]);
    }
    printf("\n");
 
    return 0;
}
 

work97.c

#include <stdio.h>
 
#define N 8
 
int main(void){
    int data[N] = {10, 20, 30, 40, 50, 60, 70};
    int i;
    int tmp;
 
    printf("data[%d]: ", N-1);
    scanf("%2d", &data[N-1]);
 
    printf("挿入前: ");
    for (i=0; i<N; i++){
        printf("%d ", data[i]);
    }
    printf("\n");
 
    tmp = data[N-1]; 
    for (i=N-2; i>=0 && tmp<data[i]; i--){
        data[i+1] = data[i];
    }
    data[i+1] = tmp;
 
 
    printf("挿入後: ");
    for (i=0; i<N; i++){
        printf("%d ", data[i]);
    }
    printf("\n");
 
    return 0;
}
 

work98.c

#include <stdio.h>
#define N 10
int main(void){
    int a[N];
    int i, j;
    int tmp;
 
    for (i=0; i<N; i++){
        scanf("%d", &a[i]);
    }
 
    /* 挿入ソート */
    for (i=1; i<N; i++){
        tmp = a[i];
        j=i-1;
        while (j>=0 && tmp<a[j]){
            a[j+1] = a[j];
            j--;
        }
        a[j+1] = tmp;
    }
 
    printf("配列a = ");
    for (i=0; i<N; i++){
        printf("%d ", a[i]);
    }
    printf("\n");
 
    return 0;
}
 

work99.c

#include <stdio.h>
#define N 8
int main(void){
    int a[N][N];  /* N×N行列 */
    int b[N][N];  /* N×N行列 */
    int c[N][N];  /* N×N行列 */
    int i, j;
 
    /* N×N行列の初期設定 */
    for (i=0; i<N; i++){
        for (j=0; j<N; j++){
            a[i][j] = i*N+j;
            b[i][j] = i+j;
        }
    }
 
    /* 行列和の計算 */
    for (i=0; i<N; i++){
        for (j=0; j<N; j++){
            c[i][j] = a[i][j]+b[i][j];
        }
    }
 
    for (i=0; i<N; i++){
        for (j=0; j<N; j++){
            printf("%3d ", c[i][j]);
        }
        printf("\n");
    }
    return 0;
}