curry function

0 likes • Nov 19, 2022
Python

More Python Posts

```primes=[]products=[]
def prime(num):    if num > 1:        for i in range(2,num):            if (num % i) == 0:                return False        else:            primes.append(num)            return True
for n in range(30,1000):    if len(primes) >= 20:        break;    else:        prime(n)
for previous, current in zip(primes[::2], primes[1::2]):    products.append(previous * current)    print (products)```
```import pandas as pd

print(x)```

Untitled

sebastianagauyao2002-61a8
0 likes • Apr 21, 2023
Python
`print("hellur")`

LeetCode Flood Fill

CodeCatch
0 likes • Oct 15, 2022
Python
```class Solution(object):    def floodFill(self, image, sr, sc, newColor):        R, C = len(image), len(image[0])        color = image[sr][sc]        if color == newColor: return image        def dfs(r, c):            if image[r][c] == color:                image[r][c] = newColor                if r >= 1: dfs(r-1, c)                if r+1 < R: dfs(r+1, c)                if c >= 1: dfs(r, c-1)                if c+1 < C: dfs(r, c+1)
dfs(sr, sc)        return image```

Nodes and Trees

AustinLeath
0 likes • Nov 18, 2022
Python
```import random
class Node:
def __init__(self, c):
self.left = None        self.right = None        self.color = c        def SetColor(self,c) :        self.color = c
def PrintNode(self) :        print(self.color)
def insert(s, root, i, n):    if i < n:        temp = Node(s[i])         root = temp         root.left = insert(s, root.left,2 * i + 1, n)         root.right = insert(s, root.right,2 * i + 2, n)    return root
def MakeTree(s) :    list = insert(s,None,0,len(s))    return list

def MakeSet() :    s = []    count = random.randint(7,12)    for _ in range(count) :        color = random.randint(0,1) == 0 and "Red" or "White"        s.append(color)    return s
def ChangeColor(root) :    if (root != None) :        if (root.color == "White") :            root.SetColor("Red")        ChangeColor(root.left)        ChangeColor(root.right)

def PrintList(root) :    if root.left != None :        PrintList(root.left)    else :        root.PrintNode()    if root.right != None :        PrintList(root.right)    else :        root.PrintNode()

t1 = MakeTree(MakeSet())print("Original Colors For Tree 1:\n")PrintList(t1)ChangeColor(t1)print("New Colors For Tree 1:\n")PrintList(t1)
t2 = MakeTree(MakeSet())print("Original Colors For Tree 2:\n")PrintList(t2)ChangeColor(t2)print("New Colors For Tree 2:\n")PrintList(t2)
t3 = MakeTree(MakeSet())print("Original Colors For Tree 3:\n")PrintList(t3)ChangeColor(t3)print("New Colors For Tree 3:\n")PrintList(t3)```
```from itertools import productV='∀'E='∃'

def tt(f,n) :  xss=product((0,1),repeat=n)  print('function:',f.__name__)  for xs in xss : print(*xs,':',int(f(*xs)))  print('')
# p \/ (q /\ r) = (p \/ q) /\ (p \/ r)
def prob1(p,q,r) :  x=p or (q and r)  y= (p or q) and (p or r)  return x==y
tt(prob1,3)
# p/\(q\/r)=(p/\q)\/(p/\r)
def prob2(p,q,r) :  x=p and ( q or r )  y=(p and q) or (p and r)  return x==y
tt(prob2,3)
#~(p/\q)=(~p\/~q)
def prob3(p,q) :  x=not (p and q)  y=(not p) or (not q)  return x==ytt(prob3,2)
#(~(p\/q))=((~p)/\~q)
def prob4(p, q):   x = not(p or q)   y = not p and not q   return x == y
tt(prob4, 2)
#(p/\(p=>q)=>q)
def prob5(p,q):  x= p and ( not p or q)  return not x or q    tt(prob5,2)
# (p=>q)=((p\/q)=q)
def prob6(p,q) :  x = (not p or q)  y=((p or q) == q)  return x==y tt(prob6,2)

#((p=>q)=(p\/q))=qdef prob7(p,q):  if ((not p or q)==(p or q))==q:    return 1 tt(prob7,2)

#(p=>q)=((p/\q)=p)def prob8(p,q):  if (not p or q)==((p and q)==p):    return 1 tt(prob8,2)

#((p=>q)=(p/\q))=p
def prob9(p,q):  if ((not p or q)==(p and q))==p:    return '1'
tt(prob9,2)

#(p=>q)/\(q=>r)=>(p=>r)def prob10(p,q,r) :  x = not ((not p or q) and (not q or r)) or (not p or r)  return x tt(prob10, 3)

# (p = q) /\ (q => r)  => (p => r)#answer 1def prob11(p,q,r) :  x = not((p is q) and (not q or r)) or (not p or r)  return x tt(prob11, 3)
#(p=q)/\(q=>r)=>(p=>r)#answer 2def prob11(p,q,r):  x=(p==q) and (not q or r)  y=not p or r  return not x or y
tt(prob11,3)
#((p=>q)/\(q=r))=>(p=>r)
def prob12(p,q,r):  x=(not p or q) and ( q==r )  y=not p or r  return not x or y
tt(prob12,3)
#(p=>q)=>((p/\r)=>(q/\r))
def prob13(p,q,r):  x=not p or q  y=(not(p and r) or ( q and r))  return not x or y
tt(prob13,3)
#Question#2----------------------------------------
#(p=>q)=>r=p=>(q=>r)
def prob14(p,q,r):  x=(not(not p or q) or r)  y=(not p or (not q or r))  return x==y
tt(prob14,3)

def prob15(p, q):    x = not(p and q)    y = not p and not q    return x == y
tt(prob15, 2)

def prob16(p, q):    x = not(p or q)    y = not p or not q    return x == y
tt(prob16, 2)

def prob17(p):    x = p    y = not p    return x == y
tt(prob17, 1)```