Compare commits

..
2 Commits
Author SHA1 Message Date
davide f56ffb7776 aggiunge esercizio 36 2026-04-09 19:58:47 +02:00
davide 1a2c044fb9 aggiunge esercizio 35 2026-04-09 18:54:38 +02:00
2 changed files with 66 additions and 0 deletions
+34
View File
@@ -0,0 +1,34 @@
print("Inserire le righe per verificare la validità del sudoku")
S = []
for i in range(9):
riga = input("Inserire riga: ")
riga_n = [int(c) for c in riga]
S.append(riga_n)
status = True
for j in range(9):
riga = S[j]
for n in range(1, 10):
if n not in riga:
status = False
for k in range(9):
colonna = [S[r][k] for r in range(9)]
for n in range(1, 10):
if n not in colonna:
status = False
for r in range(0, 9, 3):
for c in range(0, 9, 3):
quadrato = [S[r+dr][c+dc] for dr in range(3) for dc in range(3)]
for n in range(1, 10):
if n not in quadrato:
status = False
if status == True:
print("Si")
else:
print("No")
+32
View File
@@ -0,0 +1,32 @@
class Stack:
def __init__(self):
self.__stack_list = []
def push(self, val):
self.__stack_list.append(val)
def pop(self):
val = self.__stack_list[-1]
del self.__stack_list[-1]
return val
class CountingStack(Stack):
def __init__(self):
Stack.__init__(self)
self.__j = 0
def get_counter(self):
return self.__j
def pop(self):
self.__j += 1
return Stack.pop(self)
stk = CountingStack()
for i in range(100):
stk.push(i)
stk.pop()
print(stk.get_counter())