基本情報技術者試験 C言語問題のソースコード（平成２８年 秋期 ）

#include <stdio.h>
#include <string.h>

#define NUM_JOB 5

typedef struct {
  char pr_code[9];
  int job_term;
  int target_term;
} JOB;

void job_scheduling(int, JOB[], int[]);
void print_schedule(int, JOB[], int[]);

void job_scheduling(int num_s, JOB job[num_s], int job_sch[num_s]) {
  int ft, ft_a, ft_b, wt_a, wt_b, job_no, i, j;

  for (i = 0; i < num_s; i++) {
    job_sch[i] = i;
  }

  ft = 0;
  i = 0;
  while (i < num_s - 1) {
    ft_a = ft;
    ft_b = ft;
    wt_a = 0;
    wt_b = 0;
    for (j = 0; j < 2; j++) {
      ft_a += job[job_sch[i + j]].job_term;
      if (ft_a > job[job_sch[i + j]].target_term) {
        wt_a += ft_a - job[job_sch[i + j]].target_term;
      }
      /* 設問１の[a] */
      ft_b += job[job_sch[i - j + 1]].job_term;
      if (ft_b > job[job_sch[i - j + 1]].target_term) {
        wt_b += ft_b - job[job_sch[i - j + 1]].target_term;
      }
    }

    if (wt_a > wt_b) {
      job_no = job_sch[i];
      /* 設問１の[b] */
      job_sch[i] = job_sch[i + 1];
      job_sch[i + 1] = job_no;
      if (i > 0) {
        /* 設問１の[c] */
        ft -= job[job_sch[--i]].job_term;
      }
    } else {
      /* 設問１の[d] */
      ft += job[job_sch[i++]].job_term;
    }
  }
}

void print_schedule(int num_s, JOB job[num_s], int job_sch[num_s]) {
  int ft, wt, wt_sum, i;

  ft = 0;
  wt_sum = 0;
  for (i = 0; i < num_s; i++) {
    ft += job[job_sch[i]].job_term;
    if (ft > job[job_sch[i]].target_term) {
      wt = ft - job[job_sch[i]].target_term;
      wt_sum += wt;
    } else {
      wt = 0;
    }
    printf("%3d %10s %10d %10d\n",
      i + 1, job[job_sch[i]].pr_code, wt, wt_sum);
  }
}

int main(void) {
  JOB job[NUM_JOB];
  int job_sch[NUM_JOB];
  int i;

  /* 図１の対象サブシステム情報を格納 */
  strcpy(job[0].pr_code, "APL12339");
  job[0].job_term = 25;
  job[0].target_term = 27;

  strcpy(job[1].pr_code, "GGL08001");
  job[1].job_term = 27;
  job[1].target_term = 29;

  strcpy(job[2].pr_code, "MSO16101");
  job[2].job_term = 21;
  job[2].target_term = 30;

  strcpy(job[3].pr_code, "CAN03022");
  job[3].job_term = 28;
  job[3].target_term = 77;

  strcpy(job[4].pr_code, "ORA14031");
  job[4].job_term = 12;
  job[4].target_term = 93;

  job_scheduling(NUM_JOB, job, job_sch);

  printf("job_scheduling実行後の作業順序\n");
  for (i = 0; i < NUM_JOB; i++) {
    printf("  job_sch[%d] : %d\n", i, job_sch[i]);
  }
  printf("\n");

  print_schedule(NUM_JOB, job, job_sch);
}