Advertisement
MegumuSenpai

Clover Online | Defense AutoFarm

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