Advertisement
MegumuSenpai

Heroes Online | Gear Blade Script

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