Difference between revisions of "Tutoriel test"

(Cette version a été marquée pour être traduite)
Line 3: Line 3:
 
|Main_Picture_annotation={"version":"3.5.0","objects":[{"type":"image","version":"3.5.0","originX":"left","originY":"top","left":-18,"top":-245,"width":736,"height":1206,"fill":"rgb(0,0,0)","stroke":null,"strokeWidth":0,"strokeDashArray":null,"strokeLineCap":"butt","strokeDashOffset":0,"strokeLineJoin":"miter","strokeMiterLimit":4,"scaleX":0.86,"scaleY":0.86,"angle":0,"flipX":false,"flipY":false,"opacity":1,"shadow":null,"visible":true,"clipTo":null,"backgroundColor":"","fillRule":"nonzero","paintFirst":"fill","globalCompositeOperation":"source-over","transformMatrix":null,"skewX":0,"skewY":0,"crossOrigin":"","cropX":0,"cropY":0,"src":"https://wiki.lowtechlab.org/images/c/c7/Tutoriel_test_le_chat_blanc_pierre_bonnard.jpg","filters":[]}],"height":449.58677685950414,"width":600}
 
|Main_Picture_annotation={"version":"3.5.0","objects":[{"type":"image","version":"3.5.0","originX":"left","originY":"top","left":-18,"top":-245,"width":736,"height":1206,"fill":"rgb(0,0,0)","stroke":null,"strokeWidth":0,"strokeDashArray":null,"strokeLineCap":"butt","strokeDashOffset":0,"strokeLineJoin":"miter","strokeMiterLimit":4,"scaleX":0.86,"scaleY":0.86,"angle":0,"flipX":false,"flipY":false,"opacity":1,"shadow":null,"visible":true,"clipTo":null,"backgroundColor":"","fillRule":"nonzero","paintFirst":"fill","globalCompositeOperation":"source-over","transformMatrix":null,"skewX":0,"skewY":0,"crossOrigin":"","cropX":0,"cropY":0,"src":"https://wiki.lowtechlab.org/images/c/c7/Tutoriel_test_le_chat_blanc_pierre_bonnard.jpg","filters":[]}],"height":449.58677685950414,"width":600}
 
|Licences=Attribution (CC BY)
 
|Licences=Attribution (CC BY)
|Description=<translate><!--T:1--> Test</translate>
+
|Description=<translate><!--T:1-->
 +
Test</translate>
 
|Area=Habitat
 
|Area=Habitat
 
|Type=Prototype
 
|Type=Prototype
Line 30: Line 31:
 
(x+y)^n = \sum\limits_{p=0}^n \binom{n}{k} x^k y^{n-k}
 
(x+y)^n = \sum\limits_{p=0}^n \binom{n}{k} x^k y^{n-k}
 
</syntaxhighlight><br /></translate>
 
</syntaxhighlight><br /></translate>
 +
}}
 +
{{TutoVideo
 +
|VideoType=Youtube
 +
|VideoURLYoutube=https://youtu.be/SfGORMt0nGQ?feature=shared
 
}}
 
}}
 
{{Materials
 
{{Materials
Line 41: Line 46:
 
}}
 
}}
 
{{Tuto Step
 
{{Tuto Step
|Step_Title=<translate><!--T:5--> Étape1</translate>
+
|Step_Title=<translate><!--T:5-->
|Step_Content=<translate><!--T:6--> contenu étape 1</translate>
+
Étape1</translate>
 +
|Step_Content=<translate><!--T:6-->
 +
contenu étape 1</translate>
 
}}
 
}}
 
{{Notes
 
{{Notes
|Notes=<translate><!--T:7--> Voici des notes</translate>
+
|Notes=<translate><!--T:7-->
 +
Voici des notes</translate>
 
}}
 
}}
 
{{PageLang
 
{{PageLang

Revision as of 09:55, 5 December 2024

Prototype de avatarLéo H. | Categories : Housing

Test

Difficulty
Easy
Duration
2 hour(s)
Cost
2 EUR (€)
Other languages:
français
License : Attribution (CC BY)

Introduction

  1. Testestsddssaddsasdqddsdtestest

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}

Video overview

Step 1 - Étape1

contenu étape 1

Notes and references

Voici des notes

Comments

Draft