Files
pplus-web/mojo/corpus/quest/solutions/MQ_312.mojo
T
2026-10-05 03:03:38 +00:00

21 lines
985 B
Mojo

# ===----------------------------------------------------------------------=== #
# Copyright (c) 2026, Modular Inc. All rights reserved.
#
# Licensed under the Apache License v2.0 with LLVM Exceptions:
# https://llvm.org/LICENSE.txt
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
# ===----------------------------------------------------------------------=== #
# Mojo concept: Precedence determines what runs first (multiply before add); when in doubt, use parentheses
def path_cost(setup: Int, per_segment: Int, segments: Int) -> Int:
# setup plus per-segment cost, then multiplied across the segments
return (setup + per_segment) * segments
def main():
print("Total distance:", path_cost(2, 3, 4))