Compare commits
2 Commits
master
...
dev-schied
| Author | SHA1 | Date | |
|---|---|---|---|
| 509db16917 | |||
| 2fd6561591 |
BIN
TD3 - DEV5.1.pdf
BIN
TD3 - DEV5.1.pdf
Binary file not shown.
122
pendu.c
Normal file
122
pendu.c
Normal file
@@ -0,0 +1,122 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
|
||||
#define MAX_WORDS 14
|
||||
#define MAX_TRIES 6
|
||||
|
||||
const char *words[MAX_WORDS] = {
|
||||
"programmation",
|
||||
"ordinateur",
|
||||
"langage",
|
||||
"jeu",
|
||||
"algorithmique",
|
||||
"fontainebleau",
|
||||
"koala",
|
||||
"anticonstitutionnellement",
|
||||
"code",
|
||||
"canard",
|
||||
"gyroscope",
|
||||
"periclitation",
|
||||
"susurrer",
|
||||
"eclesiastique"
|
||||
};
|
||||
|
||||
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;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
getWordByLength() function adds the possibility to the user to choose how many letters maximum the word to guess can contains.
|
||||
|
||||
Returns:
|
||||
A random word from the words list that correspond to the user input
|
||||
*/
|
||||
const char* getWordByLength(){
|
||||
int maxLetters;
|
||||
printf("Difficulté - Entrez le nombre de lettres maximum à deviner : ");
|
||||
scanf(" %d", &maxLetters);
|
||||
const char *newWords[MAX_WORDS];
|
||||
int wordsFound = 0;
|
||||
for (int i = 0; i < MAX_WORDS; i++) {
|
||||
if(strlen(words[i]) <= maxLetters){
|
||||
newWords[wordsFound] = words[i];
|
||||
wordsFound++;
|
||||
}
|
||||
}
|
||||
if(wordsFound==0){
|
||||
return "";
|
||||
}
|
||||
const char *word = newWords[rand() % wordsFound];
|
||||
/* SECOND WORD TO GUESS (NOT WORKING)
|
||||
wordsFound = 0;
|
||||
for (int i = 0; i < MAX_WORDS; i++) {
|
||||
if(strlen(words[i]) <= maxLetters-strlen(word)){
|
||||
newWords[wordsFound] = words[i];
|
||||
wordsFound++;
|
||||
}
|
||||
}
|
||||
if(wordsFound != 0){
|
||||
word = (const char*) strcat((char *) word, newWords[rand() % wordsFound]);
|
||||
}*/
|
||||
return word;
|
||||
}
|
||||
|
||||
int main() {
|
||||
srand(time(NULL));
|
||||
const char *word = getWordByLength();
|
||||
if(word==""){
|
||||
printf("Aucun mot n'a été trouvé.");
|
||||
return 1;
|
||||
}
|
||||
int word_length = strlen(word);
|
||||
char guessed[word_length];
|
||||
int tries = 0;
|
||||
int guessed_correctly = 0;
|
||||
|
||||
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;
|
||||
}
|
||||
Reference in New Issue
Block a user