Applying Shortest Path Algorithms to Solve Congruence Problems
Given four positive integers (x, y, z, H), the goal is to count the number of integers (d) in the range ([0, H]) that can be expressed as (d = a x + b y + c z), where (a, b, c) are non-negative integers. If a value (k) can be written as (k = b y + c z) with non-negative (b) and (c), then (k) is a va...