{"batchcomplete":"","continue":{"lecontinue":"20190307171938|81","continue":"-||"},"query":{"logevents":[{"logid":91,"ns":0,"title":"Basic Linux Server Configuration","pageid":83,"logpage":83,"params":{},"type":"create","action":"create","user":"Tata","timestamp":"2019-04-23T19:12:39Z","comment":"Created page with \"= Flow = # \u0e2a\u0e23\u0e49\u0e32\u0e07 Droplet #* \u0e2a\u0e23\u0e49\u0e32\u0e07 Droplet \u0e40\u0e1b\u0e25\u0e48\u0e32\u0e46 #* \u0e2a\u0e23\u0e49\u0e32\u0e07 Droplet with LAMP Stack # \u0e2a\u0e23\u0e49\u0e32\u0e07 User # Add user to sudoer # Insta...\""},{"logid":90,"ns":0,"title":"Courseville Project Resources","pageid":82,"logpage":82,"params":{},"type":"create","action":"create","user":"Tata","timestamp":"2019-04-16T16:20:50Z","comment":"Created page with \"== Docker == * https://bitpress.io/simple-approach-using-docker-with-php/?fbclid=IwAR0psAfTg9hjJGYJf9XFjmhkdWt9IytV_qEOKZhY5RKp6DdWJB896G-_uYs My Simple Approach to using Do...\""},{"logid":89,"ns":0,"title":"\u0e04\u0e2d\u0e21\u0e1e\u0e34\u0e27\u0e40\u0e15\u0e2d\u0e23\u0e4c\u0e42\u0e2d\u0e25\u0e34\u0e21\u0e1b\u0e34\u0e01 \u0e40\u0e17\u0e2d\u0e21 2 \u0e1b\u0e35 2554","pageid":81,"logpage":15,"params":{"target_ns":0,"target_title":"Old acioi wiki /\u0e04\u0e2d\u0e21\u0e1e\u0e34\u0e27\u0e40\u0e15\u0e2d\u0e23\u0e4c\u0e42\u0e2d\u0e25\u0e34\u0e21\u0e1b\u0e34\u0e01 \u0e40\u0e17\u0e2d\u0e21 2 \u0e1b\u0e35 2554"},"type":"move","action":"move","user":"Tata","timestamp":"2019-03-07T17:23:03Z","comment":""},{"logid":88,"ns":0,"title":"Graph Algorithm Summary","pageid":0,"logpage":12,"params":{},"type":"delete","action":"delete","user":"Tata","timestamp":"2019-03-07T17:21:58Z","comment":"content was: \"MST =====================================================  1. Kruskal  O(V log V)   \t+ \u0e40\u0e23\u0e35\u0e22\u0e07 edge  \t+ \u0e27\u0e19\u0e17\u0e38\u0e01\u0e40\u0e2a\u0e49\u0e19\u0e41...\", and the only contributor was \"[[Special:Contributions/Tata|Tata]]\" ([[User talk:Tata|talk]])"},{"logid":87,"ns":0,"title":"Tree in C","pageid":0,"logpage":9,"params":{},"type":"delete","action":"delete","user":"Tata","timestamp":"2019-03-07T17:21:46Z","comment":"content was: \"== Tree Traversal == * \u0e40\u0e2d\u0e32\u0e21\u0e32\u0e08\u0e32\u0e01 wiki.acioi.in.th <syntaxhighlight lang=\"c++\" line='line'> #include<stdio.h> #include<stdlib.h>...\", and the only contributor was \"[[Special:Contributions/Tata|Tata]]\" ([[User talk:Tata|talk]])"},{"logid":86,"ns":0,"title":"Binary Heap in C","pageid":0,"logpage":7,"params":{},"type":"delete","action":"delete","user":"Tata","timestamp":"2019-03-07T17:21:40Z","comment":"content was: \"== Priority Queue == * \u0e40\u0e2d\u0e32\u0e21\u0e32\u0e08\u0e32\u0e01 wiki.acioi.in.th <syntaxhighlight lang=\"c++\" line='line'> #include<stdio.h> int pq[100000],n; i...\", and the only contributor was \"[[Special:Contributions/Tata|Tata]]\" ([[User talk:Tata|talk]])"},{"logid":85,"ns":0,"title":"\u0e42\u0e08\u0e17\u0e22\u0e4c\u0e41\u0e1b\u0e25\u0e08\u0e32\u0e01 USACO","pageid":0,"logpage":6,"params":{},"type":"delete","action":"delete","user":"Tata","timestamp":"2019-03-07T17:21:30Z","comment":"content was: \" * \u0e40\u0e2d\u0e32\u0e21\u0e32\u0e08\u0e32\u0e01 wiki.acioi.in.th == \u0e27\u0e34\u0e18\u0e35\u0e2a\u0e48\u0e07\u0e42\u0e1b\u0e23\u0e41\u0e01\u0e23\u0e21 == \u0e40\u0e02\u0e35\u0e22\u0e19\u0e42\u0e1b\u0e23\u0e41\u0e01\u0e23\u0e21\u0e42\u0e14\u0e22\u0e01...\", and the only contributor was \"[[Special:Contributions/Tata|Tata]]\" ([[User talk:Tata|talk]])"},{"logid":84,"ns":0,"title":"21110327 algorithm design","pageid":80,"logpage":80,"params":{},"type":"create","action":"create","user":"Tata","timestamp":"2019-03-07T17:20:51Z","comment":"Created page with \"Algorithm Page Created By Tata201201   Source Code Based on C++  == Algorithm Analysis ==   == Divide and Conquer == === Interesting Problems === * [http://www.programming.in....\""},{"logid":83,"ns":0,"title":"2110211 data struct","pageid":79,"logpage":79,"params":{},"type":"create","action":"create","user":"Tata","timestamp":"2019-03-07T17:20:20Z","comment":"Created page with \"\u0e22\u0e34\u0e19\u0e14\u0e35\u0e15\u0e49\u0e2d\u0e19\u0e23\u0e31\u0e1a\u0e2a\u0e39\u0e48 wiki \u0e40\u0e1e\u0e37\u0e48\u0e2d\u0e15\u0e34\u0e27 2110211 Data Structure (By C++) <br> * '''\u0e42\u0e08\u0e17\u0e22\u0e4c challenge \u0e17\u0e33\u0e44\u0e21\u0e48\u0e44\u0e14\u0e49\u0e2d\u0e22...\""},{"logid":82,"ns":0,"title":"2110101 com prog","pageid":78,"logpage":78,"params":{},"type":"create","action":"create","user":"Tata","timestamp":"2019-03-07T17:19:54Z","comment":"Created page with \"<!-- \u0e21\u0e35 COMMENT \u0e2d\u0e22\u0e39\u0e48 2 \u0e17\u0e35\u0e48\u0e19\u0e30 \u0e15\u0e23\u0e07 Link \u0e42\u0e08\u0e17\u0e22\u0e4c Challenge \u0e02\u0e49\u0e32\u0e07\u0e1a\u0e19 \u0e01\u0e31\u0e1a \u0e40\u0e19\u0e37\u0e49\u0e2d\u0e2b\u0e32 Final \u0e02\u0e49\u0e32\u0e07\u0e25\u0e48\u0e32\u0e07...\""}]}}