API tools faq
paste
FurkingBoi

sky block

FurkingBoi
Jun 26th, 2020
2,894
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 30.72 KB | None | 0 0
raw download clone embed print report
  1.  
  2. local d = string.byte
  3. local i = string.char
  4. local c = string.sub
  5. local s = table.concat
  6. local P = math.ldexp
  7. local G = getfenv or function()
  8. return _ENV
  9. end
  10. local e = setmetatable
  11. local K = select
  12. local f = unpack
  13. local h = tonumber
  14. local function r(f)
  15. local l, n, t = "", "", {}
  16. local a = 256
  17. local o = {}
  18. for e = 0, a - 1 do
  19. o[e] = i(e)
  20. end
  21. local e = 1
  22. local function d()
  23. local l = h(c(f, e, e), 36)
  24. e = e + 1
  25. local n = h(c(f, e, e + l - 1), 36)
  26. e = e + l
  27. return n
  28. end
  29. l = i(d())
  30. t[1] = l
  31. while e < #f do
  32. local e = d()
  33. if o[e] then
  34. n = o[e]
  35. else
  36. n = l .. c(l, 1, 1)
  37. end
  38. o[a] = l .. c(n, 1, 1)
  39. t[#t + 1], l, a = n, n, a + 1
  40. end
  41. return table.concat(t)
  42. end
  43. local t =
  44. r(
  45. "24V25K27525A25C21K21J21U25C27525626027922B26027525725C26W25K22B27C25K24U26G27G26G27524N27U27N27X24M26W27G27M25K24N28322B28328527I28727524E26827G26827524A28121J28B25K24B23K25425K23H23K27524628J22228324724822027N24827524327527N29523Y23K27G28S25K23U24827G29225K23Q24027G24027523X27S28K27U22027329G23C29G26Z24W27523C29X25K27326027U1J27I25K24329X25L23I2A024322021K25K23I29025K23X1021J21J23E2AL25323Y24O27922024O27523U29J21J22029L25K23R28322828323M2AY2B027523T21C21L21J23821C25L22026Z22023C25K21Z2AI26Z21S1O25K22621S2752BP2BL22B2BU25K26V23S27522B2C225K26R26O2C32C825K26N29B22B29B26J28628326F2AI22B2AI26B2CK2AI26N26G27U22B27X26N24023S25L22B2B126J29B23C29B26F2AV25K22Y2D626B2BZ2BY2752672DB2BZ26J2CR27Y27526J2402482CY2B126B22W2C32DR25K26722O2C32DW25K26A23427G23427526B2E327N2E62E528A2E62622B82B125Y2992AZ29B24825C25425L22X27C22025929522Z2752EP24W27922Z29X2202EJ2202EM2EO2EQ2752ES25K2EP2AS21J22Z2AV22025V23421425K21X2E625R182FG21X1827525S25C1825L22L2F325K2EW2ET25Z1O22G25L2352BR25K25N23423C25L2232E625N1W2FG22N1W27525J182FS22B2FO25K25J21K2FG22B2AF25K263102GQ102DD2GS2GR2E42GG27N2H225924O2AM22B2H625326825C2F122E2FV2FX2F726B2GM23C2GM2EJ2EL2EN2F72F425K2F62EP23S2EW2C22FD2FF2FH2E62EJ2G822F2HF2FA2FY2G02G22G425R2G72G92FJ2142FG23G2FG2GT2GV25K2312GX25K26B2IH23C2IH2592282AM22Z2IT25326R2G423C2G426N1G29Y2J32B229523A29525921C25J2HR21C21J2IX24026W25L21W2B124F22G2JI22M22G2BA21K21H2AN2JS25324Z2C523C2C524V2D229B2742752J82752JA2JC22Z2JE25324V27P23J27P25727X22T27X25B25K27U23729525B25C27I22K27P2KQ27522G27P29525K25I29525N25E29524K24N24P24S25725825624H24M24V25N25O29524V24P24L24T25N25R29523K25825825423Z24T25825N26H29527323T21N25121U23W23226W25E22O23C112141A26I26R21A22921E2611I23W230131U25N21621V1M25U1924M22525N2KZ25N25Q2952LA2LC2LE25N2MX27J25924Q2LG29524R24G24P25625L2KZ2KZ2NG2KZ21424N2CX2NH2FW26V25N26J29524727122725H21D25221T25Z24Y111B23922522W23N24D1021E22L25021P2721D23821D23N22B1L23H24L23H26V1B21D23E2NJ29522023T2NN2NO23S2K425K2OT2P22952OT2NI2P42P72752P32P92P82P12PC2PA2PD2PB2PH2PG2PJ2PF2PL2PE2PN2PI2PM2PP2PO2PK2PS2PQ2PJ2NO2PR2PY2PT2NO2PF2P62PZ2PV2Q52PU2Q72PZ2Q32Q02QB2Q62PI2PX2QF2QC2QG2QI2QD2PW"
  46. )
  47. local o = bit and bit.bxor or function(e, l)
  48. local n, o = 1, 0
  49. while e > 0 and l > 0 do
  50. local a, c = e % 2, l % 2
  51. if a ~= c then
  52. o = o + n
  53. end
  54. e, l, n = (e - a) / 2, (l - c) / 2, n * 2
  55. end
  56. if e < l then
  57. e = l
  58. end
  59. while e > 0 do
  60. local l = e % 2
  61. if l > 0 then
  62. o = o + n
  63. end
  64. e, n = (e - l) / 2, n * 2
  65. end
  66. return o
  67. end
  68. local function e(n, e, l)
  69. if l then
  70. local e = (n / 2 ^ (e - 1)) % 2 ^ ((l - 1) - (e - 1) + 1)
  71. return e - e % 1
  72. else
  73. local e = 2 ^ (e - 1)
  74. return (n % (e + e) >= e) and 1 or 0
  75. end
  76. end
  77. local l = 1
  78. local function n()
  79. local c, a, n, e = d(t, l, l + 3)
  80. c = o(c, 200)
  81. a = o(a, 200)
  82. n = o(n, 200)
  83. e = o(e, 200)
  84. l = l + 4
  85. return (e * 16777216) + (n * 65536) + (a * 256) + c
  86. end
  87. local function a()
  88. local e = o(d(t, l, l), 200)
  89. l = l + 1
  90. return e
  91. end
  92. local function N()
  93. local l = n()
  94. local o = n()
  95. local c = 1
  96. local n = (e(o, 1, 20) * (2 ^ 32)) + l
  97. local l = e(o, 21, 31)
  98. local e = ((-1) ^ e(o, 32))
  99. if (l == 0) then
  100. if (n == 0) then
  101. return e * 0
  102. else
  103. l = 1
  104. c = 0
  105. end
  106. elseif (l == 2047) then
  107. return (n == 0) and (e * (1 / 0)) or (e * (0 / 0))
  108. end
  109. return P(e, l - 1023) * (c + (n / (2 ^ 52)))
  110. end
  111. local r = n
  112. local function h(e)
  113. local n
  114. if (not e) then
  115. e = r()
  116. if (e == 0) then
  117. return ""
  118. end
  119. end
  120. n = c(t, l, l + e - 1)
  121. l = l + e
  122. local l = {}
  123. for e = 1, #n do
  124. l[e] = i(o(d(c(n, e, e)), 200))
  125. end
  126. return s(l)
  127. end
  128. local l = n
  129. local function r(...)
  130. return {...}, K("#", ...)
  131. end
  132. local function P()
  133. local d = {
  134. 0,
  135. 0,
  136. 0,
  137. 0,
  138. 0,
  139. 0,
  140. 0,
  141. 0,
  142. 0,
  143. 0,
  144. 0,
  145. 0,
  146. 0,
  147. 0,
  148. 0,
  149. 0,
  150. 0,
  151. 0,
  152. 0,
  153. 0,
  154. 0,
  155. 0,
  156. 0,
  157. 0,
  158. 0,
  159. 0,
  160. 0,
  161. 0,
  162. 0,
  163. 0,
  164. 0,
  165. 0,
  166. 0,
  167. 0,
  168. 0,
  169. 0,
  170. 0,
  171. 0,
  172. 0,
  173. 0,
  174. 0,
  175. 0,
  176. 0,
  177. 0,
  178. 0,
  179. 0,
  180. 0,
  181. 0,
  182. 0,
  183. 0,
  184. 0,
  185. 0,
  186. 0,
  187. 0,
  188. 0,
  189. 0,
  190. 0,
  191. 0,
  192. 0,
  193. 0,
  194. 0,
  195. 0,
  196. 0,
  197. 0,
  198. 0,
  199. 0,
  200. 0,
  201. 0,
  202. 0,
  203. 0,
  204. 0,
  205. 0,
  206. 0,
  207. 0,
  208. 0,
  209. 0,
  210. 0,
  211. 0,
  212. 0,
  213. 0,
  214. 0,
  215. 0,
  216. 0,
  217. 0,
  218. 0,
  219. 0,
  220. 0,
  221. 0,
  222. 0,
  223. 0,
  224. 0,
  225. 0,
  226. 0,
  227. 0,
  228. 0,
  229. 0,
  230. 0,
  231. 0,
  232. 0,
  233. 0,
  234. 0,
  235. 0,
  236. 0
  237. }
  238. local f = {}
  239. local i = {}
  240. local t = {d, nil, f, nil, i}
  241. for a = 1, n() do
  242. local c = o(n(), 119)
  243. local n = o(n(), 155)
  244. local o = e(c, 1, 2)
  245. local l = e(n, 1, 11)
  246. local l = {l, e(c, 3, 11), nil, nil, n}
  247. if (o == 0) then
  248. l[3] = e(c, 12, 20)
  249. l[5] = e(c, 21, 29)
  250. elseif (o == 1) then
  251. l[3] = e(n, 12, 33)
  252. elseif (o == 2) then
  253. l[3] = e(n, 12, 32) - 1048575
  254. elseif (o == 3) then
  255. l[3] = e(n, 12, 32) - 1048575
  256. l[5] = e(c, 21, 29)
  257. end
  258. d[a] = l
  259. end
  260. for e = 1, n() do
  261. f[e - 1] = P()
  262. end
  263. local e = n()
  264. local o = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
  265. for n = 1, e do
  266. local l = a()
  267. local e
  268. if (l == 2) then
  269. e = (a() ~= 0)
  270. elseif (l == 1) then
  271. e = N()
  272. elseif (l == 3) then
  273. e = h()
  274. end
  275. o[n] = e
  276. end
  277. t[2] = o
  278. for e = 1, n() do
  279. i[e] = n()
  280. end
  281. t[4] = a()
  282. return t
  283. end
  284. local N = pcall
  285. local function C(h, e, d)
  286. local c = h[1]
  287. local l = h[2]
  288. local e = h[3]
  289. local o = h[4]
  290. return function(...)
  291. local n = 1
  292. local t = -1
  293. local s = {...}
  294. local i = K("#", ...) - 1
  295. local function P()
  296. local c = c
  297. local a = l
  298. local e = e
  299. local o = o
  300. local r = r
  301. local h = {}
  302. local e = {}
  303. local l = {}
  304. for e = 0, i do
  305. if (e >= o) then
  306. h[e - o] = s[e + 1]
  307. else
  308. l[e] = s[e + 1]
  309. end
  310. end
  311. local e = i - o + 1
  312. local e
  313. local o
  314. while true do
  315. e = c[n]
  316. o = e[1]
  317. if o <= 32 then
  318. if o <= 15 then
  319. if o <= 7 then
  320. if o <= 3 then
  321. if o <= 1 then
  322. if o == 0 then
  323. l[e[2]] = d[a[e[3]]]
  324. else
  325. local o = e[2]
  326. local a = l[o + 2]
  327. local c = l[o] + a
  328. l[o] = c
  329. if a > 0 then
  330. if c <= l[o + 1] then
  331. n = n + e[3]
  332. l[o + 3] = c
  333. end
  334. elseif c >= l[o + 1] then
  335. n = n + e[3]
  336. l[o + 3] = c
  337. end
  338. end
  339. elseif o == 2 then
  340. local o = e[2]
  341. local n = l[e[3]]
  342. l[o + 1] = n
  343. l[o] = n[a[e[5]]]
  344. else
  345. l[e[2]] = #l[e[3]]
  346. end
  347. elseif o <= 5 then
  348. if o == 4 then
  349. if (a[e[2]] < l[e[5]]) then
  350. n = n + 1
  351. else
  352. n = n + e[3]
  353. end
  354. else
  355. if (l[e[2]] < l[e[5]]) then
  356. n = n + 1
  357. else
  358. n = n + e[3]
  359. end
  360. end
  361. elseif o == 6 then
  362. local o = e[3]
  363. local n = l[o]
  364. for e = o + 1, e[5] do
  365. n = n .. l[e]
  366. end
  367. l[e[2]] = n
  368. else
  369. l[e[2]] = l[e[3]] - a[e[5]]
  370. end
  371. elseif o <= 11 then
  372. if o <= 9 then
  373. if o == 8 then
  374. l[e[2]] = d[a[e[3]]]
  375. else
  376. local n = e[2]
  377. local o = l[e[3]]
  378. l[n + 1] = o
  379. l[n] = o[a[e[5]]]
  380. end
  381. elseif o > 10 then
  382. do
  383. return
  384. end
  385. else
  386. l[e[2]] = l[e[3]][a[e[5]]]
  387. end
  388. elseif o <= 13 then
  389. if o == 12 then
  390. l[e[2]] = l[e[3]] / a[e[5]]
  391. n = n + 1
  392. e = c[n]
  393. l[e[2]] = l[e[3]] - l[e[5]]
  394. n = n + 1
  395. e = c[n]
  396. l[e[2]] = l[e[3]] / a[e[5]]
  397. n = n + 1
  398. e = c[n]
  399. l[e[2]] = l[e[3]] * a[e[5]]
  400. n = n + 1
  401. e = c[n]
  402. l[e[2]] = l[e[3]]
  403. n = n + 1
  404. e = c[n]
  405. l[e[2]] = l[e[3]]
  406. n = n + 1
  407. e = c[n]
  408. n = n + e[3]
  409. else
  410. local o = e[3]
  411. local n = l[o]
  412. for e = o + 1, e[5] do
  413. n = n .. l[e]
  414. end
  415. l[e[2]] = n
  416. end
  417. elseif o > 14 then
  418. l[e[2]]()
  419. t = A
  420. else
  421. if (l[e[2]] ~= l[e[5]]) then
  422. n = n + 1
  423. else
  424. n = n + e[3]
  425. end
  426. end
  427. elseif o <= 23 then
  428. if o <= 19 then
  429. if o <= 17 then
  430. if o == 16 then
  431. l[e[2]] = l[e[3]] % a[e[5]]
  432. else
  433. local t
  434. local o
  435. l[e[2]] = d[a[e[3]]]
  436. n = n + 1
  437. e = c[n]
  438. l[e[2]] = d[a[e[3]]]
  439. n = n + 1
  440. e = c[n]
  441. o = e[2]
  442. t = l[e[3]]
  443. l[o + 1] = t
  444. l[o] = t[a[e[5]]]
  445. n = n + 1
  446. e = c[n]
  447. l[e[2]] = a[e[3]]
  448. n = n + 1
  449. e = c[n]
  450. l[e[2]] = l[e[3]]
  451. n = n + 1
  452. e = c[n]
  453. l[e[2]] = l[e[3]]
  454. n = n + 1
  455. e = c[n]
  456. l[e[2]] = l[e[3]]
  457. n = n + 1
  458. e = c[n]
  459. l[e[2]] = l[e[3]]
  460. n = n + 1
  461. e = c[n]
  462. l[e[2]] = a[e[3]]
  463. n = n + 1
  464. e = c[n]
  465. l[e[2]] = d[a[e[3]]]
  466. end
  467. elseif o == 18 then
  468. l[e[2]] = l[e[3]] / a[e[5]]
  469. else
  470. local o = e[2]
  471. local c = {}
  472. local n = 0
  473. local a = o + e[3] - 1
  474. for e = o + 1, a do
  475. n = n + 1
  476. c[n] = l[e]
  477. end
  478. local c = {l[o](f(c, 1, a - o))}
  479. local e = o + e[5] - 2
  480. n = 0
  481. for e = o, e do
  482. n = n + 1
  483. l[e] = c[n]
  484. end
  485. t = e
  486. end
  487. elseif o <= 21 then
  488. if o > 20 then
  489. l[e[2]] = l[e[3]] + a[e[5]]
  490. else
  491. l[e[2]] = l[e[3]] - a[e[5]]
  492. end
  493. elseif o == 22 then
  494. l[e[2]] = l[e[3]] % a[e[5]]
  495. else
  496. l[e[2]] = l[e[3]][l[e[5]]]
  497. end
  498. elseif o <= 27 then
  499. if o <= 25 then
  500. if o == 24 then
  501. l[e[2]] = l[e[3]] - l[e[5]]
  502. else
  503. local o
  504. l[e[2]] = d[a[e[3]]]
  505. n = n + 1
  506. e = c[n]
  507. l[e[2]] = l[e[3]][a[e[5]]]
  508. n = n + 1
  509. e = c[n]
  510. l[e[2]] = {}
  511. n = n + 1
  512. e = c[n]
  513. l[e[2]] = a[e[3]]
  514. n = n + 1
  515. e = c[n]
  516. l[e[2]] = a[e[3]]
  517. n = n + 1
  518. e = c[n]
  519. l[e[2]] = a[e[3]]
  520. n = n + 1
  521. e = c[n]
  522. o = e[2]
  523. l[o] = l[o] - l[o + 2]
  524. n = n + e[3]
  525. end
  526. elseif o == 26 then
  527. l[e[2]] = l[e[3]] + a[e[5]]
  528. else
  529. l[e[2]] = a[e[3]]
  530. end
  531. elseif o <= 29 then
  532. if o > 28 then
  533. local s
  534. local i
  535. local o
  536. local h
  537. local d
  538. l[e[2]] = l[e[3]] % a[e[5]]
  539. n = n + 1
  540. e = c[n]
  541. l[e[2]] = l[e[3]] + a[e[5]]
  542. n = n + 1
  543. e = c[n]
  544. l[e[2]] = l[e[3]]
  545. n = n + 1
  546. e = c[n]
  547. l[e[2]] = l[e[3]]
  548. n = n + 1
  549. e = c[n]
  550. l[e[2]] = l[e[3]]
  551. n = n + 1
  552. e = c[n]
  553. l[e[2]] = l[e[3]]
  554. n = n + 1
  555. e = c[n]
  556. l[e[2]] = l[e[3]]
  557. n = n + 1
  558. e = c[n]
  559. l[e[2]] = l[e[3]]
  560. n = n + 1
  561. e = c[n]
  562. d = e[2]
  563. h = {}
  564. o = 0
  565. i = d + e[3] - 1
  566. for e = d + 1, i do
  567. o = o + 1
  568. h[o] = l[e]
  569. end
  570. s = {l[d](f(h, 1, i - d))}
  571. i = d + e[5] - 2
  572. o = 0
  573. for e = d, i do
  574. o = o + 1
  575. l[e] = s[o]
  576. end
  577. t = i
  578. n = n + 1
  579. e = c[n]
  580. l[e[2]] = l[e[3]][l[e[5]]]
  581. else
  582. l[e[2]] = (e[3] ~= 0)
  583. end
  584. elseif o <= 30 then
  585. l[e[2]] = l[e[3]]
  586. elseif o > 31 then
  587. local o = e[2]
  588. local a = {}
  589. local n = 0
  590. local c = t
  591. for e = o + 1, c do
  592. n = n + 1
  593. a[n] = l[e]
  594. end
  595. local c = {l[o](f(a, 1, c - o))}
  596. local e = o + e[5] - 2
  597. n = 0
  598. for e = o, e do
  599. n = n + 1
  600. l[e] = c[n]
  601. end
  602. t = e
  603. else
  604. if (l[e[2]] ~= l[e[5]]) then
  605. n = n + 1
  606. else
  607. n = n + e[3]
  608. end
  609. end
  610. elseif o <= 49 then
  611. if o <= 40 then
  612. if o <= 36 then
  613. if o <= 34 then
  614. if o == 33 then
  615. l[e[2]] = l[e[3]] * a[e[5]]
  616. else
  617. l[e[2]] = l[e[3]] + l[e[5]]
  618. end
  619. elseif o == 35 then
  620. l[e[2]] = l[e[3]][l[e[5]]]
  621. else
  622. local o = e[2]
  623. l[o] = l[o] - l[o + 2]
  624. n = n + e[3]
  625. end
  626. elseif o <= 38 then
  627. if o > 37 then
  628. l[e[2]] = {}
  629. else
  630. t = e[2]
  631. end
  632. elseif o > 39 then
  633. if (a[e[2]] < l[e[5]]) then
  634. n = n + 1
  635. else
  636. n = n + e[3]
  637. end
  638. else
  639. local o = e[2]
  640. l[o] = l[o] - l[o + 2]
  641. n = n + e[3]
  642. end
  643. elseif o <= 44 then
  644. if o <= 42 then
  645. if o > 41 then
  646. if (l[e[2]] < l[e[5]]) then
  647. n = n + 1
  648. else
  649. n = n + e[3]
  650. end
  651. else
  652. local o = e[2]
  653. local a = l[o + 2]
  654. local c = l[o] + a
  655. l[o] = c
  656. if a > 0 then
  657. if c <= l[o + 1] then
  658. n = n + e[3]
  659. l[o + 3] = c
  660. end
  661. elseif c >= l[o + 1] then
  662. n = n + e[3]
  663. l[o + 3] = c
  664. end
  665. end
  666. elseif o == 43 then
  667. l[e[2]] = l[e[3]]
  668. else
  669. l[e[2]] = (e[3] ~= 0)
  670. end
  671. elseif o <= 46 then
  672. if o == 45 then
  673. l[e[2]][l[e[3]]] = l[e[5]]
  674. else
  675. l[e[2]] = l[e[3]][a[e[5]]]
  676. end
  677. elseif o <= 47 then
  678. l[e[2]] = l[e[3]] / a[e[5]]
  679. elseif o > 48 then
  680. l[e[2]] = a[e[3]]
  681. else
  682. l[e[2]] = l[e[3]] - l[e[5]]
  683. end
  684. elseif o <= 57 then
  685. if o <= 53 then
  686. if o <= 51 then
  687. if o == 50 then
  688. if (a[e[2]] >= l[e[5]]) then
  689. n = n + 1
  690. else
  691. n = n + e[3]
  692. end
  693. else
  694. n = n + e[3]
  695. end
  696. elseif o == 52 then
  697. local o = e[2]
  698. local a = {}
  699. local n = 0
  700. local c = t
  701. for e = o + 1, c do
  702. n = n + 1
  703. a[n] = l[e]
  704. end
  705. local c = {l[o](f(a, 1, c - o))}
  706. local e = o + e[5] - 2
  707. n = 0
  708. for e = o, e do
  709. n = n + 1
  710. l[e] = c[n]
  711. end
  712. t = e
  713. else
  714. local o = e[2]
  715. local c = {}
  716. local n = 0
  717. local e = o + e[3] - 1
  718. for e = o + 1, e do
  719. n = n + 1
  720. c[n] = l[e]
  721. end
  722. local c, e = r(l[o](f(c, 1, e - o)))
  723. e = e + o - 1
  724. n = 0
  725. for e = o, e do
  726. n = n + 1
  727. l[e] = c[n]
  728. end
  729. t = e
  730. end
  731. elseif o <= 55 then
  732. if o == 54 then
  733. local o = e[2]
  734. local c = {}
  735. local n = 0
  736. local e = o + e[3] - 1
  737. for e = o + 1, e do
  738. n = n + 1
  739. c[n] = l[e]
  740. end
  741. local c, e = r(l[o](f(c, 1, e - o)))
  742. e = e + o - 1
  743. n = 0
  744. for e = o, e do
  745. n = n + 1
  746. l[e] = c[n]
  747. end
  748. t = e
  749. else
  750. do
  751. return
  752. end
  753. end
  754. elseif o == 56 then
  755. n = n + e[3]
  756. else
  757. local h
  758. local d
  759. local o
  760. local i
  761. local a
  762. l[e[2]] = l[e[3]]
  763. n = n + 1
  764. e = c[n]
  765. l[e[2]] = l[e[3]]
  766. n = n + 1
  767. e = c[n]
  768. l[e[2]] = l[e[3]]
  769. n = n + 1
  770. e = c[n]
  771. a = e[2]
  772. i = {}
  773. o = 0
  774. d = a + e[3] - 1
  775. for e = a + 1, d do
  776. o = o + 1
  777. i[o] = l[e]
  778. end
  779. h = {l[a](f(i, 1, d - a))}
  780. d = a + e[5] - 2
  781. o = 0
  782. for e = a, d do
  783. o = o + 1
  784. l[e] = h[o]
  785. end
  786. t = d
  787. n = n + 1
  788. e = c[n]
  789. l[e[2]] = l[e[3]][l[e[5]]]
  790. n = n + 1
  791. e = c[n]
  792. l[e[2]] = l[e[3]]
  793. n = n + 1
  794. e = c[n]
  795. l[e[2]] = l[e[3]]
  796. n = n + 1
  797. e = c[n]
  798. l[e[2]] = l[e[3]]
  799. n = n + 1
  800. e = c[n]
  801. l[e[2]] = l[e[3]]
  802. n = n + 1
  803. e = c[n]
  804. l[e[2]] = l[e[3]]
  805. end
  806. elseif o <= 61 then
  807. if o <= 59 then
  808. if o > 58 then
  809. l[e[2]]()
  810. t = A
  811. else
  812. if (a[e[2]] >= l[e[5]]) then
  813. n = n + 1
  814. else
  815. n = n + e[3]
  816. end
  817. end
  818. elseif o > 60 then
  819. l[e[2]] = {}
  820. else
  821. l[e[2]][l[e[3]]] = l[e[5]]
  822. end
  823. elseif o <= 63 then
  824. if o > 62 then
  825. l[e[2]] = #l[e[3]]
  826. else
  827. l[e[2]] = l[e[3]] * a[e[5]]
  828. end
  829. elseif o <= 64 then
  830. local o = e[2]
  831. local a = {}
  832. local n = 0
  833. local c = o + e[3] - 1
  834. for e = o + 1, c do
  835. n = n + 1
  836. a[n] = l[e]
  837. end
  838. local c = {l[o](f(a, 1, c - o))}
  839. local e = o + e[5] - 2
  840. n = 0
  841. for e = o, e do
  842. n = n + 1
  843. l[e] = c[n]
  844. end
  845. t = e
  846. elseif o > 65 then
  847. t = e[2]
  848. else
  849. l[e[2]] = l[e[3]] + l[e[5]]
  850. end
  851. n = n + 1
  852. end
  853. end
  854. A, B = r(N(P))
  855. if not A[1] then
  856. local e = h[7][n] or "?"
  857. error("ERROR IN TRIGON SKYBLOCK SCRIPT [LINE " .. e .. "]:" .. A[2])
  858. else
  859. return f(A, 2, B)
  860. end
  861. end
  862. end
  863. return C(P(), {}, G())()
Add Comment
Please, Sign In to add comment
Public Pastes
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!