Support our Blind Hand Charity by donating at 9818291723. Your contribution has the potential to bring about significant positive change for humanity.

Search This Blog

Wednesday, September 27, 2023

CRAMMER'S RULE

print("Enter Coefficients in ax+by+cz=d format\n")

l=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]

for i in range(0,3):

    for j in range(0,4):

        x=int(input("Enter the value = "))

        l[j][i]=x


d=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]

for i in range(0,3):

    for j in range(0,3):

        d[j][i]=l[j][i]


dx=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]

for i in range(0,3):

    for j in range(0,3):

        if i==0:

            i1=3

        else:

            i1=i

        dx[j][i]=l[i1][j]


dy=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]

for i in range(0,3):

    for j in range(0,3):

        if i==1:

            i1=3

        else:

            i1=i

        dy[j][i]=l[i1][j]


dz=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]

for i in range(0,3):

    for j in range(0,3):

        if i==2:

            i1=3

        else:

            i1=i

        dz[j][i]=l[i1][j]


c=0

m=[d,dx,dy,dz]

for k in range(0,4):

    p=[]

    for i in range(0,3):

        for j in range(0,3):

            if j!=i and i!=2:

                x=m[k][1][j]*m[k][2][j+i+1]

                y=m[k][1][j+1+i]*m[k][2][j]

                if i%2==0:

                    p.append(m[k][0][i]*(x-y))

                else:

                    p.append(m[k][0][i]*(y-x))

            if j!=i and i==2 and j!=1:

                x=m[k][1][j]*m[k][2][j+i-1]

                y=m[k][1][j-1+i]*m[k][2][j]

                p.append(m[k][0][i]*(x-y))

    c1=0

    if k==0:

        for i in range(0,len(p)):

            c+=p[i]

    else:

        for i in range(0,len(p)):

            c1+=p[i]

    if k==1:

        print('X =',c1/c)

    elif k==2:

        print('Y =',c1/c)

    elif k==3:

        print('Z =',c1/c)

OUTPUT

Saturday, September 16, 2023

FILE WORD SEARCHER

SAVE FILE IN PYTHON FOLDER

CodeDrinc Test File

f=open("CoDrinc.txt")

fr=f.readline()

w=input("Enter the word to search = ")

s=0

p=0

while fr:

    c=0

    for i in fr.split():

        if w==i:

            p=1

            print(w,"found at",c,'column in line',s)

        else:

            c+=1

    fr=f.readline()

    s+=1

if p!=1:

    print("Word not found")

f.close()

OUTPUT

Friday, September 15, 2023

FILE READER

 SAVE FILE IN PYTHON FOLDER

CodeDrinc Test File


f=open("CoDrinc.txt")
c=0
w=0
a=0
n=0
s=0
sp=0
x=f.read()
for i in x.split():
    i.capitalize()
    for j in i:
        c+=1
        if j.isalpha():
            a+=1
        elif j.isnumeric():
            n+=1
        elif j in '!@#$%^&*()_=+-{[}}|\<,>.?/;:':
            s+=1
        elif j==' ':
            sp+=1
    w+=1
print('Number of characters =',c)
print('Number of special characters =',s)
print('Number of number =',n)
print('Number of alphabets =',a)
print('Number of words =',w)
print(x.title())
f.close()

OUTPUT



Saturday, September 9, 2023

TOWER OF HANOI

l=[]

t=-3

p=0

c=int(input("Enter range of elements = "))

for i in range(0,c):

    n=int(input("Enter the digit = "))

    l.append(n)

l.sort()

print()

for i in range(0,c):

    t+=2

    s=(t+1)//2

    for k in range(c-1,i,-1):

        print(' ',end="")

    for j in range(0,t+2):

        if s==0:

            p=1

        print(l[s],end="")

        if s>0 and p!=1:

            s-=1

        else:

            s+=1

    p=0

    print()

OUTPUT