Advertisement
MegumuSenpai

Shinobi Origin | Kill NPCs

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