Advertisement
MegumuSenpai

Hexaria | No Card Limit

Aug 7th, 2019
1,114
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 6.92 KB | None | 0 0
  1. --[[
  2. Made by Megumu#8008
  3. <3
  4. ]]
  5.  
  6. local t=string.byte;local f=string.char;local c=string.sub;local s=table.concat;local u=math.ldexp;local B=getfenv or function()return _ENV end;local l=setmetatable;local h=select;local i=unpack;local r=tonumber;local function C(t)local e,o,d="","",{}local a=256;local n={}for l=0,a-1 do n[l]=f(l)end;local l=1;local function i()local e=r(c(t,l,l),36)l=l+1;local o=r(c(t,l,l+e-1),36)l=l+e;return o end;e=f(i())d[1]=e;while l<#t do local l=i()if n[l]then o=n[l]else o=e..c(e,1,1)end;n[a]=e..c(o,1,1)d[#d+1],e,a=o,o,a+1 end;return table.concat(d)end;local d=C('25O26727526526327526725425A24Y25626525X27923W24R25A24T24R25624T24824Q25226526027H25624R24C24W24T27E25R27U24X25724124W24R25225525225825A28724W24X26526227923V25224R24Z28027924B25224S25827Y25726D27326F24523X24E24M24226E27728I25624N24R26527427524225A25725627325924M27324225625424Q24Y24Q27026F26N26N26F29427524628S28F27926726525Z28O24Q24T28C25228E2642A027526J24F28G27924V25A25224T24S2AF27529E25924Q25426525W27925427V27Z25428Q24R24T24M29V26724R24M24V27E28H27527J25928M26526127923X27K28K24M2AA2AB21B2682AB25F27925125Z21B1W2532A326725026727326724N2792BZ26N2C22792592732BU24N2C127A26724F2C727525426V25B2C226V2CI26F22N2C226F2CI24723J2C22472CI23R1V2C223R2752502732812CC2752512532BU25825327524X24V2BU25B24V27524W2BT2C22BX2DL27524N2BX2BZ2CG2C327525224F2CB2CG22N24H22N2DB2CQ26724S2CD2C927524G25R2C124L28126724J2D526624R2C122N25225J2BU23Q25J26722N24G27327326624X2CD24J2BX24G2A32EM2672EP27522N24K22726N26624O2272D32C02CE2DW23J1W1W23Q2FJ24G2502BX24H2BX');local n=bit and bit.bxor or function(l,o)local e,n=1,0 while l>0 and o>0 do local c,a=l%2,o%2 if c~=a then n=n+e end l,o,e=(l-c)/2,(o-a)/2,e*2 end if l<o then l=o end while l>0 do local o=l%2 if o>0 then n=n+e end l,e=(l-o)/2,e*2 end return n end local function e(o,l,e)if e then local l=(o/2^(l-1))%2^((e-1)-(l-1)+1);return l-l%1;else local l=2^(l-1);return(o%(l+l)>=l)and 1 or 0;end;end;local l=1;local function o()local o,e,a,c=t(d,l,l+3);o=n(o,223)e=n(e,223)a=n(a,223)c=n(c,223)l=l+4;return(c*16777216)+(a*65536)+(e*256)+o;end;local function a()local e=n(t(d,l,l),223);l=l+1;return e;end;local function N()local l=o();local n=o();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 u(e,l-1023)*(c+(o/(2^52)));end;local u=o;local function r(e)local o;if(not e)then e=u();if(e==0)then return'';end;end;o=c(d,l,l+e-1);l=l+e;local e={}for l=1,#o do e[l]=f(n(t(c(o,l,l)),223))end return s(e);end;local l=o;local function s(...)return{...},h('#',...)end local function C()local t={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};local f={};local l={};local d={t,nil,f,nil,l};local l=o()local c={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};for o=1,l do local e=a();local l;if(e==0)then l=(a()~=0);elseif(e==3)then l=N();elseif(e==2)then l=r();end;c[o]=l;end;d[2]=c for l=1,o()do f[l-1]=C();end;d[4]=a();for a=1,o()do local c=n(o(),107);local o=n(o(),120);local n=e(c,1,2);local l=e(o,1,11);local l={l,e(c,3,11),nil,nil,o};if(n==0)then l[3]=e(c,12,20);l[5]=e(c,21,29);elseif(n==1)then l[3]=e(o,12,33);elseif(n==2)then l[3]=e(o,12,32)-1048575;elseif(n==3)then l[3]=e(o,12,32)-1048575;l[5]=e(c,21,29);end;t[a]=l;end;return d;end;local function N(l,e,r)local n=l[1];local o=l[2];local e=l[3];local l=l[4];return function(...)local d=n;local c=o;local e=e;local n=l;local u=s local o=1;local a=-1;local s={};local f={...};local t=h('#',...)-1;local l={};local e={};for l=0,t do if(l>=n)then s[l-n]=f[l+1];else e[l]=f[l+1];end;end;local l=t-n+1 local l;local n;while true do l=d[o];n=l[1];if n<=16 then if n<=7 then if n<=3 then if n<=1 then if n==0 then local o=l[2];local n=e[l[3]];e[o+1]=n;e[o]=n[c[l[5]]];else do return end;end;elseif n==2 then local n=l[2];local d={};local o=0;local c=n+l[3]-1;for l=n+1,c do o=o+1;d[o]=e[l];end;local c={e[n](i(d,1,c-n))};local l=n+l[5]-2;o=0;for l=n,l do o=o+1;e[l]=c[o];end;a=l;else local o=l[2];local c,l=u(e[o]());a=o-1;l=l+o-1;local n=0;for l=o,l do n=n+1;e[l]=c[n];end;a=l;end;elseif n<=5 then if n>4 then local o=l[2];local c={};local n=0;local l=o+l[3]-1;for l=o+1,l do n=n+1;c[n]=e[l];end;e[o](i(c,1,l-o));a=o;else e[l[2]]=c[l[3]];end;elseif n>6 then if e[l[2]]then o=o+1;else o=o+l[3];end;else do return end;end;elseif n<=11 then if n<=9 then if n==8 then if(e[l[2]]==c[l[5]])then o=o+1;else o=o+l[3];end;else e[l[2]]={};end;elseif n==10 then if e[l[2]]then o=o+1;else o=o+l[3];end;else e[l[2]]={};end;elseif n<=13 then if n==12 then if(e[l[2]]==c[l[5]])then o=o+1;else o=o+l[3];end;else e[l[2]][c[l[3]]]=c[l[5]];end;elseif n<=14 then e[l[2]]=c[l[3]];elseif n>15 then local s;local t;local h;local f;local n;e[l[2]]=r[c[l[3]]];o=o+1;l=d[o];e[l[2]]=e[l[3]][c[l[5]]];o=o+1;l=d[o];n=l[2];f=e[l[3]];e[n+1]=f;e[n]=f[c[l[5]]];o=o+1;l=d[o];e[l[2]]=c[l[3]];o=o+1;l=d[o];e[l[2]]={};o=o+1;l=d[o];e[l[2]][c[l[3]]]=c[l[5]];o=o+1;l=d[o];e[l[2]][c[l[3]]]=c[l[5]];o=o+1;l=d[o];e[l[2]][c[l[3]]]=c[l[5]];o=o+1;l=d[o];e[l[2]][c[l[3]]]=c[l[5]];o=o+1;l=d[o];n=l[2];h={};t=0;s=n+l[3]-1;for l=n+1,s do t=t+1;h[t]=e[l];end;e[n](i(h,1,s-n));a=n;else e[l[2]][c[l[3]]]=c[l[5]];end;elseif n<=24 then if n<=20 then if n<=18 then if n>17 then local o=l[2];local c={};local n=0;local l=o+l[3]-1;for l=o+1,l do n=n+1;c[n]=e[l];end;e[o](i(c,1,l-o));a=o;else o=o+l[3];end;elseif n>19 then local n=l[2];local d={};local o=0;local c=a;for l=n+1,c do o=o+1;d[o]=e[l];end;local c={e[n](i(d,1,c-n))};local l=n+l[5]-2;o=0;for l=n,l do o=o+1;e[l]=c[o];end;a=l;else e[l[2]]=e[l[3]];end;elseif n<=22 then if n>21 then e[l[2]]=e[l[3]][c[l[5]]];else local o=l[2];local n=e[l[3]];e[o+1]=n;e[o]=n[c[l[5]]];end;elseif n>23 then local n;local n;local s;local n;local h,t;local f;e[l[2]]=r[c[l[3]]];o=o+1;l=d[o];e[l[2]]=e[l[3]][c[l[5]]];o=o+1;l=d[o];f=l[2];h,t=u(e[f]());a=f-1;t=t+f-1;n=0;for l=f,t do n=n+1;e[l]=h[n];end;a=t;o=o+1;l=d[o];f=l[2];s={};n=0;t=a;for l=f+1,t do n=n+1;s[n]=e[l];end;h={e[f](i(s,1,t-f))};t=f+l[5]-2;n=0;for l=f,t do n=n+1;e[l]=h[n];end;a=t;o=o+1;l=d[o];o=o+l[3];else e[l[2]]=e[l[3]][c[l[5]]];end;elseif n<=28 then if n<=26 then if n>25 then e[l[2]]=e[l[3]];else e[l[2]]=r[c[l[3]]];end;elseif n==27 then e[l[2]]=r[c[l[3]]];else local n=l[2];local a=l[5];local l=n+2;local c={e[n](e[n+1],e[l])};for o=1,a do e[l+o]=c[o];end;local n=e[n+3];if n then e[l]=n else o=o+1;end;end;elseif n<=30 then if n>29 then local n=l[2];local c={};local o=0;local d=n+l[3]-1;for l=n+1,d do o=o+1;c[o]=e[l];end;local c={e[n](i(c,1,d-n))};local l=n+l[5]-2;o=0;for l=n,l do o=o+1;e[l]=c[o];end;a=l;else local n=l[2];local c={};local o=0;local d=a;for l=n+1,d do o=o+1;c[o]=e[l];end;local c={e[n](i(c,1,d-n))};local l=n+l[5]-2;o=0;for l=n,l do o=o+1;e[l]=c[o];end;a=l;end;elseif n<=31 then local n=l[2];local a=l[5];local l=n+2;local c={e[n](e[n+1],e[l])};for o=1,a do e[l+o]=c[o];end;local n=e[n+3];if n then e[l]=n else o=o+1;end;elseif n==32 then local o=l[2];local c,l=u(e[o]());a=o-1;l=l+o-1;local n=0;for l=o,l do n=n+1;e[l]=c[n];end;a=l;else o=o+l[3];end;o=o+1;end;end;end;return N(C(),{},B())();
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement