TD3_DEV51_daniel_bouzon_lawson/pendu.c

120 lines
3.1 KiB
C
Raw Normal View History

2024-10-14 18:41:58 +02:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
2024-10-14 18:47:11 +02:00
#define MAX_WORDS 14
2024-10-14 18:41:58 +02:00
#define MAX_TRIES 6
const char *words[MAX_WORDS] = {
"programmation",
"ordinateur",
"langage",
"jeu",
2024-10-14 18:47:11 +02:00
"algorithmique",
"fontainebleau",
"koala",
"anticonstitutionnellement",
"code",
"canard",
"gyroscope",
"periclitation",
"susurrer",
2024-10-16 18:05:29 +02:00
"ecclesiastique",
"test",
"oui",
"non"
2024-10-14 18:41:58 +02:00
};
void display_hangman(int tries) {
switch (tries) {
case 0: printf(" ----\n | |\n |\n |\n |\n |\n--------\n"); break;
case 1: printf(" ----\n | |\n | O\n |\n |\n |\n--------\n"); break;
case 2: printf(" ----\n | |\n | O\n | |\n |\n |\n--------\n"); break;
case 3: printf(" ----\n | |\n | O\n | /|\n |\n |\n--------\n"); break;
case 4: printf(" ----\n | |\n | O\n | /|\\\n |\n |\n--------\n"); break;
case 5: printf(" ----\n | |\n | O\n | /|\\\n | /\n |\n--------\n"); break;
case 6: printf(" ----\n | |\n | O\n | /|\\\n | / \\\n |\n--------\n"); break;
}
}
2024-10-16 18:05:29 +02:00
// Fonction pour choisir des mots jusqu'à atteindre la longueur demandée
2024-10-15 11:47:35 +02:00
char *hidden_word(int length_choice) {
2024-10-14 18:41:58 +02:00
srand(time(NULL));
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
char *total_word = malloc((length_choice + 1) * sizeof(char));
total_word[0] = '\0';
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
int total_length = 0;
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
while (total_length < length_choice) {
const char *word = words[rand() % MAX_WORDS];
int word_length = strlen(word);
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
if (total_length + word_length <= length_choice) {
if (total_length > 0) {
strcat(total_word, " ");
total_length++;
}
strcat(total_word, word);
total_length += word_length;
}
}
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
return total_word;
2024-10-15 11:47:35 +02:00
}
int main() {
2024-10-16 18:05:29 +02:00
int length_choice;
2024-10-15 11:47:35 +02:00
printf("Entrez la difficulté (Taille maximum du mot à deviner) : ");
2024-10-16 18:05:29 +02:00
scanf("%d", &length_choice);
2024-10-15 11:47:35 +02:00
char *word = hidden_word(length_choice);
2024-10-14 18:41:58 +02:00
int word_length = strlen(word);
2024-10-15 11:47:35 +02:00
2024-10-16 18:05:29 +02:00
char guessed[word_length + 1];
2024-10-14 18:41:58 +02:00
int tries = 0;
int guessed_correctly = 0;
2024-10-15 11:47:35 +02:00
2024-10-14 18:41:58 +02:00
for (int i = 0; i < word_length; i++) {
2024-10-16 18:05:29 +02:00
guessed[i] = (word[i] == ' ') ? ' ' : '_';
2024-10-14 18:41:58 +02:00
}
guessed[word_length] = '\0';
while (tries < MAX_TRIES && guessed_correctly < word_length) {
printf("\nMot à deviner : %s\n", guessed);
display_hangman(tries);
2024-10-16 18:05:29 +02:00
2024-10-14 18:41:58 +02:00
char guess;
printf("Entrez une lettre : ");
scanf(" %c", &guess);
2024-10-16 18:05:29 +02:00
int found = 0;
2024-10-14 18:41:58 +02:00
for (int i = 0; i < word_length; i++) {
2024-10-16 18:05:29 +02:00
if (word[i] == guess && guessed[i] == '_') {
guessed[i] = guess;
guessed_correctly++;
2024-10-14 18:41:58 +02:00
found = 1;
}
}
2024-10-16 18:05:29 +02:00
2024-10-14 18:41:58 +02:00
if (!found) {
tries++;
}
}
if (guessed_correctly == word_length) {
printf("Félicitations ! Vous avez deviné le mot : %s\n", word);
} else {
printf("Désolé, vous avez perdu. Le mot était : %s\n", word);
display_hangman(MAX_TRIES);
}
2024-10-16 18:05:29 +02:00
free(word);
2024-10-14 18:41:58 +02:00
return 0;
}