Алгоритмы и языки и МЫ

import math # funp.py
def funp(x): # rextester.com/EGXCM83414
    rad = x * math.pi / 180
    a = x ** (1 / 4)
    b = x**(1/2) #; print (b)
    c = math.cos(rad); print(c)
    d = math.log10(x) #; print (d)
    e = math.exp(b)
    f = math.log(x,math.exp(1))    
    return a + b + c + d + e + f
 
x = 90
y = funp(x) 
print(x, y)

import random # milliardp.py
h1=0; h2=10**16;t=0; f=0
c = random.randrange(0,h2) #comp
h = random.randrange(0,h2) #human
while f<1:
    print(t,c,h)
    if h<c:
        print('MORE')
        a=h
        h=int((h+h2)/2)
        h1=a
    elif h>c:
        print('less')
        a=h
        h=int((h1+h)/2)
        h2=a
    else:
        print('win by', t, 'steps')
        f=1
    t+=1

import random
h1, h2 = 0, 10 ** 16
t = 0
c = random.randrange(h1, h2)
h = (h1 + h2) // 2
while h != c:
    print(f'Step {t}, c = {c}, h = {h}')
    if h < c:
        #print('MORE')
        h, h1 = (h + h2) // 2, h
    elif h > c:
        #print('less')
        h, h2 = (h1 + h) // 2, h
    t += 1
print(f'c = {h}, win by {t} steps')

import random
low, high = 0, 10 ** 16
steps = 0
c = random.randrange(low, high + 1)
while low <= high:
    mid = (low + high) // 2
    steps += 1    
    print(f'Step {steps}: c = {c}, low = {low}, mid = {mid}, high = {high}')
    if mid < c:
        low = mid + 1
    elif mid > c:
        high = mid - 1
    else:
        print(f'c = {mid}, win by {steps} steps')
        break

import random # matrixsortp.py
n=3; m=5; a=[1,1]; b=[1,1]
a=[[random.randrange(0,9) for i in range (m)] for j in range (n)]
b=[[1 for i in range (m)] for j in range (n)]
 
for i in range (n):
    for j in range (m):
        print ("%2d" % a[i][j], end=' ')
        b[i][j]=a[i][j]
    print()
print()
 
for i in range (n):
    for j in range (m-1):
        for k in range (j+1,m):
           if (a[i][j]>a[i][k]):
               t=a[i][j]; a[i][j]=a[i][k]; a[i][k]=t;
 
for i in range (n):
    for j in range (m):
        print ("%2d" % a[i][j], end=' ')
    print()
print()
 
for i in range (n):
    for j in range (m):
        print ("%2d" % b[i][j], end=' ')
    print()
print()
 
for j in range (m):
    for i in range (n-1):
        for k in range (i+1,n):
            if (b[i][j]>b[k][j]):
               t=b[i][j]; b[i][j]=b[k][j]; b[k][j]=t;
 
for i in range (n):
    for j in range (m):
        print ("%2d" % b[i][j], end=' ')
    print()

d.sort(reverse=True)

for j in range(m):
    sorted_column = sorted([b[i][j] for i in range(n)])
    for i in range(n):
        b[i][j] = sorted_column[i]