TD3_DEV51_rocherl_schied_la.../pendu.c

200 lines
5.4 KiB
C
Raw Permalink Normal View History

2024-10-15 11:32:43 +02:00
#include <signal.h>
2024-10-14 18:41:58 +02:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
2024-10-15 11:32:43 +02:00
#include <unistd.h>
2024-10-14 18:41:58 +02:00
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",
"eclesiastique"
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:33:30 +02:00
/*
2024-10-15 12:01:14 +02:00
this function allow to save the last party
2024-10-15 11:33:30 +02:00
Parameters:
status -> state that save if the gamer win or lose the party
good_word -> the word to guess
2024-10-25 18:43:33 +02:00
try -> the wrong letters try by the gamer
cpt_try -> the try's table size
good_try -> the good letters try by the gamer
cpt_good_try -> the good_try's table size
2024-10-15 11:33:30 +02:00
*/
2024-10-25 18:43:33 +02:00
void save_party(char * status, const char * good_word, char try[], int cpt_try, char good_try[], int cpt_good_try) {
2024-10-15 11:33:30 +02:00
time_t t;
time(&t); //stock the current time
char * date;
date = ctime(&t); //stock the current time format as: day, month, number of the month, hour, year
2024-10-25 22:35:10 +02:00
FILE* fichier = fopen("save_party.txt", "a");
2024-10-15 11:33:30 +02:00
if (fichier != NULL)
{
fputs("Date and time: ", fichier);
fputs(date,fichier);
fputs("Status: ", fichier);
fputs(status,fichier);
fputs("\n",fichier);
fputs("Good word: ", fichier);
fputs(good_word,fichier);
fputs("\n",fichier);
2024-10-15 12:01:14 +02:00
fputs("tried letters: ", fichier);
2024-10-25 18:43:33 +02:00
for (int i = 0; i < cpt_try; i++) {
2024-10-15 12:01:14 +02:00
fputc(try[i],fichier);
2024-10-15 11:33:30 +02:00
}
2024-10-15 12:01:14 +02:00
fputs("\n",fichier);
2024-10-25 18:43:33 +02:00
fputs("guessed letters: ", fichier);
for (int i = 0; i < cpt_good_try; i++) {
fputc(good_try[i],fichier);
}
fputs("\n",fichier);
2024-10-25 22:35:10 +02:00
fputs("\n",fichier);
2024-10-15 11:33:30 +02:00
2024-10-25 18:43:33 +02:00
fclose(fichier); // Close the opened file
2024-10-15 11:33:30 +02:00
}
2024-10-23 21:32:59 +02:00
}
2024-10-15 11:33:30 +02:00
2024-10-15 12:01:02 +02:00
/* this function display time out when user does nothing during 30s and verify signal*/
void sig_handler(int signum){
if (signum == SIGALRM){
printf("\ntime out\n");
exit (1);
}
2024-10-23 21:32:59 +02:00
}
2024-10-15 11:59:29 +02:00
/*
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
*/
2024-10-15 11:32:49 +02:00
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;
2024-10-15 11:33:30 +02:00
}
2024-10-14 18:41:58 +02:00
int main() {
srand(time(NULL));
2024-10-15 11:32:49 +02:00
const char *word = getWordByLength();
if(word==""){
printf("Aucun mot n'a été trouvé.");
return 1;
}
2024-10-14 18:41:58 +02:00
int word_length = strlen(word);
char guessed[word_length];
int tries = 0;
int guessed_correctly = 0;
2024-10-25 18:43:33 +02:00
char try[MAX_TRIES]; //save the carcater false
char good_try[word_length]; //save the carcater good
int cpt = 0;
2024-10-14 18:41:58 +02:00
2024-10-15 11:32:43 +02:00
signal(SIGALRM,sig_handler);
2024-10-15 12:27:04 +02:00
signal(SIGALRM,sig_handler);
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) {
2024-10-15 11:32:43 +02:00
2024-10-14 18:41:58 +02:00
printf("\nMot à deviner : %s\n", guessed);
display_hangman(tries);
char guess;
2024-10-15 11:32:43 +02:00
alarm(30);
2024-10-14 18:41:58 +02:00
printf("Entrez une lettre : ");
2024-10-15 11:32:43 +02:00
alarm(30);
2024-10-14 18:41:58 +02:00
scanf(" %c", &guess);
2024-10-15 12:01:14 +02:00
2024-10-15 11:33:30 +02:00
2024-10-14 18:41:58 +02:00
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) {
2024-10-15 12:01:14 +02:00
try[tries] = guess;
2024-10-14 18:41:58 +02:00
tries++;
2024-10-25 18:43:33 +02:00
}else{
good_try[cpt] = guess;
cpt++;
2024-10-14 18:41:58 +02:00
}
}
if (guessed_correctly == word_length) {
printf("Félicitations ! Vous avez deviné le mot : %s\n", word);
2024-10-25 18:43:33 +02:00
save_party("Win", word, try, tries, good_try, cpt);
2024-10-14 18:41:58 +02:00
} else {
printf("Désolé, vous avez perdu. Le mot était : %s\n", word);
display_hangman(MAX_TRIES);
2024-10-25 18:43:33 +02:00
save_party("Lose", word, try, tries, good_try, cpt);
2024-10-14 18:41:58 +02:00
}
return 0;
2024-10-15 11:32:49 +02:00
}