tx · 8kgTW8Yn9Gkzxu48u6EacyUV76LQpRo1vdijoDmrjqkg 3Mr97MBt1TwRZHBK8R1EFDz8S8mxui5U4zB: -0.01400000 Waves 2021.06.03 13:18 [1554052] smart account 3Mr97MBt1TwRZHBK8R1EFDz8S8mxui5U4zB > SELF 0.00000000 Waves
{ "type": 13, "id": "8kgTW8Yn9Gkzxu48u6EacyUV76LQpRo1vdijoDmrjqkg", "fee": 1400000, "feeAssetId": null, "timestamp": 1622715535391, "version": 2, "chainId": 84, "sender": "3Mr97MBt1TwRZHBK8R1EFDz8S8mxui5U4zB", "senderPublicKey": "CQ7vntBAYh2QZcKcqiiyEnQWWXsr98ysDptD23Wgxmvb", "proofs": [ "SjjHLdQ4Xatbt79mb77Nd51edKPvadkdBMro6Gtboty1QFeghe9pdyBauSSKVjP1jtCzdVD5cDZdZDihgK1EH4N" ], "script": "base64:AAIEAAAAAAAAAAQIAhIAAAAAAQEAAAAJbGlzdFRvU3RyAAAAAQAAAANhcnIKAQAAAAhmb2xkRnVuYwAAAAIAAAAEbGlzdAAAAAFhCQAETAAAAAIJAQAAAA1wYXJzZUludFZhbHVlAAAAAQUAAAABYQUAAAAEbGlzdAQAAAALJGxpc3QxOTEyMTcFAAAAA2FycgQAAAALJHNpemUxOTEyMTcJAAGQAAAAAQUAAAALJGxpc3QxOTEyMTcEAAAACyRhY2MwMTkxMjE3BQAAAANuaWwDCQAAAAAAAAIFAAAACyRzaXplMTkxMjE3AAAAAAAAAAAABQAAAAskYWNjMDE5MTIxNwQAAAALJGFjYzExOTEyMTcJAQAAAAhmb2xkRnVuYwAAAAIFAAAACyRhY2MwMTkxMjE3CQABkQAAAAIFAAAACyRsaXN0MTkxMjE3AAAAAAAAAAAAAwkAAAAAAAACBQAAAAskc2l6ZTE5MTIxNwAAAAAAAAAAAQUAAAALJGFjYzExOTEyMTcEAAAACyRhY2MyMTkxMjE3CQEAAAAIZm9sZEZ1bmMAAAACBQAAAAskYWNjMTE5MTIxNwkAAZEAAAACBQAAAAskbGlzdDE5MTIxNwAAAAAAAAAAAQMJAAAAAAAAAgUAAAALJHNpemUxOTEyMTcAAAAAAAAAAAIFAAAACyRhY2MyMTkxMjE3BAAAAAskYWNjMzE5MTIxNwkBAAAACGZvbGRGdW5jAAAAAgUAAAALJGFjYzIxOTEyMTcJAAGRAAAAAgUAAAALJGxpc3QxOTEyMTcAAAAAAAAAAAIDCQAAAAAAAAIFAAAACyRzaXplMTkxMjE3AAAAAAAAAAADBQAAAAskYWNjMzE5MTIxNwQAAAALJGFjYzQxOTEyMTcJAQAAAAhmb2xkRnVuYwAAAAIFAAAACyRhY2MzMTkxMjE3CQABkQAAAAIFAAAACyRsaXN0MTkxMjE3AAAAAAAAAAADCQAAAgAAAAECAAAAEkxpc3Qgc2l6ZSBleGNlZWQgMwAAAAEAAAABaQEAAAAEY2FsbAAAAAAEAAAABWNvdW50AAAAAAAAAAABBAAAAAdzdHJMaXN0CQEAAAAJbGlzdFRvU3RyAAAAAQkABEwAAAACAgAAAAExCQAETAAAAAICAAAAATIJAARMAAAAAgIAAAABMwUAAAADbmlsAwkAAAAAAAACBQAAAAVjb3VudAAAAAAAAAAAAQkAAAIAAAABCQABLAAAAAICAAAADHN0ckxpc3QsMD09PgkAAaQAAAABCQABkQAAAAIFAAAAB3N0ckxpc3QAAAAAAAAAAAAJAARMAAAAAgkBAAAADEludGVnZXJFbnRyeQAAAAICAAAAA2ludAAAAAAAAAAAAQUAAAADbmlsAAAAAQAAAAJ0eAEAAAAGdmVyaWZ5AAAAAAkAAfQAAAADCAUAAAACdHgAAAAJYm9keUJ5dGVzCQABkQAAAAIIBQAAAAJ0eAAAAAZwcm9vZnMAAAAAAAAAAAAIBQAAAAJ0eAAAAA9zZW5kZXJQdWJsaWNLZXns8pK7", "height": 1554052, "applicationStatus": "succeeded", "spentComplexity": 0 } View: original | compacted Prev: Aja8V2et7V5pX6uq9GFpqjEUzQXrmFSpmVzCrLR2rG3H Next: 9E6Xd63K6Frp2JPTzrmVzMu3Yvp4UKxpgqS7HQUKEgh8 Diff:
Old | New | Differences | |
---|---|---|---|
1 | - | {-# STDLIB_VERSION | |
1 | + | {-# STDLIB_VERSION 4 #-} | |
2 | 2 | {-# SCRIPT_TYPE ACCOUNT #-} | |
3 | 3 | {-# CONTENT_TYPE DAPP #-} | |
4 | - | let a = base58'BJFTCAVHNhppygeLqYUyG5NB9GwNRjEjFeweJpXXi1DQ' | |
4 | + | func a (b) = { | |
5 | + | func c (d,e) = parseIntValue(e) :: d | |
5 | 6 | ||
6 | - | let b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18] | |
7 | - | ||
8 | - | func c (d) = { | |
9 | - | func e (f,g) = (f + g) | |
10 | - | ||
11 | - | let h = d | |
12 | - | let i = size(h) | |
13 | - | let j = 0 | |
14 | - | if ((i == 0)) | |
15 | - | then j | |
7 | + | let f = b | |
8 | + | let g = size(f) | |
9 | + | let h = nil | |
10 | + | if ((g == 0)) | |
11 | + | then h | |
16 | 12 | else { | |
17 | - | let | |
18 | - | if (( | |
19 | - | then | |
13 | + | let i = c(h, f[0]) | |
14 | + | if ((g == 1)) | |
15 | + | then i | |
20 | 16 | else { | |
21 | - | let | |
22 | - | if (( | |
23 | - | then | |
17 | + | let j = c(i, f[1]) | |
18 | + | if ((g == 2)) | |
19 | + | then j | |
24 | 20 | else { | |
25 | - | let | |
26 | - | if (( | |
27 | - | then | |
21 | + | let k = c(j, f[2]) | |
22 | + | if ((g == 3)) | |
23 | + | then k | |
28 | 24 | else { | |
29 | - | let n = e(m, h[3]) | |
30 | - | if ((i == 4)) | |
31 | - | then n | |
32 | - | else { | |
33 | - | let o = e(n, h[4]) | |
34 | - | if ((i == 5)) | |
35 | - | then o | |
36 | - | else { | |
37 | - | let p = e(o, h[5]) | |
38 | - | if ((i == 6)) | |
39 | - | then p | |
40 | - | else { | |
41 | - | let q = e(p, h[6]) | |
42 | - | if ((i == 7)) | |
43 | - | then q | |
44 | - | else { | |
45 | - | let r = e(q, h[7]) | |
46 | - | if ((i == 8)) | |
47 | - | then r | |
48 | - | else { | |
49 | - | let s = e(r, h[8]) | |
50 | - | if ((i == 9)) | |
51 | - | then s | |
52 | - | else { | |
53 | - | let t = e(s, h[9]) | |
54 | - | if ((i == 10)) | |
55 | - | then t | |
56 | - | else { | |
57 | - | let u = e(t, h[10]) | |
58 | - | if ((i == 11)) | |
59 | - | then u | |
60 | - | else { | |
61 | - | let v = e(u, h[11]) | |
62 | - | if ((i == 12)) | |
63 | - | then v | |
64 | - | else { | |
65 | - | let w = e(v, h[12]) | |
66 | - | if ((i == 13)) | |
67 | - | then w | |
68 | - | else { | |
69 | - | let x = e(w, h[13]) | |
70 | - | if ((i == 14)) | |
71 | - | then x | |
72 | - | else { | |
73 | - | let y = e(x, h[14]) | |
74 | - | if ((i == 15)) | |
75 | - | then y | |
76 | - | else { | |
77 | - | let z = e(y, h[15]) | |
78 | - | if ((i == 16)) | |
79 | - | then z | |
80 | - | else { | |
81 | - | let A = e(z, h[16]) | |
82 | - | if ((i == 17)) | |
83 | - | then A | |
84 | - | else { | |
85 | - | let B = e(A, h[17]) | |
86 | - | if ((i == 18)) | |
87 | - | then B | |
88 | - | else { | |
89 | - | let C = e(B, h[18]) | |
90 | - | throw("List size exceed 18") | |
91 | - | } | |
92 | - | } | |
93 | - | } | |
94 | - | } | |
95 | - | } | |
96 | - | } | |
97 | - | } | |
98 | - | } | |
99 | - | } | |
100 | - | } | |
101 | - | } | |
102 | - | } | |
103 | - | } | |
104 | - | } | |
105 | - | } | |
25 | + | let l = c(k, f[3]) | |
26 | + | throw("List size exceed 3") | |
106 | 27 | } | |
107 | 28 | } | |
108 | 29 | } | |
110 | 31 | } | |
111 | 32 | ||
112 | 33 | ||
113 | - | func D (E) = [parseIntValue(E[0]), parseIntValue(E[1]), parseIntValue(E[2]), parseIntValue(E[3]), parseIntValue(E[4]), parseIntValue(E[5]), parseIntValue(E[6]), parseIntValue(E[7]), parseIntValue(E[8]), parseIntValue(E[9]), parseIntValue(E[10]), parseIntValue(E[11]), parseIntValue(E[12]), parseIntValue(E[13]), parseIntValue(E[14]), parseIntValue(E[15]), parseIntValue(E[16]), parseIntValue(E[17])] | |
114 | - | ||
115 | - | ||
116 | - | func F (G,H) = { | |
117 | - | let I = getString(this, ((H + "_round_score_") + toString(G))) | |
118 | - | if ($isInstanceOf(I, "String")) | |
119 | - | then { | |
120 | - | let f = I | |
121 | - | f | |
122 | - | } | |
123 | - | else "" | |
34 | + | @Callable(m) | |
35 | + | func call () = { | |
36 | + | let n = 1 | |
37 | + | let o = a(["1", "2", "3"]) | |
38 | + | if ((n == 1)) | |
39 | + | then throw(("strList,0==>" + toString(o[0]))) | |
40 | + | else [IntegerEntry("int", 1)] | |
124 | 41 | } | |
125 | 42 | ||
126 | 43 | ||
127 | - | func J (G,H) = { | |
128 | - | let I = getString(this, ((H + "_round_course_") + toString(G))) | |
129 | - | if ($isInstanceOf(I, "String")) | |
130 | - | then { | |
131 | - | let f = I | |
132 | - | f | |
133 | - | } | |
134 | - | else "" | |
135 | - | } | |
136 | - | ||
137 | - | ||
138 | - | func K (L,M) = if ((L >= M)) | |
139 | - | then 1 | |
140 | - | else 0 | |
141 | - | ||
142 | - | ||
143 | - | func N (O,P,Q,R) = { | |
144 | - | func S (T,U) = { | |
145 | - | let V = K(R, Q[U]) | |
146 | - | let W = ((P[U] + 2) + V) | |
147 | - | if ((O[U] > W)) | |
148 | - | then (T :+ W) | |
149 | - | else (T :+ O[U]) | |
150 | - | } | |
151 | - | ||
152 | - | let X = b | |
153 | - | let Y = size(X) | |
154 | - | let Z = nil | |
155 | - | if ((Y == 0)) | |
156 | - | then Z | |
157 | - | else { | |
158 | - | let aa = S(Z, X[0]) | |
159 | - | if ((Y == 1)) | |
160 | - | then aa | |
161 | - | else { | |
162 | - | let ab = S(aa, X[1]) | |
163 | - | if ((Y == 2)) | |
164 | - | then ab | |
165 | - | else { | |
166 | - | let ac = S(ab, X[2]) | |
167 | - | if ((Y == 3)) | |
168 | - | then ac | |
169 | - | else { | |
170 | - | let ad = S(ac, X[3]) | |
171 | - | if ((Y == 4)) | |
172 | - | then ad | |
173 | - | else { | |
174 | - | let ae = S(ad, X[4]) | |
175 | - | if ((Y == 5)) | |
176 | - | then ae | |
177 | - | else { | |
178 | - | let af = S(ae, X[5]) | |
179 | - | if ((Y == 6)) | |
180 | - | then af | |
181 | - | else { | |
182 | - | let ag = S(af, X[6]) | |
183 | - | if ((Y == 7)) | |
184 | - | then ag | |
185 | - | else { | |
186 | - | let ah = S(ag, X[7]) | |
187 | - | if ((Y == 8)) | |
188 | - | then ah | |
189 | - | else { | |
190 | - | let ai = S(ah, X[8]) | |
191 | - | if ((Y == 9)) | |
192 | - | then ai | |
193 | - | else { | |
194 | - | let aj = S(ai, X[9]) | |
195 | - | if ((Y == 10)) | |
196 | - | then aj | |
197 | - | else { | |
198 | - | let ak = S(aj, X[10]) | |
199 | - | if ((Y == 11)) | |
200 | - | then ak | |
201 | - | else { | |
202 | - | let al = S(ak, X[11]) | |
203 | - | if ((Y == 12)) | |
204 | - | then al | |
205 | - | else { | |
206 | - | let am = S(al, X[12]) | |
207 | - | if ((Y == 13)) | |
208 | - | then am | |
209 | - | else { | |
210 | - | let an = S(am, X[13]) | |
211 | - | if ((Y == 14)) | |
212 | - | then an | |
213 | - | else { | |
214 | - | let ao = S(an, X[14]) | |
215 | - | if ((Y == 15)) | |
216 | - | then ao | |
217 | - | else { | |
218 | - | let ap = S(ao, X[15]) | |
219 | - | if ((Y == 16)) | |
220 | - | then ap | |
221 | - | else { | |
222 | - | let aq = S(ap, X[16]) | |
223 | - | if ((Y == 17)) | |
224 | - | then aq | |
225 | - | else { | |
226 | - | let ar = S(aq, X[17]) | |
227 | - | if ((Y == 18)) | |
228 | - | then ar | |
229 | - | else { | |
230 | - | let as = S(ar, X[18]) | |
231 | - | throw("List size exceed 18") | |
232 | - | } | |
233 | - | } | |
234 | - | } | |
235 | - | } | |
236 | - | } | |
237 | - | } | |
238 | - | } | |
239 | - | } | |
240 | - | } | |
241 | - | } | |
242 | - | } | |
243 | - | } | |
244 | - | } | |
245 | - | } | |
246 | - | } | |
247 | - | } | |
248 | - | } | |
249 | - | } | |
250 | - | } | |
251 | - | } | |
252 | - | ||
253 | - | ||
254 | - | func at (O,P) = { | |
255 | - | func S (T,U) = if ((O[U] > (P[U] + 5))) | |
256 | - | then (T :+ (P[U] + 5)) | |
257 | - | else (T :+ O[U]) | |
258 | - | ||
259 | - | let au = b | |
260 | - | let av = size(au) | |
261 | - | let aw = nil | |
262 | - | if ((av == 0)) | |
263 | - | then aw | |
264 | - | else { | |
265 | - | let ax = S(aw, au[0]) | |
266 | - | if ((av == 1)) | |
267 | - | then ax | |
268 | - | else { | |
269 | - | let ay = S(ax, au[1]) | |
270 | - | if ((av == 2)) | |
271 | - | then ay | |
272 | - | else { | |
273 | - | let az = S(ay, au[2]) | |
274 | - | if ((av == 3)) | |
275 | - | then az | |
276 | - | else { | |
277 | - | let aA = S(az, au[3]) | |
278 | - | if ((av == 4)) | |
279 | - | then aA | |
280 | - | else { | |
281 | - | let aB = S(aA, au[4]) | |
282 | - | if ((av == 5)) | |
283 | - | then aB | |
284 | - | else { | |
285 | - | let aC = S(aB, au[5]) | |
286 | - | if ((av == 6)) | |
287 | - | then aC | |
288 | - | else { | |
289 | - | let aD = S(aC, au[6]) | |
290 | - | if ((av == 7)) | |
291 | - | then aD | |
292 | - | else { | |
293 | - | let aE = S(aD, au[7]) | |
294 | - | if ((av == 8)) | |
295 | - | then aE | |
296 | - | else { | |
297 | - | let aF = S(aE, au[8]) | |
298 | - | if ((av == 9)) | |
299 | - | then aF | |
300 | - | else { | |
301 | - | let aG = S(aF, au[9]) | |
302 | - | if ((av == 10)) | |
303 | - | then aG | |
304 | - | else { | |
305 | - | let aH = S(aG, au[10]) | |
306 | - | if ((av == 11)) | |
307 | - | then aH | |
308 | - | else { | |
309 | - | let aI = S(aH, au[11]) | |
310 | - | if ((av == 12)) | |
311 | - | then aI | |
312 | - | else { | |
313 | - | let aJ = S(aI, au[12]) | |
314 | - | if ((av == 13)) | |
315 | - | then aJ | |
316 | - | else { | |
317 | - | let aK = S(aJ, au[13]) | |
318 | - | if ((av == 14)) | |
319 | - | then aK | |
320 | - | else { | |
321 | - | let aL = S(aK, au[14]) | |
322 | - | if ((av == 15)) | |
323 | - | then aL | |
324 | - | else { | |
325 | - | let aM = S(aL, au[15]) | |
326 | - | if ((av == 16)) | |
327 | - | then aM | |
328 | - | else { | |
329 | - | let aN = S(aM, au[16]) | |
330 | - | if ((av == 17)) | |
331 | - | then aN | |
332 | - | else { | |
333 | - | let aO = S(aN, au[17]) | |
334 | - | if ((av == 18)) | |
335 | - | then aO | |
336 | - | else { | |
337 | - | let aP = S(aO, au[18]) | |
338 | - | throw("List size exceed 18") | |
339 | - | } | |
340 | - | } | |
341 | - | } | |
342 | - | } | |
343 | - | } | |
344 | - | } | |
345 | - | } | |
346 | - | } | |
347 | - | } | |
348 | - | } | |
349 | - | } | |
350 | - | } | |
351 | - | } | |
352 | - | } | |
353 | - | } | |
354 | - | } | |
355 | - | } | |
356 | - | } | |
357 | - | } | |
358 | - | } | |
359 | - | ||
360 | - | ||
361 | - | func aQ (O,P,Q,R) = if ((R == -1)) | |
362 | - | then at(O, P) | |
363 | - | else N(O, P, Q, R) | |
364 | - | ||
365 | - | ||
366 | - | func aR (aS,aT,Q,aU,aV,R) = { | |
367 | - | let aW = aQ(aS, aT, Q, R) | |
368 | - | let aX = c(aW) | |
369 | - | let aY = c(aS) | |
370 | - | let aZ = 0 | |
371 | - | let f = (113 / aV) | |
372 | - | let g = ((aX - aU) - aZ) | |
373 | - | let ba = 1 | |
374 | - | let bb = fraction(f, g, ba, HALFUP) | |
375 | - | bb | |
376 | - | } | |
377 | - | ||
378 | - | ||
379 | - | func bc (bd) = if ((bd > 54)) | |
380 | - | then 54 | |
381 | - | else if ((0 > bd)) | |
382 | - | then 0 | |
383 | - | else bd | |
384 | - | ||
385 | - | ||
386 | - | let be = 1 | |
387 | - | ||
388 | - | @Callable(U) | |
389 | - | func issueHandicapIndex () = { | |
390 | - | let H = toBase58String(U.caller.bytes) | |
391 | - | let bf = 20 | |
392 | - | let bg = { | |
393 | - | let I = getInteger(this, (H + "_round_count")) | |
394 | - | if ($isInstanceOf(I, "Int")) | |
395 | - | then { | |
396 | - | let f = I | |
397 | - | f | |
398 | - | } | |
399 | - | else -1 | |
400 | - | } | |
401 | - | let bh = "4_&&_6_&&_7_&&_4_&&_7_&&_8_&&_5_&&_8_&&_6_&&_6_&&_7_&&_8_&&_6_&&_6_&&_5_&&_7_&&_7_&&_6" | |
402 | - | let bi = "3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ_&&_course_1_&&_course_2_&&_green_1_&&_70_&&_110_&&_men_&&_1622640688000_&&_cloudy_&&_11" | |
403 | - | let bj = "4_&&_4_&&_4_&&_4_&&_3_&&_5_&&_4_&&_5_&&_6_&&_5_&&_3_&&_5_&&_4_&&_4_&&_5_&&_4_&&_4_&&_4" | |
404 | - | let bk = "1_&&_2_&&_3_&&_4_&&_5_&&_6_&&_7_&&_8_&&_9_&&_10_&&_11_&&_12_&&_13_&&_14_&&_15_&&_16_&&_17_&&_18" | |
405 | - | let bl = D(split(bh, "_&&_")) | |
406 | - | let bm = D(split(bh, "_&&_")) | |
407 | - | let bn = D(split(bh, "_&&_")) | |
408 | - | let bo = split(bi, "_&&_") | |
409 | - | let bp = split(bi, "_&&_") | |
410 | - | let bq = split(bi, "_&&_") | |
411 | - | let br = D(split(bj, "_&&_")) | |
412 | - | let bs = D(split(bj, "_&&_")) | |
413 | - | let bt = D(split(bj, "_&&_")) | |
414 | - | let bu = D(split(bk, "_&&_")) | |
415 | - | let bv = D(split(bk, "_&&_")) | |
416 | - | let bw = D(split(bk, "_&&_")) | |
417 | - | let bx = aR(bl, br, bu, parseIntValue(bo[5]), parseIntValue(bo[6]), bf) | |
418 | - | let by = aR(bm, bs, bv, parseIntValue(bp[5]), parseIntValue(bp[6]), bf) | |
419 | - | let bz = aR(bn, bt, bw, parseIntValue(bq[5]), parseIntValue(bq[6]), bf) | |
420 | - | let bA = max([bx, by, bz]) | |
421 | - | let bb = (bA - 2) | |
422 | - | let L = bc(bb) | |
423 | - | [Reissue(a, L, false), IntegerEntry((H + "_handicapIndex"), L), ScriptTransfer(U.caller, L, a)] | |
424 | - | } | |
425 | - | ||
426 | - | ||
427 | - | @Verifier(bB) | |
428 | - | func bC () = sigVerify(bB.bodyBytes, bB.proofs[0], bB.senderPublicKey) | |
44 | + | @Verifier(p) | |
45 | + | func q () = sigVerify(p.bodyBytes, p.proofs[0], p.senderPublicKey) | |
429 | 46 |
Old | New | Differences | |
---|---|---|---|
1 | - | {-# STDLIB_VERSION | |
1 | + | {-# STDLIB_VERSION 4 #-} | |
2 | 2 | {-# SCRIPT_TYPE ACCOUNT #-} | |
3 | 3 | {-# CONTENT_TYPE DAPP #-} | |
4 | - | let a = base58'BJFTCAVHNhppygeLqYUyG5NB9GwNRjEjFeweJpXXi1DQ' | |
4 | + | func a (b) = { | |
5 | + | func c (d,e) = parseIntValue(e) :: d | |
5 | 6 | ||
6 | - | let b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18] | |
7 | - | ||
8 | - | func c (d) = { | |
9 | - | func e (f,g) = (f + g) | |
10 | - | ||
11 | - | let h = d | |
12 | - | let i = size(h) | |
13 | - | let j = 0 | |
14 | - | if ((i == 0)) | |
15 | - | then j | |
7 | + | let f = b | |
8 | + | let g = size(f) | |
9 | + | let h = nil | |
10 | + | if ((g == 0)) | |
11 | + | then h | |
16 | 12 | else { | |
17 | - | let | |
18 | - | if (( | |
19 | - | then | |
13 | + | let i = c(h, f[0]) | |
14 | + | if ((g == 1)) | |
15 | + | then i | |
20 | 16 | else { | |
21 | - | let | |
22 | - | if (( | |
23 | - | then | |
17 | + | let j = c(i, f[1]) | |
18 | + | if ((g == 2)) | |
19 | + | then j | |
24 | 20 | else { | |
25 | - | let | |
26 | - | if (( | |
27 | - | then | |
21 | + | let k = c(j, f[2]) | |
22 | + | if ((g == 3)) | |
23 | + | then k | |
28 | 24 | else { | |
29 | - | let n = e(m, h[3]) | |
30 | - | if ((i == 4)) | |
31 | - | then n | |
32 | - | else { | |
33 | - | let o = e(n, h[4]) | |
34 | - | if ((i == 5)) | |
35 | - | then o | |
36 | - | else { | |
37 | - | let p = e(o, h[5]) | |
38 | - | if ((i == 6)) | |
39 | - | then p | |
40 | - | else { | |
41 | - | let q = e(p, h[6]) | |
42 | - | if ((i == 7)) | |
43 | - | then q | |
44 | - | else { | |
45 | - | let r = e(q, h[7]) | |
46 | - | if ((i == 8)) | |
47 | - | then r | |
48 | - | else { | |
49 | - | let s = e(r, h[8]) | |
50 | - | if ((i == 9)) | |
51 | - | then s | |
52 | - | else { | |
53 | - | let t = e(s, h[9]) | |
54 | - | if ((i == 10)) | |
55 | - | then t | |
56 | - | else { | |
57 | - | let u = e(t, h[10]) | |
58 | - | if ((i == 11)) | |
59 | - | then u | |
60 | - | else { | |
61 | - | let v = e(u, h[11]) | |
62 | - | if ((i == 12)) | |
63 | - | then v | |
64 | - | else { | |
65 | - | let w = e(v, h[12]) | |
66 | - | if ((i == 13)) | |
67 | - | then w | |
68 | - | else { | |
69 | - | let x = e(w, h[13]) | |
70 | - | if ((i == 14)) | |
71 | - | then x | |
72 | - | else { | |
73 | - | let y = e(x, h[14]) | |
74 | - | if ((i == 15)) | |
75 | - | then y | |
76 | - | else { | |
77 | - | let z = e(y, h[15]) | |
78 | - | if ((i == 16)) | |
79 | - | then z | |
80 | - | else { | |
81 | - | let A = e(z, h[16]) | |
82 | - | if ((i == 17)) | |
83 | - | then A | |
84 | - | else { | |
85 | - | let B = e(A, h[17]) | |
86 | - | if ((i == 18)) | |
87 | - | then B | |
88 | - | else { | |
89 | - | let C = e(B, h[18]) | |
90 | - | throw("List size exceed 18") | |
91 | - | } | |
92 | - | } | |
93 | - | } | |
94 | - | } | |
95 | - | } | |
96 | - | } | |
97 | - | } | |
98 | - | } | |
99 | - | } | |
100 | - | } | |
101 | - | } | |
102 | - | } | |
103 | - | } | |
104 | - | } | |
105 | - | } | |
25 | + | let l = c(k, f[3]) | |
26 | + | throw("List size exceed 3") | |
106 | 27 | } | |
107 | 28 | } | |
108 | 29 | } | |
109 | 30 | } | |
110 | 31 | } | |
111 | 32 | ||
112 | 33 | ||
113 | - | func D (E) = [parseIntValue(E[0]), parseIntValue(E[1]), parseIntValue(E[2]), parseIntValue(E[3]), parseIntValue(E[4]), parseIntValue(E[5]), parseIntValue(E[6]), parseIntValue(E[7]), parseIntValue(E[8]), parseIntValue(E[9]), parseIntValue(E[10]), parseIntValue(E[11]), parseIntValue(E[12]), parseIntValue(E[13]), parseIntValue(E[14]), parseIntValue(E[15]), parseIntValue(E[16]), parseIntValue(E[17])] | |
114 | - | ||
115 | - | ||
116 | - | func F (G,H) = { | |
117 | - | let I = getString(this, ((H + "_round_score_") + toString(G))) | |
118 | - | if ($isInstanceOf(I, "String")) | |
119 | - | then { | |
120 | - | let f = I | |
121 | - | f | |
122 | - | } | |
123 | - | else "" | |
34 | + | @Callable(m) | |
35 | + | func call () = { | |
36 | + | let n = 1 | |
37 | + | let o = a(["1", "2", "3"]) | |
38 | + | if ((n == 1)) | |
39 | + | then throw(("strList,0==>" + toString(o[0]))) | |
40 | + | else [IntegerEntry("int", 1)] | |
124 | 41 | } | |
125 | 42 | ||
126 | 43 | ||
127 | - | func J (G,H) = { | |
128 | - | let I = getString(this, ((H + "_round_course_") + toString(G))) | |
129 | - | if ($isInstanceOf(I, "String")) | |
130 | - | then { | |
131 | - | let f = I | |
132 | - | f | |
133 | - | } | |
134 | - | else "" | |
135 | - | } | |
136 | - | ||
137 | - | ||
138 | - | func K (L,M) = if ((L >= M)) | |
139 | - | then 1 | |
140 | - | else 0 | |
141 | - | ||
142 | - | ||
143 | - | func N (O,P,Q,R) = { | |
144 | - | func S (T,U) = { | |
145 | - | let V = K(R, Q[U]) | |
146 | - | let W = ((P[U] + 2) + V) | |
147 | - | if ((O[U] > W)) | |
148 | - | then (T :+ W) | |
149 | - | else (T :+ O[U]) | |
150 | - | } | |
151 | - | ||
152 | - | let X = b | |
153 | - | let Y = size(X) | |
154 | - | let Z = nil | |
155 | - | if ((Y == 0)) | |
156 | - | then Z | |
157 | - | else { | |
158 | - | let aa = S(Z, X[0]) | |
159 | - | if ((Y == 1)) | |
160 | - | then aa | |
161 | - | else { | |
162 | - | let ab = S(aa, X[1]) | |
163 | - | if ((Y == 2)) | |
164 | - | then ab | |
165 | - | else { | |
166 | - | let ac = S(ab, X[2]) | |
167 | - | if ((Y == 3)) | |
168 | - | then ac | |
169 | - | else { | |
170 | - | let ad = S(ac, X[3]) | |
171 | - | if ((Y == 4)) | |
172 | - | then ad | |
173 | - | else { | |
174 | - | let ae = S(ad, X[4]) | |
175 | - | if ((Y == 5)) | |
176 | - | then ae | |
177 | - | else { | |
178 | - | let af = S(ae, X[5]) | |
179 | - | if ((Y == 6)) | |
180 | - | then af | |
181 | - | else { | |
182 | - | let ag = S(af, X[6]) | |
183 | - | if ((Y == 7)) | |
184 | - | then ag | |
185 | - | else { | |
186 | - | let ah = S(ag, X[7]) | |
187 | - | if ((Y == 8)) | |
188 | - | then ah | |
189 | - | else { | |
190 | - | let ai = S(ah, X[8]) | |
191 | - | if ((Y == 9)) | |
192 | - | then ai | |
193 | - | else { | |
194 | - | let aj = S(ai, X[9]) | |
195 | - | if ((Y == 10)) | |
196 | - | then aj | |
197 | - | else { | |
198 | - | let ak = S(aj, X[10]) | |
199 | - | if ((Y == 11)) | |
200 | - | then ak | |
201 | - | else { | |
202 | - | let al = S(ak, X[11]) | |
203 | - | if ((Y == 12)) | |
204 | - | then al | |
205 | - | else { | |
206 | - | let am = S(al, X[12]) | |
207 | - | if ((Y == 13)) | |
208 | - | then am | |
209 | - | else { | |
210 | - | let an = S(am, X[13]) | |
211 | - | if ((Y == 14)) | |
212 | - | then an | |
213 | - | else { | |
214 | - | let ao = S(an, X[14]) | |
215 | - | if ((Y == 15)) | |
216 | - | then ao | |
217 | - | else { | |
218 | - | let ap = S(ao, X[15]) | |
219 | - | if ((Y == 16)) | |
220 | - | then ap | |
221 | - | else { | |
222 | - | let aq = S(ap, X[16]) | |
223 | - | if ((Y == 17)) | |
224 | - | then aq | |
225 | - | else { | |
226 | - | let ar = S(aq, X[17]) | |
227 | - | if ((Y == 18)) | |
228 | - | then ar | |
229 | - | else { | |
230 | - | let as = S(ar, X[18]) | |
231 | - | throw("List size exceed 18") | |
232 | - | } | |
233 | - | } | |
234 | - | } | |
235 | - | } | |
236 | - | } | |
237 | - | } | |
238 | - | } | |
239 | - | } | |
240 | - | } | |
241 | - | } | |
242 | - | } | |
243 | - | } | |
244 | - | } | |
245 | - | } | |
246 | - | } | |
247 | - | } | |
248 | - | } | |
249 | - | } | |
250 | - | } | |
251 | - | } | |
252 | - | ||
253 | - | ||
254 | - | func at (O,P) = { | |
255 | - | func S (T,U) = if ((O[U] > (P[U] + 5))) | |
256 | - | then (T :+ (P[U] + 5)) | |
257 | - | else (T :+ O[U]) | |
258 | - | ||
259 | - | let au = b | |
260 | - | let av = size(au) | |
261 | - | let aw = nil | |
262 | - | if ((av == 0)) | |
263 | - | then aw | |
264 | - | else { | |
265 | - | let ax = S(aw, au[0]) | |
266 | - | if ((av == 1)) | |
267 | - | then ax | |
268 | - | else { | |
269 | - | let ay = S(ax, au[1]) | |
270 | - | if ((av == 2)) | |
271 | - | then ay | |
272 | - | else { | |
273 | - | let az = S(ay, au[2]) | |
274 | - | if ((av == 3)) | |
275 | - | then az | |
276 | - | else { | |
277 | - | let aA = S(az, au[3]) | |
278 | - | if ((av == 4)) | |
279 | - | then aA | |
280 | - | else { | |
281 | - | let aB = S(aA, au[4]) | |
282 | - | if ((av == 5)) | |
283 | - | then aB | |
284 | - | else { | |
285 | - | let aC = S(aB, au[5]) | |
286 | - | if ((av == 6)) | |
287 | - | then aC | |
288 | - | else { | |
289 | - | let aD = S(aC, au[6]) | |
290 | - | if ((av == 7)) | |
291 | - | then aD | |
292 | - | else { | |
293 | - | let aE = S(aD, au[7]) | |
294 | - | if ((av == 8)) | |
295 | - | then aE | |
296 | - | else { | |
297 | - | let aF = S(aE, au[8]) | |
298 | - | if ((av == 9)) | |
299 | - | then aF | |
300 | - | else { | |
301 | - | let aG = S(aF, au[9]) | |
302 | - | if ((av == 10)) | |
303 | - | then aG | |
304 | - | else { | |
305 | - | let aH = S(aG, au[10]) | |
306 | - | if ((av == 11)) | |
307 | - | then aH | |
308 | - | else { | |
309 | - | let aI = S(aH, au[11]) | |
310 | - | if ((av == 12)) | |
311 | - | then aI | |
312 | - | else { | |
313 | - | let aJ = S(aI, au[12]) | |
314 | - | if ((av == 13)) | |
315 | - | then aJ | |
316 | - | else { | |
317 | - | let aK = S(aJ, au[13]) | |
318 | - | if ((av == 14)) | |
319 | - | then aK | |
320 | - | else { | |
321 | - | let aL = S(aK, au[14]) | |
322 | - | if ((av == 15)) | |
323 | - | then aL | |
324 | - | else { | |
325 | - | let aM = S(aL, au[15]) | |
326 | - | if ((av == 16)) | |
327 | - | then aM | |
328 | - | else { | |
329 | - | let aN = S(aM, au[16]) | |
330 | - | if ((av == 17)) | |
331 | - | then aN | |
332 | - | else { | |
333 | - | let aO = S(aN, au[17]) | |
334 | - | if ((av == 18)) | |
335 | - | then aO | |
336 | - | else { | |
337 | - | let aP = S(aO, au[18]) | |
338 | - | throw("List size exceed 18") | |
339 | - | } | |
340 | - | } | |
341 | - | } | |
342 | - | } | |
343 | - | } | |
344 | - | } | |
345 | - | } | |
346 | - | } | |
347 | - | } | |
348 | - | } | |
349 | - | } | |
350 | - | } | |
351 | - | } | |
352 | - | } | |
353 | - | } | |
354 | - | } | |
355 | - | } | |
356 | - | } | |
357 | - | } | |
358 | - | } | |
359 | - | ||
360 | - | ||
361 | - | func aQ (O,P,Q,R) = if ((R == -1)) | |
362 | - | then at(O, P) | |
363 | - | else N(O, P, Q, R) | |
364 | - | ||
365 | - | ||
366 | - | func aR (aS,aT,Q,aU,aV,R) = { | |
367 | - | let aW = aQ(aS, aT, Q, R) | |
368 | - | let aX = c(aW) | |
369 | - | let aY = c(aS) | |
370 | - | let aZ = 0 | |
371 | - | let f = (113 / aV) | |
372 | - | let g = ((aX - aU) - aZ) | |
373 | - | let ba = 1 | |
374 | - | let bb = fraction(f, g, ba, HALFUP) | |
375 | - | bb | |
376 | - | } | |
377 | - | ||
378 | - | ||
379 | - | func bc (bd) = if ((bd > 54)) | |
380 | - | then 54 | |
381 | - | else if ((0 > bd)) | |
382 | - | then 0 | |
383 | - | else bd | |
384 | - | ||
385 | - | ||
386 | - | let be = 1 | |
387 | - | ||
388 | - | @Callable(U) | |
389 | - | func issueHandicapIndex () = { | |
390 | - | let H = toBase58String(U.caller.bytes) | |
391 | - | let bf = 20 | |
392 | - | let bg = { | |
393 | - | let I = getInteger(this, (H + "_round_count")) | |
394 | - | if ($isInstanceOf(I, "Int")) | |
395 | - | then { | |
396 | - | let f = I | |
397 | - | f | |
398 | - | } | |
399 | - | else -1 | |
400 | - | } | |
401 | - | let bh = "4_&&_6_&&_7_&&_4_&&_7_&&_8_&&_5_&&_8_&&_6_&&_6_&&_7_&&_8_&&_6_&&_6_&&_5_&&_7_&&_7_&&_6" | |
402 | - | let bi = "3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ_&&_course_1_&&_course_2_&&_green_1_&&_70_&&_110_&&_men_&&_1622640688000_&&_cloudy_&&_11" | |
403 | - | let bj = "4_&&_4_&&_4_&&_4_&&_3_&&_5_&&_4_&&_5_&&_6_&&_5_&&_3_&&_5_&&_4_&&_4_&&_5_&&_4_&&_4_&&_4" | |
404 | - | let bk = "1_&&_2_&&_3_&&_4_&&_5_&&_6_&&_7_&&_8_&&_9_&&_10_&&_11_&&_12_&&_13_&&_14_&&_15_&&_16_&&_17_&&_18" | |
405 | - | let bl = D(split(bh, "_&&_")) | |
406 | - | let bm = D(split(bh, "_&&_")) | |
407 | - | let bn = D(split(bh, "_&&_")) | |
408 | - | let bo = split(bi, "_&&_") | |
409 | - | let bp = split(bi, "_&&_") | |
410 | - | let bq = split(bi, "_&&_") | |
411 | - | let br = D(split(bj, "_&&_")) | |
412 | - | let bs = D(split(bj, "_&&_")) | |
413 | - | let bt = D(split(bj, "_&&_")) | |
414 | - | let bu = D(split(bk, "_&&_")) | |
415 | - | let bv = D(split(bk, "_&&_")) | |
416 | - | let bw = D(split(bk, "_&&_")) | |
417 | - | let bx = aR(bl, br, bu, parseIntValue(bo[5]), parseIntValue(bo[6]), bf) | |
418 | - | let by = aR(bm, bs, bv, parseIntValue(bp[5]), parseIntValue(bp[6]), bf) | |
419 | - | let bz = aR(bn, bt, bw, parseIntValue(bq[5]), parseIntValue(bq[6]), bf) | |
420 | - | let bA = max([bx, by, bz]) | |
421 | - | let bb = (bA - 2) | |
422 | - | let L = bc(bb) | |
423 | - | [Reissue(a, L, false), IntegerEntry((H + "_handicapIndex"), L), ScriptTransfer(U.caller, L, a)] | |
424 | - | } | |
425 | - | ||
426 | - | ||
427 | - | @Verifier(bB) | |
428 | - | func bC () = sigVerify(bB.bodyBytes, bB.proofs[0], bB.senderPublicKey) | |
44 | + | @Verifier(p) | |
45 | + | func q () = sigVerify(p.bodyBytes, p.proofs[0], p.senderPublicKey) | |
429 | 46 |
github/deemru/w8io/026f985 47.89 ms ◑