#include <cstdio>
#include <cstring>

using namespace std;

#define FAIL(str)                                                              \
  {                                                                            \
    puts(str);                                                                 \
    return 1;                                                                  \
  }

#define SCORE_NUM 5
#define GROUP_TO_DELETE "BIV180"
#define NEEDS_AVG_SCORE

// Why is it so bad? Read more about data aligment
struct person {
  char *familia;
  char *name;
  char *otchestvo;
};

struct scores {
  unsigned char B[SCORE_NUM];
#ifdef NEEDS_AVG_SCORE
  float average;
#endif
};

struct stud{
  person fio;
  char *group;
  scores uspevaemost;
} student;

struct element {
  element *next;
  element *prev;
  stud student;
};

bool nendof(FILE *fl) {
  size_t addr = ftell(fl);
  bool res = (fgetc(fl) != EOF) && (fgetc(fl) != EOF);
  fseek(fl, addr, 0);
  return res;
}

element *input() {
  puts("Input file name:");
  char *file_name;
  scanf("%ms", &file_name);
  FILE *fl = fopen(file_name, "r");
  delete (file_name);
  if (fl == NULL) {
    perror("Failed: couldn't open the file");
    return NULL;
  }
  element *current;
  element *prev = NULL;
  do {
    current = new element();
    current->prev = prev;
    // Read fio
    fscanf(fl, "%ms", &current->student.fio.familia);
    fscanf(fl, "%ms", &current->student.fio.name);
    fscanf(fl, "%ms", &current->student.fio.otchestvo);
    // Read group (most important in my case)
    fscanf(fl, "%ms", &current->student.group);
    // Read scores and sum them up
    #ifdef NEEDS_AVG_SCORE
    float sum = 0;
    #endif
    for (unsigned char i = 0; i < SCORE_NUM; i++) {
      fscanf(fl, "%hhu", &current->student.uspevaemost.B[i]);
      #ifdef NEEDS_AVG_SCORE
      sum += current->student.uspevaemost.B[i];
      #endif
    }
    #ifdef NEEDS_AVG_SCORE
    // Find an average(mean) value
    current->student.uspevaemost.average = sum / SCORE_NUM;
    #endif
    // Set the next element for the previous one
    if (prev)
      prev->next = current;
    prev = current;
  } while (nendof(fl));
  fclose(fl);
  return current;
}

void element_destructor(element *el) {
  delete (el->student.fio.familia);
  delete (el->student.fio.name);
  delete (el->student.fio.otchestvo);
  delete (el->student.group);
  delete (el);
}

void output(element *head) {
  const char file_name[] = "out.txt"; // Output file
  FILE *fl = fopen(file_name, "w");
  // find the first element
  element *first;
  for (first = head; first->prev; first = first->prev)
    ;
  // Print elements one by one
  for (element *cur = first; cur; cur = cur->next) {
    fprintf(fl, "%s\n", cur->student.fio.familia);
    fprintf(fl, "%s\n", cur->student.fio.name);
    fprintf(fl, "%s\n", cur->student.fio.otchestvo);
    fprintf(fl, "%s\n", cur->student.group);
    for (unsigned char i = 0; i < SCORE_NUM; i++)
      fprintf(fl, " %hhu", cur->student.uspevaemost.B[i]);
    fputc('\n', fl);
  };
  fclose(fl);
}

#if 0
unsigned char process(element *&head) {
  // The function returns amount of deleted elements (not more then 255)
  unsigned char elements = 0;
  element *el = head;
  while (el) {
    if (strcmp(el->student.group, GROUP_TO_DELETE)) {
      el = el->prev;
    } else { // delete element
      if (el->prev)
        el->prev->next = el->next; // Previous element to point on the next one
      if (el->next)
        el->next->prev = el->prev; // Next element to point on the previous one
      if (el == head)
        head = el->prev;
      element *tmp_ptr;
      tmp_ptr = el;
      el = el->prev;
      element_destructor(tmp_ptr);
      elements++;
    }
  }
  return elements;
}
#endif

unsigned char countten(element *el){
    //WORKS FOR SURE
    int n = 0;
    for (int i = 0; i < SCORE_NUM; i++)
        if (el->student.uspevaemost.B[i] == 10) n++;
    return n;
}

inline void swap(element*& r, element* &i){
    stud tmp = r->student;
    r->student = i->student;
    i->student = tmp;
}

bool process(element *&head) {
    bool res = false;
    for(element *i = head; i; i=i->prev)
    {
        for(element *r = head; r->prev && r->prev != i; r = r->prev)
        {
            if(countten(r) < countten(r->prev))
            {
                // Обмен местами
                swap(r, r->prev);
                res = true;
            }
        }
    }
    return  res;
    //swap(head->prev,head->prev->prev);

    return 1;
}

int main() {
  element *data = input();
  if (!data)
    FAIL("Quiting now.");
  if (!process(data))
    FAIL("Nothing to delete");
  if (data)
    output(data);
  else
    FAIL("Nothing left");
  return 0;
}