Assignment 8.1: Jumps (4 points)

You are playing a game which has \(n\) levels. You start from the level \(0\) and your goal is to reach the level \(n\) by jumping from a level to another. From every level you're able to jump only to \(a\) or \(b\) levels higher. In how many different ways can you complete the game?

e.g.: let \(n=8\), \(a=2\) and \(b=3\), there are \(4\) different ways to pass the game.
Create a function jumps(n: int, a: int, b: int) in Python which returns the number of all possible ways to complete the game.

Limist (you can assume that):
Targets:
  1. correct solution: \(2\) points
  2. performs in \(\Theta (n)\) time: \(+2\) points (the solution must be correct)
A code template with an example program:

def jumps(n, a, b):
    # TODO


if __name__ == "__main__":
    print(jumps(4, 1, 2)) # 5
    print(jumps(8, 2, 3)) # 4
    print(jumps(11, 6, 7)) # 0
    print(jumps(30, 3, 5)) # 58
    print(jumps(100, 4, 5)) # 1167937

Submit your solution in CodeGrade as jumps.py.



Assignment 8.2: All Sums (4 points)

\(A\) is a list consisting of \(n\) integers. How many different sums can be generated with the given integers?

For example:
Create a function sums(A: list) in Python which computes the number of all different sums.

Limits (you can assume that): \(1 \leq n, a_i \leq 100\)

Target: The algorithm computes the awnser in less than \(1\) second (in CodeGrade)
  1. correct solution: \(2\) points
  2. performs in \(\Theta (n^3)\) time: \(+2\) points (the solution be must correct)
A code template with an example program:

def sums(items):
    # TODO


if __name__ == "__main__":
    print(sums([1, 2, 3]))                  # 6
    print(sums([2, 2, 3]))                  # 5
    print(sums([1, 3, 5, 1, 3, 5]))         # 18
    print(sums([1, 15, 5, 23, 100, 55, 2])) # 121

Submit your solution in CodeGrade as sums.py.