Advertisement
MegumuSenpai

Loomian Legacy | Heal Script

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