seongbeom_park/google-foobar-challenge
1
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

finish level5/disorderly-escape #8

Merged
seongbeom_park merged 6 commits from level5/disorderly-escape into main 2022-03-21 07:37:12 +00:00
Conversation 1 Commits 6 Files Changed 4 +7 -2
1 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 7d237786c0 - Show all commits

9
level5/disorderly-escape/solution.py
View File

@ -9,7 +9,10 @@ def solution(w, h, s):
if c not in memo_sp: if c not in memo_sp:
memo_sp[c] = s ** c memo_sp[c] = s ** c
cases += memo_sp[c] cases += memo_sp[c]
return str(cases / (memo_f[w] * memo_f[h])) result = cases
result /= memo_f[w]
result /= memo_f[h]
return str(result)
def generate_cycle_count(w, h, memo_f = {}): def generate_cycle_count(w, h, memo_f = {}):
memo_c = {} memo_c = {}
@ -75,7 +78,9 @@ def count_permutation(s, memo_f, memo_p):
for size, freq in group.items(): for size, freq in group.items():
if freq not in memo_f: if freq not in memo_f:
memo_f[freq] = math.factorial(freq) memo_f[freq] = math.factorial(freq)
result /= memo_f[freq] * (size ** freq) result /= memo_f[freq]
for i in range(freq):
result /= size
memo_p[s] = result memo_p[s] = result
return memo_p[s] return memo_p[s]