{"batchcomplete":"","continue":{"rccontinue":"20260206165145|22887","continue":"-||"},"query":{"recentchanges":[{"type":"edit","ns":0,"title":"Main Page","pageid":1,"revid":18592,"old_revid":18591,"rcid":22897,"timestamp":"2026-02-17T09:33:01Z"},{"type":"edit","ns":0,"title":"Main Page","pageid":1,"revid":18591,"old_revid":18551,"rcid":22896,"timestamp":"2026-02-17T09:32:38Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 19: Cozi \u0219i algoritmul lui Lee","pageid":3371,"revid":18590,"old_revid":18589,"rcid":22895,"timestamp":"2026-02-16T16:23:26Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 19: Cozi \u0219i algoritmul lui Lee","pageid":3371,"revid":18589,"old_revid":18579,"rcid":22894,"timestamp":"2026-02-16T15:12:42Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 18: Divide et impera, mergesort, quicksort","pageid":3370,"revid":18588,"old_revid":18578,"rcid":22893,"timestamp":"2026-02-10T17:40:31Z"},{"type":"edit","ns":0,"title":"Clasa a VII-a lec\u021bia 6 - 17 oct 2019","pageid":3209,"revid":18587,"old_revid":18141,"rcid":22892,"timestamp":"2026-02-07T10:13:53Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 29: Discutarea problemelor de la OJI 2024","pageid":3379,"revid":18586,"old_revid":18510,"rcid":22891,"timestamp":"2026-02-06T16:59:28Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 27: Algoritmul Union-Find","pageid":3382,"revid":18585,"old_revid":18521,"rcid":22890,"timestamp":"2026-02-06T16:57:26Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 26: Programare dinamic\u0103 (3)","pageid":3381,"revid":18584,"old_revid":18519,"rcid":22889,"timestamp":"2026-02-06T16:55:41Z"},{"type":"edit","ns":0,"title":"Clasa a 7-a Lec\u021bia 25: Programare dinamic\u0103 (2)","pageid":3380,"revid":18583,"old_revid":18516,"rcid":22888,"timestamp":"2026-02-06T16:53:43Z"}]}}