Skip to content
This repository has been archived by the owner on May 17, 2024. It is now read-only.

Commit

Permalink
Update Readme.md
Browse files Browse the repository at this point in the history
  • Loading branch information
NilsKrattinger authored Oct 23, 2019
1 parent 081093b commit 9be66c0
Showing 1 changed file with 15 additions and 2 deletions.
17 changes: 15 additions & 2 deletions Readme.md
Original file line number Diff line number Diff line change
@@ -1,2 +1,15 @@
Regex pour vérifier qu'aucun in out n'est utilisé dans le projet :
`function [a-zA-Z0-9]+\([a-zA-Z0-9,:;\s]+:\s*(in )?out`
# SBADA

## English
This repository was created during a programming week for my studies in the UIT2 of Grenoble.

The subject was to build an application around the magic square of the Sagrada Familia. Our objective was to find all the solutions using 3 to 7 cells with a sum of 33, and check their contiguity.

There is a CLI version and a graphical version, which is included in this repo, but isn't compilable because of the package used. It was made by the UIT2 of Grenoble, isn't publicly available and I'm not allowed to share it in this repo. The graphical libraries used were Xlib and XForms.

## French
Ce repo a été créé durant une semaine de programmation au sein de l'IUT2 de Grenoble.

Le sujet était orienté autour du carré de Gaudi-Subirachs que l'on peut trouver sur la Sagrada Familia. Nous devions trouver toutes les solutions utilisant entre 3 et 7 cases ayant une somme égale à 33, et ensuite trouver la contiguïté de celles-ci.

Il y a une partie CLI et une partie graphique. La partie graphique est incluse dans ce repo mais n'est pas compilable, car elle utilise `p_fenbase`, un package fait maison par l'IUT2 de Grenoble qui n'est pas inclus dans ce repo. Ce package utilise les bibliothèques Xlib et XForms.

0 comments on commit 9be66c0

Please sign in to comment.