Algorithms Code Python

ពិត  មិនពិត

print(3 < 5 and 7 < 5)

print(3 < 5 and not(7 < 5))

print(2+2 == 5 or 2+2 == 4)

.......................................................................

def foo():

    print('Foo!')

    return True

if 2 + 2 == 5 and foo():

    print('True')

else:

    print('False')

.................................................................

a = (6, 2, 4)

print(all((i % 2 == 0) for i in a))

a = (2, 7, 6)

print(all((i % 2 == 0) for i in a)) 

.................................................

def is_divisible_by_3(x):

    return x % 3 == 0

lst = [5, 17, 6, 10]

print(not any([is_divisible_by_3(x) for x in lst]))

print(all([not is_divisible_by_3(x) for x in lst])) 

.........................................................

ប្រវែងម៉ាទ្រីស

def length(lst):

    if not lst:

        return 0

    else:

        return 1 + length(lst[1:])

print(length([5, 3, 2, 1, 7]))

...............................................................

ហ្វាក់តូរ្យែល

def factorial(n):

    assert n > 0

    result = 1

    for i in range(1, n + 1):

        result *= i  #result = result * i 

    return result

print(factorial(10))

................................................................

រក ចំនួនធំបំផុត

#Find maximum number of a, b, c

a=9

b=5

c=30

large=a

if b>large:

  large=b

if c>large:

  large=c

print(large)

.................................................................

#Find maximun element of Matrix A/ List A

A=[1, 3, 4, 8, 2, 4, 6, 1]

large=A[0]

for i in range(6):

  if A[i+1]>large:

   large=A[i+1]

print(large)

......................................................................

Multiple Matrix

# take a 3x3 matrix

A = [[12, 7, 3],

    [4, 5, 6],

    [7, 8, 9]]

# take a 3x4 matrix    

B = [[5, 8, 1, 2],

    [6, 7, 3, 0],

    [4, 5, 9, 1]]

result = [[0, 0, 0, 0],

        [0, 0, 0, 0],

        [0, 0, 0, 0]]

# iterating by row of A

for i in range(len(A)):

    # iterating by column by B

    for j in range(len(B[0])):

        # iterating by rows of B

        for k in range(len(B)):

            result[i][j] += A[i][k] * B[k][j]

for r in result:

    print(r)

សរសេរកូដ Python ដោះស្រាយ រក gcd , lcm   និង ដោះស្រាយសមីការឌីអូហ្វែនថាយ

រក gcd, lcm

a = int(input('a= '))

b = int(input('b= '))

c=a*b

while b > 0:

    r = a % b

    a, b = b, r

print('gcd(a,b)=',a)

print('lcm(a,b)=',c/a)

.....................................

ដោះស្រាយសមីការឌីអូហ្វែនថាយ

ប្រើ Euclidean Algorithm https://www.math.uwaterloo.ca/~snburris/htdocs/linear.html

from sympy import gcdex

def solve_equation(a, b, c):

    p, q, d = gcdex(a, b)

    return (p * c // d, q * c // d) if c % d == 0 \

        else 'no solution'

for a, b, c in ((391, 299, -69), (10, 6, 14), (10, 6, 15)):

    print(f'Solution to {a}x+{b}y={c}:',solve_equation(a, b, c))

........................................

RSA system

https://colab.research.google.com/drive/1r9irwlMJkllbLBeeEMp7U2M6XQF3TusU?usp=sharing

#RSA system :

# Public Key: (e,n)=(169, 23*31)=(169,713) ---> share to people

# Private Key: (d,n)=(289,713)---> Keep in secrete

..........................................

#find e for gcd(n=713,e)=1

import math

for e in range(660):

 if math.gcd(660,e)==1:

   print('e=',e)

................

#find d such that ed=1(mon phi(n))

import math

for d in range(660):

 if (169*d)%660==1:#169d=1(mod phi(n)), with e=169

   print('d=',d)

...........................

#C=m**e=144 find m, c^d=(m^e)^d=144^d (mod n)

m=(144**289)%713

print('m=',m)

.................

#CORRECT convert string into number

substr=str(input('LETTER:'))#substr='Hello My Friends'

alpha=' abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@!#$%^&*()+-=_?<>~[]{}'

l=len(alpha)

sl=len(substr)

M=0

for i in range(sl):

 k=alpha.rfind(substr[i])

 M+=k*(10**(2*(sl-i-1)))

print(M)

...................

#COORECTconvert from number to string

n=int(input('Number:'))#12344600246707989098690

alpha=' abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@!#$%^&*()+-=_?<>~[]{}'

str1=str(n)

l=len(str1)

for i in range(2,l+1,2):

 if l%2==0:

   d=n//(10**(l-i))

   di=(d%(100))%(len(alpha)+1)

 else:

   d=n//(10**(l-i+1))

   di=(d%(100))%(len(alpha)+1)

 print(alpha[di])