Léo Hamard (talk | contribs) |
Léo Hamard (talk | contribs) (Cette version a été marquée pour être traduite) |
||
| Line 23: | Line 23: | ||
'''Testgras''' | '''Testgras''' | ||
| + | <!--T:13--> | ||
<br /><syntaxhighlight lang="c" line="1"> | <br /><syntaxhighlight lang="c" line="1"> | ||
#include <stdio.h> | #include <stdio.h> | ||
| Line 66: | Line 67: | ||
Voici des notes | Voici des notes | ||
| + | <!--T:14--> | ||
'''Testgras'''</translate> | '''Testgras'''</translate> | ||
}} | }} | ||
Latest revision as of 14:32, 17 February 2025
Difficulty
Easy
Duration
2 hour(s)
Cost
2 EUR (€)
Description
Test Testgras Testpasgras
Introduction
- Testestsddssaddsa
sdqddsdtestest
Testgras
1 #include <stdio.h>
2 #include <stdlib.h>
3
4 int main() {
5 printf("Hello World !\n");
6 return EXIT_SUCCESS ;
7 }
(x+y)^n = \sum\limits_{p=0}^n \binom{n}{k} x^k y^{n-k}
Youtube
Step 1 - Étape1
Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe Premier paragraphe
Après le retour à la ligne
Modification
Notes and references
Voici des notes
Testgras
Draft
Français
English
Deutsch
Español
Italiano
Português