MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"lecontinue": "20250608141858|13786",
"continue": "-||"
},
"query": {
"logevents": [
{
"logid": 13796,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 27: Algoritmul Union-Find",
"pageid": 3382,
"logpage": 3382,
"revid": 18520,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-10T15:19:54Z",
"comment": "Created page with \"== \u00cenregistrare video lec\u021bie == {{#ev:youtube|https://youtu.be/QCaiWycJljs|||||start=8250&end=8320&loop=1}} == Problema Disjoint == Se dau\u00a0<tt>N</tt>\u00a0mul\u0163imi de numere, ini\u0163ial fiecare mul\u0163ime\u00a0<tt>i</tt>\u00a0con\u0163in\u00e2nd un singur element, mai exact elementul\u00a0i. Asupra acestor mul\u0163imi se pot face 2 tipuri de opera\u0163ii, astfel: * opera\u0163ia de tipul 1: se dau dou\u0103 numere naturale\u00a0<tt>x</tt>\u00a0si\u00a0<tt>y</tt>, \u00eentre 1 \u015fi\u00a0<tt>N</tt>. Se cere s\u0103 se reuneasc\u0103 m...\""
},
{
"logid": 13795,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 26: Programare dinamic\u0103 (3)",
"pageid": 3381,
"logpage": 3381,
"revid": 18517,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-10T13:27:35Z",
"comment": "Created page with \"== \u00cenregistrare video rezolvarea temei == {{#ev:youtube|https://www.youtube.com/watch?v=KdHv9T7Pp98|||||start=80&end=10280&loop=1}} \u00cen continuare vom studia exemple de probleme de programare dinamic\u0103 \u0219i probleme suprapuse date la olimpiad\u0103. == Problema Faleza == Problema\u00a0[https://www.nerdarena.ro/problema/faleza Faleza]\u00a0a fost dat\u0103 la ONI 2017 clasa a 6-a. Ea este o problem\u0103 de un anumit gen, care se \u00eent\u00e2lne\u0219te din c\u00e2nd \u00een c\u00e2nd la olimpiad\u0103: probleme...\""
},
{
"logid": 13794,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 25: Programare dinamic\u0103 (2)",
"pageid": 3380,
"logpage": 3380,
"revid": 18511,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-10T11:30:40Z",
"comment": "Created page with \"== \u00cenregistrare video lec\u021bie == {{#ev:youtube|https://youtu.be/z4433kBdq2A|||||start=5580&end=9780&loop=1}} == Problema rucsacului == '''Aten\u021bie:''' ve\u021bi avea la tem\u0103 ca aplica\u021bie problema\u00a0[https://www.nerdarena.ro/problema/rucsac1 Rucsac1]. Se d\u0103 o mul\u021bime format\u0103 din\u00a0<tt>N</tt>\u00a0obiecte, fiecare av\u00e2nd o greutate \u0219i o valoare. \u00centr-un rucsac putem \u00eenc\u0103rca o greutate maxim\u00a0<tt>G</tt>. Ne dorim s\u0103 \u00eenc\u0103rc\u0103m rucsacul cu obiecte astfel \u00eenc\u00e2t s\u0103 m...\""
},
{
"logid": 13793,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 29: Discutarea problemelor de la OJI 2024",
"pageid": 3379,
"logpage": 3379,
"revid": 18509,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-10T10:39:02Z",
"comment": "Created page with \"== \u00cenregistrare video lec\u021bie == {{#ev:youtube|https://youtu.be/z4433kBdq2A|||||start=1&end=3540&loop=1}} == Problema Parking == Problema\u00a0[https://www.nerdarena.ro/problema/parking Parking]\u00a0a fost dat\u0103 la OJI 2024 Clasa a 7-a. C\u00e2nd vedem o astfel de problem\u0103 primul g\u00e2nd trebuie s\u0103 fie: oric\u00e2t de simpl\u0103 ar fi solu\u021bia, chiar \u0219i cea mai simpl\u0103 solu\u021bie va fi delicat de implementat \u0219i nu va fi scurt\u0103. Este genul de problem\u0103 care, la concurs, ia timp. Da...\""
},
{
"logid": 13792,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 24: Programare dinamic\u0103 (1)",
"pageid": 3378,
"logpage": 3378,
"revid": 18503,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-08T21:10:21Z",
"comment": "Created page with \"== \u00cenregistrare video lec\u021bie == {{#ev:youtube|https://www.youtube.com/watch?v=a0wFdh8DInQ|||||start=7600&end=11100&loop=1}} == Conceptul de programare dinamic\u0103 == Introducere Wikipedia define\u0219te\u00a0programarea dinamic\u0103\u00a0drept o metod\u0103 pentru rezolvarea unor probleme complexe prin descompunerea lor \u00een subprobleme mai simple. Se poate aplica problemelor care prezint\u0103 propriet\u0103\u021bile de\u00a0suprapunere a subproblemelor\u00a0\u0219i de\u00a0substructur\u0103 optimal\u0103. Atunci c\u00e2nd s...\""
},
{
"logid": 13791,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 28: Sfaturi pentru concursuri / olimpiad\u0103",
"pageid": 3377,
"logpage": 3377,
"revid": 18494,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-08T19:52:37Z",
"comment": "Created page with \"== Ce s\u0103 face\u021bi / ce s\u0103 nu face\u021bi == === Ce s\u0103 face\u021bi === * '''Odihn\u0103:''' odihni\u021bi-v\u0103 cu o zi \u00eenainte. Relaxa\u021bi-v\u0103 cu activitatea favorit\u0103. Merge\u021bi la un film, juca\u021bi jocul vostru preferat, etc. \u00cencerca\u021bi s\u0103 nu v\u0103 g\u00e2ndi\u021bi la concurs. * '''Ceas:''' ave\u021bi un ceas la voi. Nu ceasul calculatorului sau al smartphone-ului. Fi\u021bi con\u0219tien\u021bi de trecerea timpului, nu v\u0103 trezi\u021bi din visare c\u00e2nd mai este un sfert de or\u0103. Pentru aceasta un ceas a\u0219ezat...\""
},
{
"logid": 13790,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale prin algoritmi de tip succesor: submul\u021bimi,permut\u0103ri, combin\u0103ri, aranjamente, next permutation",
"pageid": 0,
"logpage": 3375,
"revid": 18490,
"params": {
"target_ns": 0,
"target_title": "Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale prin algoritmi de tip succesor: submul\u021bimi, permut\u0103ri, combin\u0103ri, aranjamente, next permutation",
"suppressredirect": ""
},
"type": "move",
"action": "move",
"user": "Mihai",
"timestamp": "2025-06-08T14:57:16Z",
"comment": ""
},
{
"logid": 13789,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale prin algoritmi de tip succesor: submul\u021bimi, permut\u0103ri, combin\u0103ri, aranjamente, next permutation",
"pageid": 3375,
"logpage": 3374,
"params": {},
"type": "delete",
"action": "delete",
"user": "Mihai",
"timestamp": "2025-06-08T14:56:59Z",
"comment": "Deleted to make way for move from \"[[Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale prin algoritmi de tip succesor: submul\u021bimi,permut\u0103ri, combin\u0103ri, aranjamente, next permutation]]\""
},
{
"logid": 13788,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 23: Evaluare (6)",
"pageid": 3376,
"logpage": 3376,
"revid": 18487,
"params": {},
"type": "create",
"action": "create",
"user": "Mihai",
"timestamp": "2025-06-08T14:21:39Z",
"comment": "Created page with \"Testa\u021bi-v\u0103 cuno\u0219tin\u021bele \u0219i rezolva\u021bi urm\u0103toarele probleme \u00een decurs a trei ore (program C trimis la [https://www.nerdarena.ro/ NerdArena]): * [https://nerdarena.ro/problema/coada Coada] * [https://nerdarena.ro/problema/plop Plop] * [https://nerdarena.ro/problema/nraprime1 NrPrime1] [http://solpedia.francu.com/wiki/index.php?title=Clasa_a_7-a_Lec%C8%9Bia_23:_Evaluare_(6) Acceseaz\u0103 rezolvarea problemelor de la lec\u021bia 23]\""
},
{
"logid": 13787,
"ns": 0,
"title": "Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale: submul\u021bimi, permut\u0103ri, combin\u0103ri, aranjamente, next permutation",
"pageid": 0,
"logpage": 3375,
"revid": 18484,
"params": {
"target_ns": 0,
"target_title": "Clasa a 7-a Lec\u021bia 22: Generarea elementelor combinatoriale prin algoritmi de tip succesor: submul\u021bimi,permut\u0103ri, combin\u0103ri, aranjamente, next permutation",
"suppressredirect": ""
},
"type": "move",
"action": "move",
"user": "Mihai",
"timestamp": "2025-06-08T14:19:16Z",
"comment": ""
}
]
}
}