TEXT   75
MegumuSenpai In Plain Sight 2 GodMode roblox
Guest on 10th February 2023 05:31:12 PM


  1. --[
  2.     [
  3.       // MegumuSenpai
  4. In Plain Sight 2 | GodMode
  5.       //  Made by Megumu / Mommy Mango <
  6.         3
  7.     ]
  8. ]
  9.  
  10. local d = string.byte;
  11. local r = string.char;
  12. local c = string.sub;
  13. local N = table.concat;
  14. local A = math.ldexp;
  15. local V = getfenv or
  16. function() return _ENV end;
  17. local l = setmetatable;
  18. local h = select;
  19. local t = unpack;
  20. local i = tonumber;
  21. local
  22. function s(d) local e, o, t = "", "", {}
  23. local n = 256;
  24. local a = {}
  25. for l = 0, n - 1 do a[l] = r(l) end;
  26.     local l = 1;
  27. local
  28. function f() local e = i(c(d, l, l), 36) l = l + 1;
  29. local o = i(c(d, l, l + e - 1), 36) l = l + e;
  30. return o end;
  31. e = r(f()) t[1] = e;
  32. while l < #d do local l = f() if a[l] then o = a[l]
  33. else o = e..c(e, 1, 1) end;
  34. a[n] = e..c(o, 1, 1) t[#t + 1], e, n = o, o, n + 1 end;
  35. return table.concat(t) end;
  36. local i = s('26V27326V27626T26R27626V24024624A24226T26O27A24N24B24623Y24223P23O26T27027A25724824424624B27J27L27N27827A23K24624E23N26T27227A25024F24623P24624423N28026X27A24X24E24924328K27O23N28A24E24B24326T26P27A25B24227W23N24F27G27A24Z24223O23N23P24823Y26927A26J273171826R27526V26I26V25Z26V26W27A29L25J29O27A26N25Z29G26R29N26V26M27329N29E27626L23R27626P2A723B26G24F29G26I24F26V23B26M26V24N29T2A521R29P26P21R1823S26G21J181826I2AV23S2AJ2AL29P2762A124726V27229J26F25R29G26G25R2B429V26V26H26N2A52332AP2332AS26G22V2AW26I2BQ2B02AK2AM2A02732A726W29J2A123B2B72C126F26F26V26Z2C726V2AC2BR24F2AS26I29J26T29J27A26V');
  37. local n = bit and bit.bxor or
  38. function(l, o) local e, n = 1, 0
  39. while l > 0 and o > 0 do local c, a = l % 2, o % 2
  40.     if
  41. c~ = a then n = n + e end l, o, e = (l - c) / 2, (o - a) / 2, e * 2 end
  42. if l < o then l = o end
  43. while l > 0 do local o = l % 2
  44.     if
  45. o > 0 then n = n + e end l, e = (l - o) / 2, e * 2 end
  46. return n end local
  47. function e(o, l, e) if e then local l = (o / 2 ^ (l - 1)) % 2 ^ ((e - 1) - (l - 1) + 1);
  48. return l - l % 1;
  49. else local l = 2 ^ (l - 1);
  50. return (o % (l + l) >= l) and 1 or 0;
  51. end;
  52. end;
  53. local l = 1;
  54. local
  55. function o() local c, o, e, a = d(i, l, l + 3);
  56. c = n(c, 247) o = n(o, 247) e = n(e, 247) a = n(a, 247) l = l + 4;
  57. return (a * 16777216) + (e * 65536) + (o * 256) + c;
  58. end;
  59. local
  60. function f() local e = n(d(i, l, l), 247);
  61. l = l + 1;
  62. return e;
  63. end;
  64. local
  65. function u() local n = o();
  66. local l = o();
  67. local c = 1;
  68. local n = (e(l, 1, 20) * (2 ^ 32)) + n;
  69. local o = e(l, 21, 31);
  70. local l = ((-1) ^ e(l, 32));
  71. if (o == 0) then
  72. if (n == 0) then
  73. return l * 0;
  74. else o = 1;
  75. c = 0;
  76. end;
  77. elseif(o == 2047) then
  78. return (n == 0) and(l * (1 / 0)) or(l * (0 / 0));
  79. end;
  80. return A(l, o - 1023) * (c + (n / (2 ^ 52)));
  81. end;
  82. local a = o;
  83. local
  84. function s(e) local o;
  85. if (not e) then e = a();
  86. if (e == 0) then
  87. return '';
  88. end;
  89. end;
  90. o = c(i, l, l + e - 1);
  91. l = l + e;
  92. local e = {}
  93. for l = 1, #o do e[l] = r(n(d(c(o, l, l)), 247)) end
  94.     return N(e);
  95.     end;
  96. local l = o;
  97. local
  98. function i(...) return {...
  99. }, h('#', ...) end local
  100. function r() local d = {
  101.     0,
  102.     0,
  103.     0,
  104.     0,
  105.     0,
  106.     0,
  107.     0,
  108.     0,
  109.     0,
  110.     0,
  111.     0,
  112.     0,
  113.     0,
  114.     0,
  115.     0,
  116.     0,
  117.     0,
  118.     0,
  119.     0,
  120.     0,
  121.     0,
  122.     0
  123. };
  124. local t = {};
  125. local l = {};
  126. local a = {
  127.     d,
  128.     nil,
  129.     t,
  130.     nil,
  131.     l
  132. };
  133. a[4] = f();
  134. local l = o() local c = {
  135.     0,
  136.     0,
  137.     0,
  138.     0,
  139.     0,
  140.     0,
  141.     0,
  142.     0
  143. };
  144. for o = 1, l do local e = f();
  145.     local l;
  146. if (e == 0) then l = (f() ~ = 0);
  147. elseif(e == 1) then l = u();
  148. elseif(e == 2) then l = s();
  149. end;
  150. c[o] = l;
  151. end;
  152. a[2] = c
  153. for a = 1, o() do local c = n(o(), 29);
  154.     local o = n(o(), 12);
  155. local n = e(c, 1, 2);
  156. local l = e(o, 1, 11);
  157. local l = {
  158.     l,
  159.     e(c, 3, 11),
  160.     nil,
  161.     nil,
  162.     o
  163. };
  164. if (n == 0) then l[3] = e(c, 12, 20);
  165. l[5] = e(c, 21, 29);
  166. elseif(n == 1) then l[3] = e(o, 12, 33);
  167. elseif(n == 2) then l[3] = e(o, 12, 32) - 1048575;
  168. elseif(n == 3) then l[3] = e(o, 12, 32) - 1048575;
  169. l[5] = e(c, 21, 29);
  170. end;
  171. d[a] = l;
  172. end;
  173. for l = 1, o() do t[l - 1] = r();
  174.     end;
  175. return a;
  176. end;
  177. local
  178. function s(l, e, f) local o = l[1];
  179. local n = l[2];
  180. local e = l[3];
  181. local l = l[4];
  182. return function(...) local s = o;
  183. local c = n;
  184. local e = e;
  185. local o = l;
  186. local l = i local n = 1;
  187. local a = -1;
  188. local r = {};
  189. local i = {...
  190. };
  191. local d = h('#', ...) - 1;
  192. local l = {};
  193. local e = {};
  194. for l = 0, d do
  195.     if (l >= o) then r[l - o] = i[l + 1];
  196.     else e[l] = i[l + 1];
  197. end;
  198. end;
  199. local l = d - o + 1 local l;
  200. local o;
  201. while true do l = s[n];
  202. o = l[1];
  203. if o <= 9 then
  204. if o <= 4 then
  205. if o <= 1 then
  206. if o == 0 then local o = l[2];
  207. local c = {};
  208. local n = 0;
  209. local l = o + l[3] - 1;
  210. for l = o + 1, l do n = n + 1;
  211.     c[n] = e[l];
  212. end;
  213. e[o](t(c, 1, l - o));
  214. a = o;
  215. else local n = l[2];
  216. local d = {};
  217. local o = 0;
  218. local c = n + l[3] - 1;
  219. for l = n + 1, c do o = o + 1;
  220.     d[o] = e[l];
  221. end;
  222. local c = {
  223.     e[n](t(d, 1, c - n))
  224. };
  225. local l = n + l[5] - 2;
  226. o = 0;
  227. for l = n, l do o = o + 1;
  228.     e[l] = c[o];
  229. end;
  230. a = l;
  231. end;
  232. elseif o <= 2 then local o = l[2];
  233. local c = {};
  234. local n = 0;
  235. local l = o + l[3] - 1;
  236. for l = o + 1, l do n = n + 1;
  237.     c[n] = e[l];
  238. end;
  239. e[o](t(c, 1, l - o));
  240. a = o;
  241. elseif o == 3 then e[l[2]] = e[l[3]][c[l[5]]];
  242. else local o = l[2];
  243. local n = e[l[3]];
  244. e[o + 1] = n;
  245. e[o] = n[c[l[5]]];
  246. end;
  247. elseif o <= 6 then
  248. if o > 5 then e[l[2]] = c[l[3]];
  249. else local n = l[2];
  250. local o = e[l[3]];
  251. e[n + 1] = o;
  252. e[n] = o[c[l[5]]];
  253. end;
  254. elseif o <= 7 then do return end;
  255.     elseif o > 8 then
  256. if e[l[2]] then n = n + 1;
  257. else n = n + l[3];
  258. end;
  259. else e[l[2]] = f[c[l[3]]];
  260. end;
  261. elseif o <= 14 then
  262. if o <= 11 then
  263. if o > 10 then e[l[2]] = e[l[3]][c[l[5]]];
  264. else if e[l[2]] then n = n + 1;
  265. else n = n + l[3];
  266. end;
  267. end;
  268. elseif o <= 12 then n = n + l[3];
  269. elseif o > 13 then do return end;
  270.     else e[l[2]] = f[c[l[3]]];
  271. end;
  272. elseif o <= 16 then
  273. if o > 15 then local o = l[2];
  274. local c, n = {
  275.     e[o]()
  276. };
  277. local n = o + l[5] - 2;
  278. local l = 0;
  279. for o = o, n do l = l + 1;
  280.     e[o] = c[l];
  281. end;
  282. a = n;
  283. else local o = l[2];
  284. local c, n = {
  285.     e[o]()
  286. };
  287. local n = o + l[5] - 2;
  288. local l = 0;
  289. for o = o, n do l = l + 1;
  290.     e[o] = c[l];
  291. end;
  292. a = n;
  293. end;
  294. elseif o <= 17 then n = n + l[3];
  295. elseif o == 18 then local n = l[2];
  296. local d = {};
  297. local o = 0;
  298. local c = n + l[3] - 1;
  299. for l = n + 1, c do o = o + 1;
  300.     d[o] = e[l];
  301. end;
  302. local c = {
  303.     e[n](t(d, 1, c - n))
  304. };
  305. local l = n + l[5] - 2;
  306. o = 0;
  307. for l = n, l do o = o + 1;
  308.     e[l] = c[o];
  309. end;
  310. a = l;
  311. else e[l[2]] = c[l[3]];
  312. end;
  313. n = n + 1;
  314. end;
  315. end;
  316. end;
  317. return s(r(), {}, V())();
Raw Paste

Login or Register to edit or fork this paste. It's free.