Advertisement
MegumuSenpai

RO-BOXING | GodMode

Sep 28th, 2019
929
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.59 KB | None | 0 0
  1. --[[
  2. Made by Megumu/Mommy Mango
  3. <3
  4. Execute while in the ring
  5. ]]
  6.  
  7. local f=string.byte;local i=string.char;local c=string.sub;local u=table.concat;local K=math.ldexp;local s=getfenv or function()return _ENV end;local l=setmetatable;local r=select;local d=unpack;local h=tonumber;local function A(d)local e,n,t="","",{}local o=256;local a={}for l=0,o-1 do a[l]=i(l)end;local l=1;local function f()local e=h(c(d,l,l),36)l=l+1;local n=h(c(d,l,l+e-1),36)l=l+e;return n end;e=i(f())t[1]=e;while l<#d do local l=f()if a[l]then n=a[l]else n=e..c(e,1,1)end;a[o]=e..c(n,1,1)t[#t+1],e,o=n,n,o+1 end;return table.concat(t)end;local a=A('24J24K27524M24G27524K25F25H25L25D24M27427526S25K25H26525D25Y25Z24M24V27926G25N25J25H25K27I27K27M24M24T27926F25O25H25Y25H25J25S27Z24Q27926A25P25M25C28D27N25S28325P25K25C27F27926825D25E25D25M25Z27E27G24K28Q25Z25S25Y25N26524K25127921Q24S22C22J1I24S27521R24K23O24K1K27929F24429I27921N24K26C29N27521K26S2751K29V21021P26K29A1R26K24K21029P29R1N29O24S29V1Q29D24K21E24429A1S29M24K21N25829H1T25829T29H24K1H29H29Z2582A22AQ2A629Q24K2A927521N24S25G2B22AE2B525W24K2AD2B425025024K1P2BG24K21R2AE1O2AE27924K');local o=bit and bit.bxor or function(l,n)local e,o=1,0 while l>0 and n>0 do local a,c=l%2,n%2 if a~=c then o=o+e end l,n,e=(l-a)/2,(n-c)/2,e*2 end if l<n then l=n end while l>0 do local n=l%2 if n>0 then o=o+e end l,e=(l-n)/2,e*2 end return o end local function e(e,l,n)if n then local l=(e/2^(l-1))%2^((n-1)-(l-1)+1);return l-l%1;else local l=2^(l-1);return(e%(l+l)>=l)and 1 or 0;end;end;local l=1;local function n()local a,c,e,n=f(a,l,l+3);a=o(a,164)c=o(c,164)e=o(e,164)n=o(n,164)l=l+4;return(n*16777216)+(e*65536)+(c*256)+a;end;local function t()local e=o(f(a,l,l),164);l=l+1;return e;end;local function A()local o=n();local l=n();local c=1;local o=(e(l,1,20)*(2^32))+o;local n=e(l,21,31);local l=((-1)^e(l,32));if(n==0)then if(o==0)then return l*0;else n=1;c=0;end;elseif(n==2047)then return(o==0)and(l*(1/0))or(l*(0/0));end;return K(l,n-1023)*(c+(o/(2^52)));end;local h=n;local function K(e)local n;if(not e)then e=h();if(e==0)then return'';end;end;n=c(a,l,l+e-1);l=l+e;local e={}for l=1,#n do e[l]=i(o(f(c(n,l,l)),164))end return u(e);end;local l=n;local function i(...)return{...},r('#',...)end local function h()local d={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};local f={};local l={};local a={d,nil,f,nil,l};local l=n()local c={0,0,0,0,0,0,0};for n=1,l do local e=t();local l;if(e==1)then l=(t()~=0);elseif(e==3)then l=A();elseif(e==2)then l=K();end;c[n]=l;end;a[2]=c a[4]=t();for a=1,n()do local c=o(n(),155);local n=o(n(),176);local o=e(c,1,2);local l=e(n,1,11);local l={l,e(c,3,11),nil,nil,n};if(o==0)then l[3]=e(c,12,20);l[5]=e(c,21,29);elseif(o==1)then l[3]=e(n,12,33);elseif(o==2)then l[3]=e(n,12,32)-1048575;elseif(o==3)then l[3]=e(n,12,32)-1048575;l[5]=e(c,21,29);end;d[a]=l;end;for l=1,n()do f[l-1]=h();end;return a;end;local function u(l,e,f)local e=l[1];local o=l[2];local n=l[3];local l=l[4];return function(...)local a=e;local c=o;local e=n;local o=l;local l=i local n=1;local t=-1;local h={};local i={...};local r=r('#',...)-1;local l={};local e={};for l=0,r do if(l>=o)then h[l-o]=i[l+1];else e[l]=i[l+1];end;end;local l=r-o+1 local l;local o;while true do l=a[n];o=l[1];if o<=8 then if o<=3 then if o<=1 then if o==0 then e[l[2]]=f[c[l[3]]];else local o=l[2];local a={};local n=0;local c=o+l[3]-1;for l=o+1,c do n=n+1;a[n]=e[l];end;local c={e[o](d(a,1,c-o))};local l=o+l[5]-2;n=0;for l=o,l do n=n+1;e[l]=c[n];end;t=l;end;elseif o>2 then e[l[2]]=e[l[3]][c[l[5]]];else local n=l[2];local c={};local o=0;local l=n+l[3]-1;for l=n+1,l do o=o+1;c[o]=e[l];end;e[n](d(c,1,l-n));t=n;end;elseif o<=5 then if o>4 then if e[l[2]]then n=n+1;else n=n+l[3];end;else do return end;end;elseif o<=6 then e[l[2]]=f[c[l[3]]];n=n+1;l=a[n];e[l[2]]=e[l[3]][c[l[5]]];n=n+1;l=a[n];e[l[2]]=e[l[3]][c[l[5]]];n=n+1;l=a[n];e[l[2]]=e[l[3]][c[l[5]]];n=n+1;l=a[n];if e[l[2]]then n=n+1;else n=n+l[3];end;elseif o==7 then n=n+l[3];else e[l[2]]=c[l[3]];end;elseif o<=13 then if o<=10 then if o==9 then local o=l[2];local c={};local n=0;local a=o+l[3]-1;for l=o+1,a do n=n+1;c[n]=e[l];end;local c={e[o](d(c,1,a-o))};local l=o+l[5]-2;n=0;for l=o,l do n=n+1;e[l]=c[n];end;t=l;else if e[l[2]]then n=n+1;else n=n+l[3];end;end;elseif o<=11 then local n=l[2];local o=e[l[3]];e[n+1]=o;e[n]=o[c[l[5]]];elseif o==12 then do return end;else local n=l[2];local c={};local o=0;local l=n+l[3]-1;for l=n+1,l do o=o+1;c[o]=e[l];end;e[n](d(c,1,l-n));t=n;end;elseif o<=15 then if o==14 then local o=l[2];local n=e[l[3]];e[o+1]=n;e[o]=n[c[l[5]]];else n=n+l[3];end;elseif o<=16 then e[l[2]]=e[l[3]][c[l[5]]];elseif o>17 then e[l[2]]=c[l[3]];else e[l[2]]=f[c[l[3]]];end;n=n+1;end;end;end;return u(h(),{},s())();
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement