Skip to content
Extraits de code Groupes Projets
Valider 0c08048d rédigé par Maxime Jacques de Dixmude Slavic's avatar Maxime Jacques de Dixmude Slavic
Parcourir les fichiers

README Update

parent 5f0b5786
Aucune branche associée trouvée
Aucune étiquette associée trouvée
Aucune requête de fusion associée trouvée
# lepl1503-2020-groupe-C1
## Description
This repository git is the project for the course LEPL11503 made by the team C1 composed by :
Markup : - Hugo Clercq 0703 1700
- Maxime Jacques de Dixmude Slavic 6205 1500
- Arnaud Lahousse 5629 1500
- Andy Laurez 1029 1700
- Corentin Lengelé 1475 1700
- Julien De Coninck 5613 1700
The project's goal is to convert and optimize a python program in order to find the primes dividers of a list of numbers.
### File Description
- `samples\` : directory with various input file
- `Makefile`: Makefile
- `functions.c`: **C file** where all functions are stored
- `main.c` : **C file** where the architecture of the programm is implemented
- `primeMaker.c` : **C file** who write a txt file where is stored all primes dividers for INT number
- `test_prime_divs.c` : **C file** with all Cunit test
- `example_input.txt` : simple example of a input file
- `example_output.txt` : output file obtain with **example_input.txt**
......@@ -50,5 +69,5 @@ make test
### Options
- `-N` : Determine the amount of threads to use
- `--help or -h`: Print help
- `--verbose or -v`: Enable debug
- `--help or -h`: Print help
0% Chargement en cours ou .
You are about to add 0 people to the discussion. Proceed with caution.
Terminez d'abord l'édition de ce message.
Veuillez vous inscrire ou vous pour commenter