tx · T2DuyaA4XdGoMoZoc3iHGRCNCUyRGABVDcB2YYpZopZ

3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ:  -0.01400000 Waves

2021.06.04 05:35 [1555032] smart account 3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ > SELF 0.00000000 Waves

{ "type": 13, "id": "T2DuyaA4XdGoMoZoc3iHGRCNCUyRGABVDcB2YYpZopZ", "fee": 1400000, "feeAssetId": null, "timestamp": 1622774108984, "version": 2, "chainId": 84, "sender": "3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ", "senderPublicKey": "8uKVzAZCurBgbPFEaE9HYgJBH3oZsefwxNMgj4srAFJ9", "proofs": [ "rpgQkokBnmrE6XTk8PMMdBzJ7KGGEA6FPNYHYEb23mbtucW2G8BWLQQP62RbKUKpKGJwetY125mk3PpphFM5uPR" ], "script": "base64:AAIFAAAAAAAAAAoIAhIGCgQBAQEIAAAAAgAAAAAHaGFuZGlJZAEAAAAgmQAVX3L5MYxyaOxZ0FMoThkZR49kvwgxlwjo6C/iIRcBAAAAGWhhbmRpY2FwSW5kZXhSZXF1aXJlbWVudHMAAAABAAAAA251bQMJAABmAAAAAgUAAAADbnVtAAAAAAAAAAA2AAAAAAAAAAA2AwkAAGYAAAACAAAAAAAAAAAABQAAAANudW0AAAAAAAAAAAAFAAAAA251bQAAAAEAAAABaQEAAAAOcmVzdWx0SGFuZGljYXAAAAAEAAAAEnNjb3JlRGlmZmVyZW50aWFsMQAAABJzY29yZURpZmZlcmVudGlhbDIAAAASc2NvcmVEaWZmZXJlbnRpYWwzAAAACmN1cnJlbnRLZXkEAAAAF3Njb3JlRGlmZmVyZW50aWFsTG93ZXN0CQABlgAAAAEJAARMAAAAAgUAAAASc2NvcmVEaWZmZXJlbnRpYWwxCQAETAAAAAIFAAAAEnNjb3JlRGlmZmVyZW50aWFsMgkABEwAAAACBQAAABJzY29yZURpZmZlcmVudGlhbDMFAAAAA25pbAQAAAAGcmVzdWx0CQAAZQAAAAIFAAAAF3Njb3JlRGlmZmVyZW50aWFsTG93ZXN0AAAAAAAAAAACBAAAAA1oYW5kaWNhcEluZGV4CQEAAAAZaGFuZGljYXBJbmRleFJlcXVpcmVtZW50cwAAAAEFAAAABnJlc3VsdAkABRQAAAACCQAETAAAAAIJAQAAAAxCb29sZWFuRW50cnkAAAACAgAAAAZyZXN1bHQGCQAETAAAAAIJAQAAAAxJbnRlZ2VyRW50cnkAAAACCQABLAAAAAIFAAAACmN1cnJlbnRLZXkCAAAADl9oYW5kaWNhcEluZGV4BQAAAA1oYW5kaWNhcEluZGV4CQAETAAAAAIJAQAAAAdSZWlzc3VlAAAAAwUAAAAHaGFuZGlJZAUAAAANaGFuZGljYXBJbmRleAcJAARMAAAAAgkBAAAADlNjcmlwdFRyYW5zZmVyAAAAAwgFAAAAAWkAAAAGY2FsbGVyBQAAAA1oYW5kaWNhcEluZGV4BQAAAAdoYW5kaUlkBQAAAANuaWwFAAAADWhhbmRpY2FwSW5kZXgAAAABAAAAAnR4AQAAAAZ2ZXJpZnkAAAAACQAB9AAAAAMIBQAAAAJ0eAAAAAlib2R5Qnl0ZXMJAAGRAAAAAggFAAAAAnR4AAAABnByb29mcwAAAAAAAAAAAAgFAAAAAnR4AAAAD3NlbmRlclB1YmxpY0tleTyUBIM=", "height": 1555032, "applicationStatus": "succeeded", "spentComplexity": 0 } View: original | compacted Prev: BQHGKJFcGdbczLnfFKpTsNt8fb8PV7F55fWtGN54oZ65 Next: 2XVy7W7F4c4AucAxAEnM9VjqHr5MsW3svXvqKivYuPS4 Full:
OldNewDifferences
11 {-# STDLIB_VERSION 5 #-}
22 {-# SCRIPT_TYPE ACCOUNT #-}
33 {-# CONTENT_TYPE DAPP #-}
4-let a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]
4+let a = base58'BJFTCAVHNhppygeLqYUyG5NB9GwNRjEjFeweJpXXi1DQ'
55
6-func b (c) = {
7- func d (e,f) = (e + f)
6+func b (c) = if ((c > 54))
7+ then 54
8+ else if ((0 > c))
9+ then 0
10+ else c
811
9- let g = c
10- let h = size(g)
11- let i = 0
12- if ((h == 0))
13- then i
14- else {
15- let j = d(i, g[0])
16- if ((h == 1))
17- then j
18- else {
19- let k = d(j, g[1])
20- if ((h == 2))
21- then k
22- else {
23- let l = d(k, g[2])
24- if ((h == 3))
25- then l
26- else {
27- let m = d(l, g[3])
28- if ((h == 4))
29- then m
30- else {
31- let n = d(m, g[4])
32- if ((h == 5))
33- then n
34- else {
35- let o = d(n, g[5])
36- if ((h == 6))
37- then o
38- else {
39- let p = d(o, g[6])
40- if ((h == 7))
41- then p
42- else {
43- let q = d(p, g[7])
44- if ((h == 8))
45- then q
46- else {
47- let r = d(q, g[8])
48- if ((h == 9))
49- then r
50- else {
51- let s = d(r, g[9])
52- if ((h == 10))
53- then s
54- else {
55- let t = d(s, g[10])
56- if ((h == 11))
57- then t
58- else {
59- let u = d(t, g[11])
60- if ((h == 12))
61- then u
62- else {
63- let v = d(u, g[12])
64- if ((h == 13))
65- then v
66- else {
67- let w = d(v, g[13])
68- if ((h == 14))
69- then w
70- else {
71- let x = d(w, g[14])
72- if ((h == 15))
73- then x
74- else {
75- let y = d(x, g[15])
76- if ((h == 16))
77- then y
78- else {
79- let z = d(y, g[16])
80- if ((h == 17))
81- then z
82- else {
83- let A = d(z, g[17])
84- if ((h == 18))
85- then A
86- else {
87- let B = d(A, g[18])
88- throw("List size exceed 18")
89- }
90- }
91- }
92- }
93- }
94- }
95- }
96- }
97- }
98- }
99- }
100- }
101- }
102- }
103- }
104- }
105- }
106- }
107- }
12+
13+@Callable(d)
14+func resultHandicap (e,f,g,h) = {
15+ let i = max([e, f, g])
16+ let j = (i - 2)
17+ let k = b(j)
18+ $Tuple2([BooleanEntry("result", true), IntegerEntry((h + "_handicapIndex"), k), Reissue(a, k, false), ScriptTransfer(d.caller, k, a)], k)
10819 }
10920
11021
111-func C (c) = {
112- func D (E,e) = (E :+ parseIntValue(e))
113-
114- let F = c
115- let G = size(F)
116- let H = nil
117- if ((G == 0))
118- then H
119- else {
120- let I = D(H, F[0])
121- if ((G == 1))
122- then I
123- else {
124- let J = D(I, F[1])
125- if ((G == 2))
126- then J
127- else {
128- let K = D(J, F[2])
129- if ((G == 3))
130- then K
131- else {
132- let L = D(K, F[3])
133- if ((G == 4))
134- then L
135- else {
136- let M = D(L, F[4])
137- if ((G == 5))
138- then M
139- else {
140- let N = D(M, F[5])
141- if ((G == 6))
142- then N
143- else {
144- let O = D(N, F[6])
145- if ((G == 7))
146- then O
147- else {
148- let P = D(O, F[7])
149- if ((G == 8))
150- then P
151- else {
152- let Q = D(P, F[8])
153- if ((G == 9))
154- then Q
155- else {
156- let R = D(Q, F[9])
157- if ((G == 10))
158- then R
159- else {
160- let S = D(R, F[10])
161- if ((G == 11))
162- then S
163- else {
164- let T = D(S, F[11])
165- if ((G == 12))
166- then T
167- else {
168- let U = D(T, F[12])
169- if ((G == 13))
170- then U
171- else {
172- let V = D(U, F[13])
173- if ((G == 14))
174- then V
175- else {
176- let W = D(V, F[14])
177- if ((G == 15))
178- then W
179- else {
180- let X = D(W, F[15])
181- if ((G == 16))
182- then X
183- else {
184- let Y = D(X, F[16])
185- if ((G == 17))
186- then Y
187- else {
188- let Z = D(Y, F[17])
189- if ((G == 18))
190- then Z
191- else {
192- let aa = D(Z, F[18])
193- throw("List size exceed 18")
194- }
195- }
196- }
197- }
198- }
199- }
200- }
201- }
202- }
203- }
204- }
205- }
206- }
207- }
208- }
209- }
210- }
211- }
212- }
213- }
214-
215-
216-func ab (ac,ad) = {
217- let ae = getString(this, ((ad + "_round_score_") + toString(ac)))
218- if ($isInstanceOf(ae, "String"))
219- then {
220- let e = ae
221- e
222- }
223- else ""
224- }
225-
226-
227-func af (ac,ad) = {
228- let ae = getString(this, ((ad + "_round_course_") + toString(ac)))
229- if ($isInstanceOf(ae, "String"))
230- then {
231- let e = ae
232- e
233- }
234- else ""
235- }
236-
237-
238-func ag () = {
239- let ah = ["6", "5", "4"]
240- parseInt(ah[0])
241- }
242-
243-
244-func ai (aj,ak) = if ((aj >= ak))
245- then 1
246- else 0
247-
248-
249-func al (am,an,ao,ap) = {
250- func D (aq,ar) = {
251- let as = ai(ap, ao[ar])
252- let at = ((an[ar] + 2) + as)
253- if ((am[ar] > at))
254- then (aq :+ at)
255- else (aq :+ am[ar])
256- }
257-
258- let au = a
259- let av = size(au)
260- let aw = nil
261- if ((av == 0))
262- then aw
263- else {
264- let ax = D(aw, au[0])
265- if ((av == 1))
266- then ax
267- else {
268- let ay = D(ax, au[1])
269- if ((av == 2))
270- then ay
271- else {
272- let az = D(ay, au[2])
273- if ((av == 3))
274- then az
275- else {
276- let aA = D(az, au[3])
277- if ((av == 4))
278- then aA
279- else {
280- let aB = D(aA, au[4])
281- if ((av == 5))
282- then aB
283- else {
284- let aC = D(aB, au[5])
285- if ((av == 6))
286- then aC
287- else {
288- let aD = D(aC, au[6])
289- if ((av == 7))
290- then aD
291- else {
292- let aE = D(aD, au[7])
293- if ((av == 8))
294- then aE
295- else {
296- let aF = D(aE, au[8])
297- if ((av == 9))
298- then aF
299- else {
300- let aG = D(aF, au[9])
301- if ((av == 10))
302- then aG
303- else {
304- let aH = D(aG, au[10])
305- if ((av == 11))
306- then aH
307- else {
308- let aI = D(aH, au[11])
309- if ((av == 12))
310- then aI
311- else {
312- let aJ = D(aI, au[12])
313- if ((av == 13))
314- then aJ
315- else {
316- let aK = D(aJ, au[13])
317- if ((av == 14))
318- then aK
319- else {
320- let aL = D(aK, au[14])
321- if ((av == 15))
322- then aL
323- else {
324- let aM = D(aL, au[15])
325- if ((av == 16))
326- then aM
327- else {
328- let aN = D(aM, au[16])
329- if ((av == 17))
330- then aN
331- else {
332- let aO = D(aN, au[17])
333- if ((av == 18))
334- then aO
335- else {
336- let aP = D(aO, au[18])
337- throw("List size exceed 18")
338- }
339- }
340- }
341- }
342- }
343- }
344- }
345- }
346- }
347- }
348- }
349- }
350- }
351- }
352- }
353- }
354- }
355- }
356- }
357- }
358-
359-
360-func aQ (am,an) = {
361- func D (aq,ar) = if ((am[ar] > (an[ar] + 5)))
362- then (aq :+ (an[ar] + 5))
363- else (aq :+ am[ar])
364-
365- let aR = a
366- let aS = size(aR)
367- let aT = nil
368- if ((aS == 0))
369- then aT
370- else {
371- let aU = D(aT, aR[0])
372- if ((aS == 1))
373- then aU
374- else {
375- let aV = D(aU, aR[1])
376- if ((aS == 2))
377- then aV
378- else {
379- let aW = D(aV, aR[2])
380- if ((aS == 3))
381- then aW
382- else {
383- let aX = D(aW, aR[3])
384- if ((aS == 4))
385- then aX
386- else {
387- let aY = D(aX, aR[4])
388- if ((aS == 5))
389- then aY
390- else {
391- let aZ = D(aY, aR[5])
392- if ((aS == 6))
393- then aZ
394- else {
395- let ba = D(aZ, aR[6])
396- if ((aS == 7))
397- then ba
398- else {
399- let bb = D(ba, aR[7])
400- if ((aS == 8))
401- then bb
402- else {
403- let bc = D(bb, aR[8])
404- if ((aS == 9))
405- then bc
406- else {
407- let bd = D(bc, aR[9])
408- if ((aS == 10))
409- then bd
410- else {
411- let be = D(bd, aR[10])
412- if ((aS == 11))
413- then be
414- else {
415- let bf = D(be, aR[11])
416- if ((aS == 12))
417- then bf
418- else {
419- let bg = D(bf, aR[12])
420- if ((aS == 13))
421- then bg
422- else {
423- let bh = D(bg, aR[13])
424- if ((aS == 14))
425- then bh
426- else {
427- let bi = D(bh, aR[14])
428- if ((aS == 15))
429- then bi
430- else {
431- let bj = D(bi, aR[15])
432- if ((aS == 16))
433- then bj
434- else {
435- let bk = D(bj, aR[16])
436- if ((aS == 17))
437- then bk
438- else {
439- let bl = D(bk, aR[17])
440- if ((aS == 18))
441- then bl
442- else {
443- let bm = D(bl, aR[18])
444- throw("List size exceed 18")
445- }
446- }
447- }
448- }
449- }
450- }
451- }
452- }
453- }
454- }
455- }
456- }
457- }
458- }
459- }
460- }
461- }
462- }
463- }
464- }
465-
466-
467-func bn (am,an,ao,ap) = if ((ap == -1))
468- then aQ(am, an)
469- else al(am, an, ao, ap)
470-
471-
472-func bo (ah,bp,ao,bq,br,ap) = {
473- let bs = bn(ah, bp, ao, ap)
474- let bt = b(bs)
475- let bu = b(ah)
476- let bv = 0
477- let e = (113 / br)
478- let f = ((bt - bq) - bv)
479- let bw = 1
480- let bx = fraction(e, f, bw, HALFUP)
481- bx
482- }
483-
484-
485-let by = 1
486-
487-@Callable(ar)
488-func issueHandicapIndex (bz,bA,bB,bC,bD,bE) = {
489- let ad = toBase58String(ar.caller.bytes)
490- let bF = 20
491- let bG = {
492- let ae = getInteger(this, (ad + "_round_count"))
493- if ($isInstanceOf(ae, "Int"))
494- then {
495- let e = ae
496- e
497- }
498- else -1
499- }
500- let bH = "4_&&_6_&&_7_&&_4_&&_7_&&_8_&&_5_&&_8_&&_6_&&_6_&&_7_&&_8_&&_6_&&_6_&&_5_&&_7_&&_7_&&_6"
501- let bI = "3N8DnpwTffUEjDXXEsn6btFrbgWC8VZJhTZ_&&_course_1_&&_course_2_&&_green_1_&&_70_&&_110_&&_men_&&_1622640688000_&&_cloudy_&&_11"
502- let bJ = "4_&&_4_&&_4_&&_4_&&_3_&&_5_&&_4_&&_5_&&_6_&&_5_&&_3_&&_5_&&_4_&&_4_&&_5_&&_4_&&_4_&&_4"
503- let bK = "1_&&_2_&&_3_&&_4_&&_5_&&_6_&&_7_&&_8_&&_9_&&_10_&&_11_&&_12_&&_13_&&_14_&&_15_&&_16_&&_17_&&_18"
504- let bL = C(split(ab(bG, ad), "_&&_"))
505- let bM = C(split(ab((bG - 1), ad), "_&&_"))
506- let bN = C(split(ab((bG - 2), ad), "_&&_"))
507- let bO = split(af(bG, ad), "_&&_")
508- let bP = split(af((bG - 1), ad), "_&&_")
509- let bQ = split(af((bG - 2), ad), "_&&_")
510- let bR = C(split(bz, "_&&_"))
511- let bS = C(split(bA, "_&&_"))
512- let bT = C(split(bB, "_&&_"))
513- let bU = C(split(bC, "_&&_"))
514- let bV = C(split(bD, "_&&_"))
515- let bW = C(split(bE, "_&&_"))
516- let bX = bo(bL, bR, bU, parseIntValue(bO[5]), parseIntValue(bO[6]), bF)
517- let bY = bo(bM, bS, bV, parseIntValue(bP[5]), parseIntValue(bP[6]), bF)
518- let bZ = bo(bN, bT, bW, parseIntValue(bQ[5]), parseIntValue(bQ[6]), bF)
519- let ca = "3My7znnhd1L35kRQZWXJXZa6PBDfr9oN6Wu"
520- let aj = invoke(addressFromStringValue(ca), "resultHandicap", [bX, bY, bZ, ad], nil)
521- nil
522- }
523-
524-
525-@Verifier(cb)
526-func cc () = sigVerify(cb.bodyBytes, cb.proofs[0], cb.senderPublicKey)
22+@Verifier(l)
23+func m () = sigVerify(l.bodyBytes, l.proofs[0], l.senderPublicKey)
52724

github/deemru/w8io/026f985 
38.36 ms