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-15 11:47:35 +02:00
|
|
|
"eclesiastique",
|
|
|
|
"de",
|
|
|
|
"a"
|
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-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
|
|
|
char word = words[rand() % MAX_WORDS];
|
|
|
|
int word_length = strlen(word);
|
|
|
|
int stay_length = length_choice;
|
|
|
|
char *total_word;
|
|
|
|
int number_of_word = 0;
|
|
|
|
int total_length = word_length;
|
|
|
|
|
|
|
|
for(int y=0; word_length > length_choice; y++){
|
|
|
|
word = *words[rand() % MAX_WORDS];
|
|
|
|
word_length = strlen(word);
|
|
|
|
}
|
|
|
|
|
|
|
|
total_word = word;
|
|
|
|
|
|
|
|
for(int y=0; word_length > stay_length; y++){
|
|
|
|
|
|
|
|
word = *words[rand() % MAX_WORDS];
|
|
|
|
word_length = strlen(total_word);
|
|
|
|
|
|
|
|
if(stay_length >= word_length){
|
|
|
|
total_word = word +'\0'+ *total_word;
|
|
|
|
total_length = strlen(total_word);
|
|
|
|
stay_length = total_length - length_choice;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
return total_word;
|
|
|
|
}
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
int length_choice = 26;
|
|
|
|
printf("Entrez la difficulté (Taille maximum du mot à deviner) : ");
|
|
|
|
scanf(" %d", &length_choice);
|
|
|
|
|
|
|
|
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-14 18:41:58 +02:00
|
|
|
char guessed[word_length];
|
|
|
|
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++) {
|
|
|
|
guessed[i] = '_';
|
|
|
|
}
|
|
|
|
guessed[word_length] = '\0';
|
|
|
|
|
|
|
|
while (tries < MAX_TRIES && guessed_correctly < word_length) {
|
|
|
|
printf("\nMot à deviner : %s\n", guessed);
|
|
|
|
display_hangman(tries);
|
|
|
|
char guess;
|
|
|
|
printf("Entrez une lettre : ");
|
|
|
|
scanf(" %c", &guess);
|
|
|
|
int found = 0;
|
|
|
|
|
|
|
|
for (int i = 0; i < word_length; i++) {
|
|
|
|
if (word[i] == guess) {
|
|
|
|
if (guessed[i] == '_') {
|
|
|
|
guessed[i] = guess;
|
|
|
|
guessed_correctly++;
|
|
|
|
}
|
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|