// authros are: Kirk Steuber, Zhenis Otarbay #include #include #include // Macros #define TRUE 1 #define FALSE 0 #define CODE_LENGTH 4 #define BUFFER_SIZE 256 #define MATCHED_CHAR '0' #define MISMATCHED_CHAR '_' #define UNMATCHED_CHAR 'X' // Stringification of macros. See https://gcc.gnu.org/onlinedocs/cpp/Stringification.html #define MACRO_STR(s) MACRO_NAME(s) #define MACRO_NAME(s) #s // Function prototypes void get_input(int guesses[CODE_LENGTH]); int print_feedback(int guesses[CODE_LENGTH], int codes[CODE_LENGTH], int preserve_order); int digit_in_guess(int digit, int guesses[CODE_LENGTH]); int i; int main(void) { // Seed the Random Number Generator so we don't get the same random numbers every time srand(time(NULL)); // Set to FALSE for the feedback printed to be in a sorted order instead of in the code order // This could potentially be made into a gameplay option rather than being hardcoded like this int preserve_order = TRUE; int guesses[CODE_LENGTH]; int codes[CODE_LENGTH]; // Pick CODE_LENGTH random numbers for ( i= 0; i < CODE_LENGTH; ++i) codes[i] = rand() % 10; // Just for testing, it is nice to know what the random number is for ( i = 0; i < CODE_LENGTH; ++i) printf("%d", codes[i]); printf("\n"); int user_won; do { get_input(guesses); user_won = print_feedback(guesses, codes, preserve_order); } while (!user_won); printf("\nCORRECT! The code was: "); for ( i = 0; i < CODE_LENGTH; ++i) printf("%d", codes[i]); printf("\n"); return EXIT_SUCCESS; } // Gets the user's input and returns if via the argument // This can be done, even with pass-by-value, since the POINTER to the array will be passed in. // This function modifies the data that the pointer points to (rather than the pointer itself). // When the function returns, the data at the location pointed to will be the user input void get_input(int guesses[CODE_LENGTH]) { int numbers_read; char buffer[BUFFER_SIZE]; // Keep asking for input until valid input is given do { printf("Guess the code\n> "); // Read 1 line of input, then find the integers in it fgets(buffer, BUFFER_SIZE, stdin); if (feof(stdin) || ferror(stdin)) exit(EXIT_FAILURE); numbers_read = 0; for ( i = 0; i < BUFFER_SIZE; ++i) { char c = buffer[i]; // If we hit the end of what we read in, or if we have found enough integers, stop reading the string if (c == '\0' || numbers_read == CODE_LENGTH) break; // If c is a valid numeric digit if (c >= '0' && c <= '9') { // By using character subtraction, we can get the numeric value of the digit // This works because ASCII digits are consecutive and sorted. // Example: '1' - '0' == 49 - 48 == 1 guesses[numbers_read] = c - '0'; ++numbers_read; } } if (numbers_read != CODE_LENGTH) printf("Invalid input. Please enter a string with " MACRO_STR(CODE_LENGTH) " integers\n"); } while (numbers_read != CODE_LENGTH); // For testing, make sure reading and number conversion succeeded as expected //printf("You entered: "); //for (int i = 0; i < CODE_LENGTH; ++i) // printf("%d ", guesses[i]); //printf("\n"); return; } // Prints the feedback based on the guesses and the actual code. Feedback is consists of 1 character // for each digit of the correct code. This character will be // 0 - If the digit of the code was guessed at this position // _ - If the digit of the code was guessed, but was not guessed at this position // X - If the digit of the code was not guessed // If preserve_order does not evaluate to true, the feedback characters will be printed with the 0's first, // then the _'s, then the X's rather than in the order of the code. // The process of printing feedback WILL CHANGE THE GUESSES ARRAY. guesses are set to an invalid number (-1) // once they have been matched to something // Returns TRUE (macro) if guess matches the code exactly, otherwise FALSE (macro) int print_feedback(int guesses[CODE_LENGTH], int codes[CODE_LENGTH], int preserve_order) { int correct_count = 0; int mismatch_count = 0; int unguessed_count = 0; char output[CODE_LENGTH]; for ( i = 0; i < CODE_LENGTH; ++i) output[i] = UNMATCHED_CHAR; // First, find the exact matches for ( i = 0; i < CODE_LENGTH; ++i) { if (codes[i] == guesses[i]) { ++correct_count; output[i] = MATCHED_CHAR; guesses[i] = -1; } } // Next find mismatches for ( i = 0; i < CODE_LENGTH; ++i) { // Don't test code digits that have already been matched if (output[i] == UNMATCHED_CHAR) { int index = digit_in_guess(codes[i], guesses); if (index != -1) { ++mismatch_count; output[i] = MISMATCHED_CHAR; guesses[index] = -1; } } } if (preserve_order) { for ( i = 0; i < CODE_LENGTH; ++i) printf("%c", output[i]); } else { for ( i = 0; i < correct_count; ++i) printf("%c", MATCHED_CHAR); for ( i = 0; i < mismatch_count; ++i) printf("%c", MISMATCHED_CHAR); for ( i = 0; i < unguessed_count; ++i) printf("%c", UNMATCHED_CHAR); } printf("\n"); if (correct_count == CODE_LENGTH) return TRUE; else return FALSE; } // Returns the index of the first matching guess digit that matches the digit given or -1 // if there is no match int digit_in_guess(int digit, int guesses[CODE_LENGTH]) { // For each digit, if they match, the digit is in the guess. If we check all digits without // finding a match, the digit was not in the guess. for ( i = 0; i < CODE_LENGTH; ++i) { if (digit == guesses[i]) return i; } return -1; }

Number guessing game