C-s Bead most

#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h> // for open()
#include <errno.h> // for perror()
#include <sys/types.h>
#include <sys/stat.h>
#include <string.h> //for strcpy()
#include <unistd.h> //for file write()
#include <time.h>

struct Kivansag {
  char date[100];
  char name[100];
  char city[100];
  char address[100];
  char gift[100];
};

const char *FILE_NAME = "kivansagok";

int isCorrect(char *answer);
int isGift(char *choice);

int main(){ //23
  int list_size = 0;
  FILE *list;
  FILE *fileContents;
  struct Kivansag gifts[1000];

    time_t     now;
    struct tm *ts;
    char       buf[100];

    //current time
    now = time(NULL);

    //Format and print the time, "ddd yyyy-mm-dd hh:mm:ss zzz" */
    ts = localtime(&now);
    strftime(buf, sizeof(buf), "%Y-%m-%d %H:%M:%S (%a)", ts);

  if((fileContents= fopen(FILE_NAME, "rb")) == NULL){
    if(errno == ENOENT){//if "kivansagok" file doesn't exists
      printf("A file megnem letezik! Letrehozas...\n");
      list = fopen(FILE_NAME,"wb");
      fwrite(&list_size, sizeof(list_size),1,list);
      fclose(list);
    }else{
      printf("Valami nagy hiba tortent! \n");
      exit(1);
    }
    }else{
    fread(&list_size, sizeof(list_size),1,fileContents);
    if(list_size > 0){
        int i;



        for(i = 0; i < list_size; i++){
          struct Kivansag kivansag;
          fread(&kivansag, sizeof(kivansag),1,fileContents);
          gifts[i] = kivansag;
        }

    }
    fclose(fileContents);


      char answer[10];
      int check = 0;
      do{

        printf("\n*********************************************************\n");
        printf("Udv a Mikulas kivansag kezelojen! Az alabbiak kozul valaszthat:\n"
        "  (1) Uj kivansag felvete (Regit felulirja ! )\n"
        "  (2) Kivansagok listazasa\n"
        "  (3) Szures adott varosra\n"
        "  (4) Szures adott ajandekra\n"
        "  (5) Kilepes\n");
        fgets(answer,10, stdin);

        check = isCorrect(answer);

        if(check < 1 || check > 5){
          printf("\nHibas adatbevitel!\n");
        }else{
          if(check == 1){
            int volt_e = 0;
            int position = 0;
            struct Kivansag kivansag;

            strcpy(kivansag.date,buf);

            printf("Kerem adja meg a nevet!\n");
            fgets(kivansag.name,sizeof(kivansag.name),stdin);
            char *pos;
            if ((pos=strchr(kivansag.name, '\n')) != NULL)
                *pos = '\0';

            int i;
            for(i = 0; i < list_size; i++){
               if(strcmp(kivansag.name,gifts[i].name)==0){
                   volt_e = 1;
                   position = i;
               }
            }


            printf("Kerem adja meg a varosat!\n");
            fgets(kivansag.city,sizeof(kivansag.city),stdin);
            if ((pos=strchr(kivansag.city, '\n')) != NULL)
                *pos = '\0';

            printf("Kerem adja meg a pontos cimet!\n");
            fgets(kivansag.address,sizeof(kivansag.address),stdin);
            if ((pos=strchr(kivansag.address, '\n')) != NULL)
                *pos = '\0';

            char choice[10];
            printf("Kerem valasszon ajandekot!\n"
              "  (1) baba\n"
              "  (2) auto\n"
              "  (3) labda\n"
              "  (4) kirako\n"
              "  (5) szinezo\n"
              "  (6) konyv\n");
            fgets(choice, 10, stdin);
            int result = isGift(choice);
            while(result == -1){
                printf("Kerem valasszon ajandekot!\n"
                  "  (1) baba\n"
                  "  (2) auto\n"
                  "  (3) labda\n"
                  "  (4) kirako\n"
                  "  (5) szinezo\n"
                  "  (6) konyv\n"
                );
                fgets(choice, 10, stdin);
                result = isGift(choice);
            }
            switch(result){
              case 1:
                strcpy(kivansag.gift,"baba");
                break;
              case 2:
                strcpy(kivansag.gift,"auto");
                break;
              case 3:
                strcpy(kivansag.gift,"labda");
                break;
              case 4:
                strcpy(kivansag.gift,"kirako");
                break;
              case 5:
                strcpy(kivansag.gift,"szinezo");
                break;
              case 6:
                strcpy(kivansag.gift,"konyv");
                break;
              default:
                printf("\nvalami hiba lesz itt\n");
                break;
            }
            if(volt_e == 1){
               gifts[position]= kivansag;
                list = fopen(FILE_NAME, "wb");
                fwrite(&list_size, sizeof(list_size),1,list);
                fwrite(&gifts, sizeof(gifts),1,list);
                fclose(list);
            }else{
                ++list_size;
                gifts[list_size-1] = kivansag;
                //printf("teszt: %s", gifts[0].name);
                list = fopen(FILE_NAME, "wb");
                fwrite(&list_size, sizeof(list_size),1,list);
                fwrite(&gifts, sizeof(gifts),1,list);
                fclose(list);
            }
          }
          if(check == 2){
            list = fopen(FILE_NAME, "rb");
            fread(&list_size, sizeof(list_size),1,list);
            fread(&gifts, sizeof(gifts), 1,list);
            int i;
            printf("\n");
            for(i = 0; i < list_size; i++){
               printf("Datum: %s Nev: %s Varos: %s Pontos cim: %s Ajandek: %s\n",gifts[i].date,gifts[i].name,gifts[i].city,gifts[i].address,gifts[i].gift);
            }
            printf("Listaelemek szama: %d\n",list_size);
          }
          if(check == 3){
            char answer[100];
            printf("Adja meg a listazando varos nevet!\n");
            fgets(answer, 100, stdin);
            char *pos;
            if ((pos=strchr(answer, '\n')) != NULL)
                *pos = '\0';

            struct Kivansag subList[1000];
            int count = 0;
            int i;
            for(i = 0; i < list_size; i++){
               if(strcmp(gifts[i].city,answer) == 0){
                 subList[count] = gifts[i];
                 ++count;
               }
            }
            if(count > 0){
                printf("\n");
                for(i = 0; i < count; i++){
                   printf("Datum: %s Nev: %s Varos: %s Pontos cim: %s Ajandek: %s\n",subList[i].date,subList[i].name,subList[i].city,subList[i].address,subList[i].gift);
                }
                printf("Szurt listaelemek szama: %d\n",count);
            }else{
                printf("Nem talaltam ilyen varost!\n");
            }
          }
          if(check == 4){
            char answer[100];
            printf("Adja meg a listazando ajandek nevet!\n");
            fgets(answer, 100, stdin);
            char *pos;
            if ((pos=strchr(answer, '\n')) != NULL)
                *pos = '\0';

            struct Kivansag subList[1000];
            int count = 0;
            int i;
            for(i = 0; i < list_size; i++){
               if(strcmp(gifts[i].gift,answer) == 0){
                 subList[count] = gifts[i];
                 ++count;
               }
            }
            if(count > 0){
                printf("\n");
                for(i = 0; i < count; i++){
                   printf("Datum: %s Nev: %s Varos: %s Pontos cim: %s Ajandek: %s\n",subList[i].date,subList[i].name,subList[i].city,subList[i].address,subList[i].gift);
                }
                printf("Szurt listaelemek szama: %d\n",count);
            }else{
                printf("Nem talaltam ilyen ajandekot!\n");
            }


          }
        }
      } while(check != 5);

}



  return 0;
}//30

int isCorrect(char answer[10]){
   if(*answer >48 && *answer < 54){
     if(*answer == 49) return 1;
     if(*answer == 50) return 2;
     if(*answer == 51) return 3;
     if(*answer == 52) return 4;
     if(*answer == 53) return 5;
   }

   return -1;
}

int isGift(char answer[10]){
   if(*answer >48 && *answer < 55){
     if(*answer == 49) return 1;
     if(*answer == 50) return 2;
     if(*answer == 51) return 3;
     if(*answer == 52) return 4;
     if(*answer == 53) return 5;
     if(*answer == 54) return 6;
   }

   return -1;
}