-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
0 parents
commit 9101ac2
Showing
2 changed files
with
88 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,71 @@ | ||
|
||
# ---- Global variables ------------------------------------------------------- | ||
N = int(input("\nEnter square size N: ")) # N - lenght of side | ||
LIST = [] | ||
NUMBER_LENGTH = len(str(N*N)) # Check how many digits the largest number has | ||
|
||
# ---- Class for colours ------------------------------------------------------ | ||
class bcolors: | ||
GREEN = '\033[92m' | ||
YELLOW = '\033[93m' | ||
|
||
# ---- Functtions ----- ------------------------------------------------------- | ||
def count_rooms(): | ||
# Find edge rooms in a given square of size N. Code complexity: 4x4 = 16. | ||
for i in range(1, N) : | ||
run_script(i+1) # top side | ||
run_script(N+N*i) # right side | ||
run_script(1 + (i-1)*N) # left side | ||
run_script(N*(N-1)+i) # bottom side | ||
|
||
def run_script(number): | ||
# Output to screen and append to a list | ||
#print(number) | ||
LIST.append(number) | ||
|
||
def print_image(): | ||
# visualize the results | ||
LIST.sort() | ||
print(LIST) | ||
print() | ||
string = "" | ||
|
||
for i in range(N): | ||
# top side | ||
number_block = blokify_number(LIST[i]) | ||
string += bcolors.GREEN + number_block | ||
|
||
string += "\n" | ||
|
||
for i in range(N-2): | ||
# right & left sides | ||
number_block = blokify_number(LIST[N+(i*2)]) # right side | ||
string += number_block | ||
string += " " + bcolors.YELLOW # offset by 1 space | ||
for n in range((N-2)*(NUMBER_LENGTH+1)-1): # block_size = NUMBER_LENGTH + 1; and offset by -1 | ||
string += "#" # square filling | ||
number_block = blokify_number(LIST[N+(i*2)+1]) # left side | ||
string += bcolors.GREEN + number_block | ||
string += "\n" | ||
|
||
for i in range(N): | ||
number_block = blokify_number(LIST[len(LIST)-N+i]) # bottom side | ||
string += number_block | ||
|
||
print(string) | ||
|
||
def blokify_number(number): | ||
# Create blocks of numbers by appending required amount of empty space in front | ||
number = str(number) | ||
block = " " | ||
for n in range(NUMBER_LENGTH - len(number)): | ||
block += " " | ||
|
||
number = block + number | ||
return(number) | ||
|
||
# ---- Main ------------------------------------------------------------------- | ||
if __name__ == '__main__': | ||
print("Maximum number length is: %d\nBlock size is: %d\n" % (NUMBER_LENGTH, NUMBER_LENGTH+1)) | ||
count_rooms() | ||
print_image() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
|
||
# Def list | ||
list = [2, 45, 1, 3, 4, 45, 5, 42, 46] | ||
|
||
dict = {} | ||
sum = 47 | ||
|
||
# Run list check | ||
for item in list: | ||
|
||
key = sum - item | ||
if dict.get(str(key)): | ||
print("%s, %s" % (str(key), str(item))) | ||
# Delete dict item | ||
dict.pop(str(key)) | ||
else: | ||
dict[str(item)] = item |