Add files via upload

Author: akasgj007

heartpattern.py

@@ -0,0 +1,12 @@
+row = int(input())
+col = int(input())
+
+for i in range(row):
+    for j in range(col):
+        if (i==0 and j%3!=0) or (i==1 and j%3==0) or (i-j==2) or (i+j==8):
+            print(u"\u2661",end=" ")
+        else:
+            print(end="  ")
+    print()
+
+    #2661 2665 2764 2765 2766 2767

p1.py

@@ -0,0 +1,10 @@
+n = int (input("Enter the no"))
+i =1
+while True:
+    s = bin(i)[2:]
+    s  = s.replace('1','9')
+    m = int(s)
+    if ( m % n ==0):
+        print(m)
+        break
+    i+=1

p10.py

@@ -0,0 +1,32 @@
+num = int(input())
+list=[[0 for i in range(num)] for j in range(num)]
+c = int((num+1)//2)
+n=1
+low=0
+high=num-1
+for i in range(c):
+    for j in range(low,high+1):
+        list[i][j]=(n)
+        n+=1
+    for j in range(low+1,high+1):
+        list[j][high]=(n)
+        n+=1
+    for j in range(high-1,low-1,-1):
+        list[high][j]=(n)
+        n+=1
+    for j in range(high-1,low,-1):
+        list[j][low]=(n)
+        n+=1
+    low=low+1
+    high=high-1
+
+
+
+
+
+
+
+for i in range(num):
+    for j in range(num):
+        print(list[i][j],end="\t")
+    print()

p2.py

@@ -0,0 +1,16 @@
+n = int(input("enter:"))
+le,i=1,0
+while True:
+    s = bin(i)[2:]
+    s = s.zfill(le)
+    s = s.replace('1','9')
+    s = s.replace('0', '1')
+    m = int(s)
+    if(m%n==0):
+        print (m)
+        break
+i+=1
+
+if (i==2**le):
+     i=0
+     le+=1

p3.py

@@ -0,0 +1,26 @@
+#mapping method
+#l = input().split(" ")
+#l1 = list(map(int,l))
+#print(l1)
+def checksum (lis):
+    sum = 0
+    for i in range (len(lis)):
+        sum = sum + lis[i]
+    return sum
+
+sum1 = 0
+l = input().split(" ")
+n = len(l)
+l = list(map(int,l))
+for i in range(n-1) :
+    sum1 = sum1 + l[i]
+    sum2 = checksum(l[i+2:])
+    if sum1 == sum2 :
+        #print (sum1)
+        print (l[:i+1],l[i+2:])
+        #print (l[i+2:])
+    else :
+        print ("Equillibirum not exits")
+    i+=1
+
+

p4.py

@@ -0,0 +1,18 @@
+l = list(map(int,input().split(" ")))
+n = len(l)
+i,j,s1,s2,flag = 0,n-1,l[0],l[n-1],0
+while(i<j):
+    if(i+1==j-1 and s1==s2):
+        print ("Equillbrium is ",l[j-1])
+        print (l[:j-1],l[j:])
+        flag=1
+        break
+    elif(s1<s2):
+        i+=1
+        s1+=l[i]
+    else:
+        j-=1
+        s2+=l[j]
+
+if flag==0:
+    print("Equillibrium not exists")

p5.py

@@ -0,0 +1,63 @@
+"""#Moser De Brujin Sequence
+n = int(input())
+l=[0,1]
+i=1
+while(len(l)<=n):
+    l.append(l[i]*4)
+    l.append(l[i]*4+1)
+    i+=1
+print(l)
+print(l[n])
+"""
+"""def gen(n):
+    if n==0:
+        return 0
+    elif n==1:
+        return 1
+    elif n%2==0:
+        return 4 * gen(n//2)
+    else:
+        return 4 * gen(n//2) + 1
+
+def check(n):
+    for i in range(0):
+        print(gen(i),end=" ")
+
+print (check(n))
+"""
+""""
+"""
+"""str = input()
+print (int(str,base=17))
+"""
+"""
+#find the given term of that number
+n = int(input())
+m = list(map(int,bin(n)[2:]))
+print(m)
+m.reverse()
+print(m)
+l= len(m)
+print(l)
+s=0
+for i in range(l):
+    s=s+m[i]*(4**i)
+print (s)
+"""
+"""
+n=int(input())
+#n = int(bin(s)[2:],base=4)
+#print(int(bin(int(input()))[2:],base=4))
+#another method
+n=list(bin(n)[2:])
+n='0'.join(n)
+
+print(n)
+"""
+n=int(input())
+n=bin(n)[2:]
+s=n[1::2]
+if(s!=None or int(s)==0):
+    print("position of %d is %d"%(n,int(n[::2],base=2)))
+else:
+    print("Not Present")

p6.py

@@ -0,0 +1,9 @@
+l= list(map(int,input().split((","))))
+print(l)
+n = int(input("Enter no. to delete:"))
+try:
+  l.remove(n)
+  print(n,"removed")
+  print(l)
+except:
+   print("Item not list")

p7.py

@@ -0,0 +1,24 @@
+"""sen1 = list(input().split(" "))
+print(sen1)
+sent = list(input())
+
+print(sent)
+sen2 = sent
+sen2.reverse()
+print((sen2))
+if sent==sen2:
+    print("Palinddrome")
+
+
+print(sent)
+print(n)
+
+n.sort()
+print(n)
+
+print(n[le-1:])
+"""
+
+n = list(input().split(" "))
+for i in n:
+     print(i[::-1])

p8.py

@@ -0,0 +1,18 @@
+import itertools
+n = int(input())
+l = [i for i in range(1,n+1)]
+print(l)
+l3=[]
+l2=list(itertools.permutations(l))
+print(l2)
+print(len(l2))
+for i in l2:
+    for j in range(n):
+        if (i[j]==l[j]):
+            break
+        else:
+            l3.append(i)
+            break
+
+print(l3)
+print(len(l3))