Reply to thread

Message

<blockquote data-quote="olu bakka" data-source="post: 27973185" data-attributes="member: 369164">අම්මටහුඩු මාත් ඕක බලල python code එකක් ගැහුවමේ වගේ output එකක් ගන්න පුලුවන්[CODE]Enter from number: 5Enter to number: 10+------+------------+-------+| Seed | Max Number | Steps |+------+------------+-------+|&nbsp; 5&nbsp;&nbsp; |&nbsp; &nbsp;&nbsp; 16&nbsp; &nbsp;&nbsp; |&nbsp;&nbsp; 5&nbsp;&nbsp; ||&nbsp; 6&nbsp;&nbsp; |&nbsp; &nbsp;&nbsp; 16&nbsp; &nbsp;&nbsp; |&nbsp;&nbsp; 8&nbsp;&nbsp; ||&nbsp; 7&nbsp;&nbsp; |&nbsp; &nbsp;&nbsp; 52&nbsp; &nbsp;&nbsp; |&nbsp; 16&nbsp;&nbsp; ||&nbsp; 8&nbsp;&nbsp; |&nbsp; &nbsp;&nbsp; 8&nbsp; &nbsp; &nbsp; |&nbsp;&nbsp; 3&nbsp;&nbsp; ||&nbsp; 9&nbsp;&nbsp; |&nbsp; &nbsp;&nbsp; 52&nbsp; &nbsp;&nbsp; |&nbsp; 19&nbsp;&nbsp; ||&nbsp; 10&nbsp; |&nbsp; &nbsp;&nbsp; 16&nbsp; &nbsp;&nbsp; |&nbsp;&nbsp; 6&nbsp;&nbsp; |+------+------------+-------+Maximum number reached in the sequence = 52 (Seed number = [7, 9])Maxiumum steps = 19 (Seed number = [9])[/CODE][CODE=python]# Collatz Conjucture# Info - https://www.youtube.com/watch?v=094y1Z2wpJg&amp;ab_channel=Veritasiumfrom tabulate import tabulatedef calculation (n1, n2):&nbsp; &nbsp; i = 0&nbsp; &nbsp; nlist = []&nbsp; &nbsp; for x in range(n1, n2+1):&nbsp; &nbsp; &nbsp; &nbsp; maxn = 0&nbsp; &nbsp; &nbsp; &nbsp; s = 0&nbsp; &nbsp; &nbsp; &nbsp; nlist.append([])&nbsp; &nbsp; &nbsp; &nbsp; nlist[i].append(x)&nbsp; &nbsp; &nbsp; &nbsp; if x % 10000 == 0:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; print(round(((x - n1) / (n2 - n1)) * 100, 2), &quot;%&quot;)&nbsp; &nbsp; &nbsp; &nbsp; while True:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; #print(int(x), end=&quot; , &quot;)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if x &gt; maxn:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxn = x&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if x == 1:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; s += 1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if x % 2 == 1:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x = (3*x) + 1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x = x//2&nbsp; &nbsp; &nbsp; &nbsp; nlist[i].append(maxn)&nbsp; &nbsp; &nbsp; &nbsp; nlist[i].append(s)&nbsp; &nbsp; &nbsp; &nbsp; i += 1&nbsp; &nbsp; seqmaxn = 0&nbsp; &nbsp; maxnseed = []&nbsp; &nbsp; seqmaxs = 0&nbsp; &nbsp; maxsseed = []&nbsp; &nbsp; for q in nlist:&nbsp; &nbsp; &nbsp; &nbsp; if q[0] % 10000 == 0:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; print(round(50 + (((q[0] - n1) / (n2 - n1)) * 50), 2), &quot;%&quot;)&nbsp; &nbsp; &nbsp; &nbsp; if q[1] == seqmaxn:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxnseed.append(q[0])&nbsp; &nbsp; &nbsp; &nbsp; elif q[1] &gt; seqmaxn:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; seqmaxn = q[1]&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxnseed.clear()&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxnseed.append(q[0])&nbsp; &nbsp; &nbsp; &nbsp; if q[2] == seqmaxs:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxsseed.append(q[0])&nbsp; &nbsp; &nbsp; &nbsp; elif q[2] &gt; seqmaxs:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; seqmaxs = q[2]&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxsseed.clear()&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; maxsseed.append(q[0])&nbsp; &nbsp; print(tabulate(nlist, headers=[&quot;Seed&quot;, &quot;Max Number&quot;, &quot;Steps&quot;], tablefmt=&quot;pretty&quot;))&nbsp; &nbsp; print(f&quot;Maximum number reached in the sequence = {seqmaxn} (Seed number = {maxnseed})\nMaxiumum steps = {seqmaxs} (Seed number = {maxsseed})\n&quot;)while True:&nbsp; &nbsp; num1 = int(input(&quot;Enter from number: &quot;))&nbsp; &nbsp; num2 = int(input(&quot;Enter to number: &quot;))&nbsp; &nbsp; calculation(num1, num2)[/CODE]PS: කෝඩින් වල professional practices දන්නෙ නෑ යන්තන් අතපත ගානව විතරයි. ඒක හින්ද සමාවෙන්න ඕනෙ ගොන් පාට් තිබ්බොත්</blockquote>

[QUOTE="olu bakka, post: 27973185, member: 369164"] අම්මටහුඩු මාත් ඕක බලල python code එකක් ගැහුව මේ වගේ output එකක් ගන්න පුලුවන් [CODE]Enter from number: 5 Enter to number: 10 +------+------------+-------+ | Seed | Max Number | Steps | +------+------------+-------+ | 5 | 16 | 5 | | 6 | 16 | 8 | | 7 | 52 | 16 | | 8 | 8 | 3 | | 9 | 52 | 19 | | 10 | 16 | 6 | +------+------------+-------+ Maximum number reached in the sequence = 52 (Seed number = [7, 9]) Maxiumum steps = 19 (Seed number = [9])[/CODE] [CODE=python]# Collatz Conjucture # Info - https://www.youtube.com/watch?v=094y1Z2wpJg&ab_channel=Veritasium from tabulate import tabulate def calculation (n1, n2): i = 0 nlist = [] for x in range(n1, n2+1): maxn = 0 s = 0 nlist.append([]) nlist[i].append(x) if x % 10000 == 0: print(round(((x - n1) / (n2 - n1)) * 100, 2), "%") while True: #print(int(x), end=" , ") if x > maxn: maxn = x if x == 1: break else: s += 1 if x % 2 == 1: x = (3*x) + 1 else: x = x//2 nlist[i].append(maxn) nlist[i].append(s) i += 1 seqmaxn = 0 maxnseed = [] seqmaxs = 0 maxsseed = [] for q in nlist: if q[0] % 10000 == 0: print(round(50 + (((q[0] - n1) / (n2 - n1)) * 50), 2), "%") if q[1] == seqmaxn: maxnseed.append(q[0]) elif q[1] > seqmaxn: seqmaxn = q[1] maxnseed.clear() maxnseed.append(q[0]) if q[2] == seqmaxs: maxsseed.append(q[0]) elif q[2] > seqmaxs: seqmaxs = q[2] maxsseed.clear() maxsseed.append(q[0]) print(tabulate(nlist, headers=["Seed", "Max Number", "Steps"], tablefmt="pretty")) print(f"Maximum number reached in the sequence = {seqmaxn} (Seed number = {maxnseed})\nMaxiumum steps = {seqmaxs} (Seed number = {maxsseed})\n") while True: num1 = int(input("Enter from number: ")) num2 = int(input("Enter to number: ")) calculation(num1, num2)[/CODE] PS: කෝඩින් වල professional practices දන්නෙ නෑ යන්තන් අතපත ගානව විතරයි. ඒක හින්ද සමාවෙන්න ඕනෙ ගොන් පාට් තිබ්බොත් [/QUOTE]

Verification

Haya warak paha keeyada? (haya wadi kireema paha)

Search

Latest ads

Reply to thread