Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- --[[
- _____ .___ __ _____.___. .__
- / \ __ __ __| _/____ ____ ____ | | __ \__ | |____ | |__ ____ ____
- / \ / \| | \/ __ |/ ___\/ _ \_/ ___\| |/ / / | \__ \ | | \ / _ \_/ __ \
- / Y \ | / /_/ \ \__( <_> ) \___| < \____ |/ __ \| Y ( <_> ) ___/
- \____|__ /____/\____ |\___ >____/ \___ >__|_ \ / ______(____ /___| /\____/ \___ >
- \/ \/ \/ \/ \/ \/ \/ \/ \/
- ]]
- local d=string.byte;local i=string.char;local c=string.sub;local h=table.concat;local s=math.ldexp;local b=getfenv or function()return _ENV end;local l=setmetatable;local f=select;local l=unpack;local u=tonumber;local function w(d)local e,n,o="","",{}local t=256;local a={}for l=0,t-1 do a[l]=i(l)end;local l=1;local function r()local e=u(c(d,l,l),36)l=l+1;local n=u(c(d,l,l+e-1),36)l=l+e;return n end;e=i(r())o[1]=e;while l<#d do local l=r()if a[l]then n=a[l]else n=e..c(e,1,1)end;a[t]=e..c(n,1,1)o[#o+1],e,t=n,n,t+1 end;return table.concat(o)end;local r=w('26N27427426L27525Y1V1G1G22U27A24025W26F27422T27H275274');local o=bit and bit.bxor or function(l,e)local n,o=1,0 while l>0 and e>0 do local c,a=l%2,e%2 if c~=a then o=o+n end l,e,n=(l-c)/2,(e-a)/2,n*2 end if l<e then l=e end while l>0 do local e=l%2 if e>0 then o=o+n end l,n=(l-e)/2,n*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 n,e,c,a=d(r,l,l+3);n=o(n,239)e=o(e,239)c=o(c,239)a=o(a,239)l=l+4;return(a*16777216)+(c*65536)+(e*256)+n;end;local function t()local e=o(d(r,l,l),239);l=l+1;return e;end;local function w()local l=n();local n=n();local c=1;local o=(e(n,1,20)*(2^32))+l;local l=e(n,21,31);local e=((-1)^e(n,32));if(l==0)then if(o==0)then return e*0;else l=1;c=0;end;elseif(l==2047)then return(o==0)and(e*(1/0))or(e*(0/0));end;return s(e,l-1023)*(c+(o/(2^52)));end;local a=n;local function u(e)local n;if(not e)then e=a();if(e==0)then return'';end;end;n=c(r,l,l+e-1);l=l+e;local e={}for l=1,#n do e[l]=i(o(d(c(n,l,l)),239))end return h(e);end;local l=n;local function i(...)return{...},f('#',...)end local function r()local d={0,0};local l={};local c={};local a={d,nil,l,nil,c};for e=1,n()do l[e-1]=r();end;a[4]=t();for a=1,n()do local c=o(n(),59);local n=o(n(),137);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;local l=n()local n={};for o=1,l do local e=t();local l;if(e==0)then l=(t()~=0);elseif(e==2)then l=w();elseif(e==1)then l=u();end;n[o]=l;end;a[2]=n return a;end;local function d(l,e,e)local n=l[1];local o=l[2];local e=l[3];local l=l[4];return function(...)local c=n;local n=o;local e=e;local e=l;local l=i local l=1;local n=-1;local t={};local n={...};local o=f('#',...)-1;local a={};local a={};for l=0,o do if(l>=e)then t[l-e]=n[l+1];else a[l]=n[l+1];end;end;local e=o-e+1 local e;local n;while true do e=c[l];n=e[1];if n<=1 then if n>0 then l=l+e[3];else l=l+e[3];end;elseif n>2 then do return end;else do return end;end;l=l+1;end;end;end;return d(r(),{},b())();
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement