Вычислить суммарную оценку фигуристов и найти победителя - C (СИ) - Ответ 983793

/* Output from p2c 1.21alpha-07.Dec.93, the Pascal-to-C translator */
/* From input file "p2c.pas" */
 
 
#include <p2c/p2c.h>
 
 
#define n               10
 
 
typedef struct rec {
  Char name[256], str[256];
  long oc1, oc2, sum;
} rec;
 
 
main(argc, argv)
int argc;
Char *argv[];
{
  rec x[n];
  long i;
  long max = -1;
  Char k[256];
 
  PASCAL_MAIN(argc, argv);
  clrscr();
  for (i = 1; i <= n; i++) {
    printf(" \320\230\320\274\321\217: ");
    gets(x[i-1].name);
/* p2c: p2c.pas, line 18: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 18:
 * Note: WRITE statement contains color/attribute characters [203] */
    printf(" \320\241\321\202\321\200\320\260\320\275\320\260: ");
    gets(x[i-1].str);
/* p2c: p2c.pas, line 20: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 20:
 * Note: WRITE statement contains color/attribute characters [203] */
    printf(" \320\236\321\206\320\265\320\275\320\272\320\2601: ");
    scanf("%ld%*[^\n]", &x[i-1].oc1);
    getchar();
/* p2c: p2c.pas, line 22: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 22:
 * Note: WRITE statement contains color/attribute characters [203] */
    printf(" \320\236\321\206\320\265\320\275\320\272\320\2602: ");
    scanf("%ld%*[^\n]", &x[i-1].oc2);
    getchar();
  }
/* p2c: p2c.pas, line 16: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 16:
 * Note: WRITE statement contains color/attribute characters [203] */
  printf("Table: \n");
  for (i = 1; i <= n; i++)
    x[i-1].sum += x[i-1].oc1 + x[i-1].oc2;
/* p2c: p2c.pas, line 28: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 28:
 * Note: WRITE statement contains color/attribute characters [203] */
  printf(
    "|  \320\230\320\274\321\217  |  \320\241\321\202\321\200\320\260\320\275\320\260  | \320\236\321\206\320\265\320\275\320\272\320\2601 | \320\236\321\206\320\265\320\275\320\272\320\2602 | \320\241\321\203\320\274 |\n");
  for (i = 1; i <= n; i++)
    printf("|%8s|%11s|%8ld|%7ld|%6ld|\n",
       x[i-1].name, x[i-1].str, x[i-1].oc1, x[i-1].oc2, x[i-1].sum);
  for (i = 1; i <= n; i++) {
    if (x[i-1].sum > max) {
      max = x[i-1].sum;
      strcpy(k, x[i-1].name);
    }
  }
/* p2c: p2c.pas, line 39: Note: Characters >= 128 encountered [281] */
/* p2c: p2c.pas, line 39:
 * Note: WRITE statement contains color/attribute characters [203] */
  printf(
    " \320\237\320\276\320\261\320\265\320\264\320\270\321\202\320\265\320\273\321\214: %s\n",
    k);
  scanf("%*[^\n]");
  getchar();
  exit(EXIT_SUCCESS);
}
 
 
 
/* End. */