Advertisement
Guest User

Untitled

a guest
Mar 30th, 2020
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 1.78 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4. enum {FALSE, TRUE} boolean;
  5.  
  6. typedef enum {WORKING, OUT_OF_ORDER}tFairgroundRideState;
  7.  
  8. struct tFairgroundRide {
  9.     char name[15];
  10.     char areaMap;
  11.     tFairgroundRideState state;
  12.     int averageWaitingTime;
  13. };
  14.  
  15. int main(int argc, char **argv) {
  16.  
  17.     struct tFairgroundRide rides[3];
  18.     char name[15];
  19.     char area;
  20.     tFairgroundRideState state;
  21.     int avgTime;
  22.     //1
  23.     for (int i = 0; i < 3; ++i) {
  24.         printf("\nENTER DATA FOR FAIRGROUND RIDE %d NAME\n", i);
  25.         scanf("%c", name);
  26.         strcpy(rides[i].name, name);
  27.         printf("\nAREA\n");
  28.         scanf("%c", &area);
  29.         rides[i].areaMap = area;
  30.         printf("\nSTATE (0-WORKING, 1-OUT_OF_ORDER)\n");
  31.         scanf("%d", &state);
  32.         rides[i].state = state;
  33.         printf("\nAVERAGE WAITING TIME\n");
  34.         scanf("%d", &avgTime);
  35.         rides[i].averageWaitingTime = avgTime;
  36.     }
  37.    
  38.     //2
  39.     char zone;
  40.     printf("\nTYPE THE MAP AREA YOU ARE LOOKING FOR (A CHARACTER)\n");
  41.     scanf("%c", &zone);
  42.    
  43.     //3
  44.     struct tFairgroundRide temp [3];
  45.     int cont = 0;
  46.     for (int i = 0; i < 3; ++i) {
  47.         if (rides[i].areaMap == zone && rides[i].state == WORKING) {
  48.             temp[i] = rides[i];
  49.             ++cont;
  50.         }  
  51.     }
  52.     printf("\nRESULTS\n");
  53.     if (cont == 0) {
  54.         printf("\nNO RIDES FOUND\n");
  55.     }
  56.     else if (cont == 1) {
  57.         printf("\nNAME: %p", rides[0].name);
  58.         printf("\nAREA: %c", rides[0].areaMap);
  59.         printf("\nAVERAGE WAITING TIME: %d", rides[0].averageWaitingTime);
  60.     }
  61.     else {
  62.         struct tFairgroundRide rides;
  63.         for (int i = 0; i < cont; ++i) {
  64.             //comparar, assignar a ride i mostrar ride
  65.         }
  66.     }
  67.     return 0;
  68.    
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement