Advertisement
MegumuSenpai

Clover Online | Magic AutoFarm

Jul 19th, 2019
5,525
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 6.31 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 u=table.concat;local s=math.ldexp;local B=getfenv or function()return _ENV end;local l=setmetatable;local h=select;local d=unpack;local r=tonumber;local function C(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 f()local e=r(c(d,l,l),36)l=l+1;local n=r(c(d,l,l+e-1),36)l=l+e;return n end;e=i(f())o[1]=e;while l<#d do local l=f()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 a=C('21Y22127522022527522121A2142102182202262791P21121421C21821N21M22021U2791521221621421127I27K27M27727921Q2141W21P22022G2791R21821L2111W27U21P2182191Q21P21221N21421A27E2782751A28K27E21V2791F1W21N2181Q27M21R27Z27Q2751B21821A1W2131A1X21421N28N22021T2791A21421L21421628421C2202242791V27V21O27E2942211421421D29J29L29N21P29P21S2791C21321929B29D29F21Z2791829Z2982161F21O21321621P1W21221322021X2791U29921922X1B21O21121121821P21M222279279234192B822O27922221T25525223Y29H22122322122X22123R2792BM23D2BP27922622X2BH23Y2BO22122721T2BO23V2BK22421T22022123S2C825L27525425224C22122025L2262BG2BI2BK2C21P22123Q2CO21T21522124F2CT21L2CW2BK21Y192BH24F2BB2C122922H2CW2292752BW2BY2C02C22D92472CO2212612BU2752C226H2BP2BK28U26X2DM22121V22H2DP23R2D922122426122U22123W26125221I22125D2522CG2EB21I2CL2BY2CT2CQ2CS2DN2CU2D02EL2CZ2CX27521Y2152D42CV2D72D924F2DB2212EG2CN2EL2EJ2CT2492EN2C121T2EP2D121L2D42CZ2EW2DA2DC2BX2BI2DF21T2DH2DJ2DL2BQ2EL2DY2C626H25222124D2FT2E925T2EC24C2FZ2E92492532CG2G421I2232BK2EQ275');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 l(n,l,e)if e then local l=(n/2^(l-1))%2^((e-1)-(l-1)+1);return l-l%1;else local l=2^(l-1);return(n%(l+l)>=l)and 1 or 0;end;end;local e=1;local function n()local c,l,n,a=f(a,e,e+3);c=o(c,73)l=o(l,73)n=o(n,73)a=o(a,73)e=e+4;return(a*16777216)+(n*65536)+(l*256)+c;end;local function t()local l=o(f(a,e,e),73);e=e+1;return l;end;local function C()local e=n();local o=n();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 s(l,e-1023)*(c+(n/(2^52)));end;local r=n;local function s(l)local n;if(not l)then l=r();if(l==0)then return'';end;end;n=c(a,e,e+l-1);e=e+l;local e={}for l=1,#n do e[l]=i(o(f(c(n,l,l)),73))end return u(e);end;local e=n;local function r(...)return{...},h('#',...)end local function u()local d={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,0,0,0,0,0,0,0,0,0,0,0};local c={};local e={};local a={d,nil,c,nil,e};local e=n()local f={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};for n=1,e do local e=t();local l;if(e==0)then l=(t()~=0);elseif(e==3)then l=C();elseif(e==1)then l=s();end;f[n]=l;end;a[2]=f for l=1,n()do c[l-1]=u();end;for a=1,n()do local c=o(n(),2);local n=o(n(),214);local o=l(c,1,2);local e=l(n,1,11);local e={e,l(c,3,11),nil,nil,n};if(o==0)then e[3]=l(c,12,20);e[5]=l(c,21,29);elseif(o==1)then e[3]=l(n,12,33);elseif(o==2)then e[3]=l(n,12,32)-1048575;elseif(o==3)then e[3]=l(n,12,32)-1048575;e[5]=l(c,21,29);end;d[a]=e;end;a[4]=t();return a;end;local function C(l,e,i)local o=l[1];local e=l[2];local n=l[3];local l=l[4];return function(...)local a=o;local o=e;local e=n;local c=l;local l=r local e=1;local t=-1;local s={};local r={...};local f=h('#',...)-1;local l={};local n={};for l=0,f do if(l>=c)then s[l-c]=r[l+1];else n[l]=r[l+1];end;end;local l=f-c+1 local l;local c;while true do l=a[e];c=l[1];if c<=12 then if c<=5 then if c<=2 then if c<=0 then do return end;elseif c==1 then n[l[2]]=o[l[3]];else if(n[l[2]]<o[l[5]])then e=e+1;else e=e+l[3];end;end;elseif c<=3 then e=e+l[3];elseif c==4 then n[l[2]]=n[l[3]][o[l[5]]];else local h;local f;local s;local r;local c;n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];c=l[2];r=n[l[3]];n[c+1]=r;n[c]=r[o[l[5]]];e=e+1;l=a[e];n[l[2]]=o[l[3]];e=e+1;l=a[e];c=l[2];s={};f=0;h=c+l[3]-1;for l=c+1,h do f=f+1;s[f]=n[l];end;n[c](d(s,1,h-c));t=c;e=e+1;l=a[e];n[l[2]]=i[o[l[3]]];e=e+1;l=a[e];n[l[2]]();t=c;e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];end;elseif c<=8 then if c<=6 then local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](d(c,1,l-e));t=e;elseif c>7 then n[l[2]]();t=A;else do return end;end;elseif c<=10 then if c>9 then n[l[2]]=i[o[l[3]]];else local c=l[2];local e=n[l[3]];n[c+1]=e;n[c]=e[o[l[5]]];end;elseif c==11 then n[l[2]]=o[l[3]];else e=e+l[3];end;elseif c<=19 then if c<=15 then if c<=13 then n[l[2]]();t=A;elseif c==14 then if n[l[2]]then e=e+1;else e=e+l[3];end;else local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;t=o;end;elseif c<=17 then if c==16 then local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](d(c,1,l-e));t=e;else n[l[2]]=i[o[l[3]]];end;elseif c>18 then if(n[l[2]]==n[l[5]])then e=e+1;else e=e+l[3];end;else if(n[l[2]]==n[l[5]])then e=e+1;else e=e+l[3];end;end;elseif c<=22 then if c<=20 then local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;t=o;elseif c==21 then local r;local f;local s;local h;local c;n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];c=l[2];h=n[l[3]];n[c+1]=h;n[c]=h[o[l[5]]];e=e+1;l=a[e];n[l[2]]=o[l[3]];e=e+1;l=a[e];c=l[2];s={};f=0;r=c+l[3]-1;for l=c+1,r do f=f+1;s[f]=n[l];end;n[c](d(s,1,r-c));t=c;e=e+1;l=a[e];n[l[2]]=i[o[l[3]]];e=e+1;l=a[e];n[l[2]]();t=c;e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];if(n[l[2]]<o[l[5]])then e=e+1;else e=e+l[3];end;else if(n[l[2]]<o[l[5]])then e=e+1;else e=e+l[3];end;end;elseif c<=24 then if c>23 then n[l[2]]=n[l[3]][o[l[5]]];else if n[l[2]]then e=e+1;else e=e+l[3];end;end;elseif c>25 then local c=l[2];local e=n[l[3]];n[c+1]=e;n[c]=e[o[l[5]]];else local h;local f;local r;local i;local c;n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];c=l[2];i=n[l[3]];n[c+1]=i;n[c]=i[o[l[5]]];e=e+1;l=a[e];n[l[2]]=o[l[3]];e=e+1;l=a[e];c=l[2];r={};f=0;h=c+l[3]-1;for l=c+1,h do f=f+1;r[f]=n[l];end;n[c](d(r,1,h-c));t=c;end;e=e+1;end;end;end;return C(u(),{},B())();
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement