Compare commits
13 Commits
dev-landri
...
master
Author | SHA1 | Date | |
---|---|---|---|
b7de5a5c70 | |||
5970b43f61 | |||
16f081c454 | |||
c0024eb101 | |||
64baba6c61 | |||
159c83ea8d | |||
8877777c62 | |||
10c9aca59a | |||
3c4ed87d6c | |||
ebfe656cf4 | |||
4960203ced | |||
509db16917 | |||
2fd6561591 |
23
README.md
Normal file
23
README.md
Normal file
@ -0,0 +1,23 @@
|
||||
# TD3_DEV51_Qualite_Algo
|
||||
###### par SCHIED Killian, LANDRIN Dylan et ROCHER Léo
|
||||
|
||||
## Exercice 4
|
||||
|
||||
### Complexité cyclomatique
|
||||
|
||||
Pour la complexité cyclomatique de chaque fonction nous avons calculé ceci :
|
||||
| Fonction | Complexité Cyclomatique |
|
||||
|---------------------------------------|-------------------------|
|
||||
| `display_hangman(int tries)` | 7 |
|
||||
| `save_party(char *status, const char *good_word, char try[])` | 3 |
|
||||
| `sig_handler(int signum)` | 2 |
|
||||
| `getWordByLength()` | 3 |
|
||||
| `main()` | 13 |
|
||||
|
||||
### Utilisation de gprof
|
||||
|
||||
Le programme étant petit et fait appel à peu de fonction, l'utilisation de gprof ne nous permet pas d'obtenir d'information utile.
|
||||
|
||||
### Conclusion sur la qualité du code
|
||||
|
||||
Le code est fonctionnel et globalement efficace. On peut améliorer la quantité de commentaire et trouver un moyen de réduire la complexité cyclomatique du main.
|
95
pendu.c
95
pendu.c
@ -1,7 +1,9 @@
|
||||
#include <signal.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#define MAX_WORDS 14
|
||||
#define MAX_TRIES 6
|
||||
@ -41,21 +43,23 @@ this function allow to save the last party
|
||||
Parameters:
|
||||
status -> state that save if the gamer win or lose the party
|
||||
good_word -> the word to guess
|
||||
try -> the letters try by the gamer
|
||||
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
|
||||
*/
|
||||
void save_party(char * status, const char * good_word, char try[]) {
|
||||
void save_party(char * status, const char * good_word, char try[], int cpt_try, char good_try[], int cpt_good_try) {
|
||||
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
|
||||
|
||||
FILE* fichier = fopen("save_party.txt", "w");
|
||||
FILE* fichier = fopen("save_party.txt", "a");
|
||||
|
||||
if (fichier != NULL)
|
||||
{
|
||||
fputs("Date and time: ", fichier);
|
||||
fputs(date,fichier);
|
||||
fputs("\n",fichier);
|
||||
|
||||
fputs("Status: ", fichier);
|
||||
fputs(status,fichier);
|
||||
@ -66,24 +70,85 @@ void save_party(char * status, const char * good_word, char try[]) {
|
||||
fputs("\n",fichier);
|
||||
|
||||
fputs("tried letters: ", fichier);
|
||||
for (int i = 0; i < sizeof(try); i++) {
|
||||
for (int i = 0; i < cpt_try; i++) {
|
||||
fputc(try[i],fichier);
|
||||
}
|
||||
fputs("\n",fichier);
|
||||
|
||||
fclose(fichier); // On ferme le fichier qui a été ouvert
|
||||
}
|
||||
fputs("guessed letters: ", fichier);
|
||||
for (int i = 0; i < cpt_good_try; i++) {
|
||||
fputc(good_try[i],fichier);
|
||||
}
|
||||
fputs("\n",fichier);
|
||||
fputs("\n",fichier);
|
||||
|
||||
fclose(fichier); // Close the opened file
|
||||
}
|
||||
}
|
||||
|
||||
/* 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);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
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 = words[rand() % MAX_WORDS];
|
||||
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;
|
||||
char try[MAX_TRIES]; //save the carcater try
|
||||
char try[MAX_TRIES]; //save the carcater false
|
||||
char good_try[word_length]; //save the carcater good
|
||||
int cpt = 0;
|
||||
|
||||
signal(SIGALRM,sig_handler);
|
||||
|
||||
signal(SIGALRM,sig_handler);
|
||||
|
||||
for (int i = 0; i < word_length; i++) {
|
||||
guessed[i] = '_';
|
||||
@ -91,14 +156,16 @@ int main() {
|
||||
guessed[word_length] = '\0';
|
||||
|
||||
while (tries < MAX_TRIES && guessed_correctly < word_length) {
|
||||
|
||||
printf("\nMot à deviner : %s\n", guessed);
|
||||
display_hangman(tries);
|
||||
char guess;
|
||||
alarm(30);
|
||||
printf("Entrez une lettre : ");
|
||||
alarm(30);
|
||||
scanf(" %c", &guess);
|
||||
|
||||
|
||||
|
||||
int found = 0;
|
||||
|
||||
for (int i = 0; i < word_length; i++) {
|
||||
@ -106,7 +173,6 @@ int main() {
|
||||
if (guessed[i] == '_') {
|
||||
guessed[i] = guess;
|
||||
guessed_correctly++;
|
||||
try[tries] = guess;
|
||||
}
|
||||
found = 1;
|
||||
}
|
||||
@ -115,16 +181,19 @@ int main() {
|
||||
if (!found) {
|
||||
try[tries] = guess;
|
||||
tries++;
|
||||
}else{
|
||||
good_try[cpt] = guess;
|
||||
cpt++;
|
||||
}
|
||||
}
|
||||
|
||||
if (guessed_correctly == word_length) {
|
||||
printf("Félicitations ! Vous avez deviné le mot : %s\n", word);
|
||||
save_party("Win", word, try);
|
||||
save_party("Win", word, try, tries, good_try, cpt);
|
||||
} else {
|
||||
printf("Désolé, vous avez perdu. Le mot était : %s\n", word);
|
||||
display_hangman(MAX_TRIES);
|
||||
save_party("Lose", word, try);
|
||||
save_party("Lose", word, try, tries, good_try, cpt);
|
||||
}
|
||||
|
||||
return 0;
|
||||
|
BIN
save_party.txt
BIN
save_party.txt
Binary file not shown.
Loading…
Reference in New Issue
Block a user