/
ksushaksusha
/
Python
Обзор
Документация
Войти
/
ksushaksusha
/
Python
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
project_euler/problem_015/sol2.py
32 строки
733 B
Mindaugas
Add euler project problem 15 additional solution (#12774)
13 мар 2026, 00:00
Не верифицирован
13 мар 2026, 00:00
a2efba5
Код
Авторство
О чём код?
""" Problem 15: https://projecteuler.net/problem=15 Starting in the top left corner of a 2x2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner. How many such routes are there through a 20x20 grid? """ def solution(n: int = 20) -> int: """ Solve by explicitly counting the paths with dynamic programming. >>> solution(6) 924 >>> solution(2) 6 >>> solution(1) 2 """ counts = [[1 for _ in range(n + 1)] for _ in range(n + 1)] for i in range(1, n + 1): for j in range(1, n + 1): counts[i][j] = counts[i - 1][j] + counts[i][j - 1] return counts[n][n] if __name__ == "__main__": print(solution())