Differences
This shows you the differences between two versions of the page.
|
ac-is:internal:playground [2021/09/20 21:54] ionut.pascal |
ac-is:internal:playground [2021/11/22 15:54] (current) eduard.ciurezu |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Playground ====== | ====== Playground ====== | ||
| + | |||
| + | <hidden> <spoiler> <hidden> | ||
| + | This is how you hide a Lab | ||
| + | </hidden> </spoiler> </hidden> | ||
| + | |||
| + | All items inside internal are listed here. | ||
| + | <html> | ||
| + | <ul id="navbar"> | ||
| + | |||
| + | <li> | ||
| + | <a href="#">Laboratoare</a> | ||
| + | </html>{{indexmenu>ac-is:internal}}<html> | ||
| + | </li> | ||
| + | </ul> | ||
| + | </html> | ||
| + | |||
| This is a page where you can try different stuff | This is a page where you can try different stuff | ||
| + | |||
| + | Questions: | ||
| + | - mai pastram available sectiunea de arhiva pentru toata lumea | ||
| + | - daca da, mai facem arhiva la ce e prezent? | ||
| + | |||
| <hidden> | <hidden> | ||
| Line 7: | Line 28: | ||
| </hidden> | </hidden> | ||
| + | <spoiler> | ||
| + | This is a spoiler | ||
| + | </spoiler> | ||
| + | |||
| + | \\ | ||
| + | ---- | ||
| + | \\ | ||
| + | <note tip> This is a tip. Empty line inserted above</note> | ||
| + | <note warning> This is a stop</note> | ||
| + | <note important>This is a attention</note> | ||
| + | <note > Limbaj selectat: System Verilog - arata mai fancy </note> | ||
| + | |||
| + | {{:ac-is:internal:1op:dand_1op_2016_2.jpg?200| This is a shitty title}} | ||
| + | |||
| + | <note important>Caption not available, but you can see the title if you move the cursor </note> | ||
| + | |||
| + | <code systemverilog> | ||
| + | module exemplu_assign(output out, input a, b, c); | ||
| + | |||
| + | assign out = (a && !b) || c; | ||
| + | |||
| + | endmodule | ||
| + | </code> | ||
| + | |||
| + | == Exemplu input pentru un labirint 8x8 == | ||
| + | |||
| + | Coltul din stanga sus are indicii (0,0) | ||
| + | <file input> | ||
| + | starting_row = 1 | ||
| + | starting_col = 1 | ||
| + | |||
| + | 0 1 2 3 4 5 6 7 | ||
| + | _______________ | ||
| + | 0 |1 1 1 1 1 1 1 1 | ||
| + | 1 |1 0 1 0 0 0 0 0 | ||
| + | 2 |1 0 1 0 1 1 1 1 | ||
| + | 3 |1 0 0 0 1 1 0 1 | ||
| + | 4 |1 1 0 1 1 0 0 1 | ||
| + | 5 |1 1 1 1 1 0 1 1 | ||
| + | 6 |1 1 0 0 0 0 1 1 | ||
| + | 7 |1 1 1 1 1 1 1 1 | ||
| + | </file> | ||
| + | |||
| + | == Exemplu output pentru un labirint 8x8 == | ||
| + | |||
| + | <file output> | ||
| + | 0 1 2 3 4 5 6 7 | ||
| + | _______________ | ||
| + | 0 |1 1 1 1 1 1 1 1 | ||
| + | 1 |1 2 1 2 2 2 2 2 | ||
| + | 2 |1 2 1 2 1 1 1 1 | ||
| + | 3 |1 2 2 2 1 1 0 1 | ||
| + | 4 |1 1 2 1 1 0 0 1 | ||
| + | 5 |1 1 1 1 1 0 1 1 | ||
| + | 6 |1 1 0 0 0 0 1 1 | ||
| + | 7 |1 1 1 1 1 1 1 1 | ||
| + | |||
| + | </file> | ||
| + | Ruta folosind algoritmul Wall Follower: | ||
| + | **(1,1)** -> (2,1) -> (3,1) -> (3,2) -> (4,2) -> (3,2) -> (3,3) -> (2,3) -> (1,3) -> (1,4) -> (1,5) -> (1,6) -> **(1,7)** | ||
