Coaches often need to summarize weekly performance for each athlete. This task will help automate that process. Imagine you are given a list of dictionaries, each representing an athlete with their name and a list of their running distances (in kilometers) for each day of the week. Your goal is to write a function that calculates the total distance run by each athlete during the week and returns a new list of dictionaries with each athlete's name and their total distance.


import unittest
import user_code
import ast
import re   
import importlib
import csv
import unittest
import importlib

class TestTask(unittest.TestCase):
    def test_returns_list_of_same_length(self):
        import user_code
        importlib.reload(user_code)
        athletes = [
            {"name": "A", "distances": [1,2,3]},
            {"name": "B", "distances": [4,5,6]},
            {"name": "C", "distances": [7,8,9]}
        ]
        result = user_code.calculate_weekly_progress(athletes)
        _dynamic_test(
            self,
            isinstance(result, list) and len(result) == len(athletes),
            "Returned list has same number of elements as input list.",
            f"Expected list length {len(athletes)}, got {len(result)}."
        )

    def test_names_match(self):
        import user_code
        importlib.reload(user_code)
        athletes = [
            {"name": "Alice", "distances": [1,1,1]},
            {"name": "Bob", "distances": [2,2,2]},
        ]
        result = user_code.calculate_weekly_progress(athletes)
        expected_names = [athlete["name"] for athlete in athletes]
        actual_names = [d.get("name") for d in result]
        _dynamic_test(
            self,
            actual_names == expected_names,
            "Names in output match input records.",
            f"Expected names {expected_names}, got {actual_names}."
        )

    def test_total_distance_correct(self):
        import user_code
        importlib.reload(user_code)
        athletes = [
            {"name": "A", "distances": [1,2,3]},
            {"name": "B", "distances": [4,5,6]},
            {"name": "C", "distances": [0,0,0]}
        ]
        result = user_code.calculate_weekly_progress(athletes)
        expected_totals = [sum(a["distances"]) for a in athletes]
        actual_totals = [d.get("total_distance") for d in result]
        _dynamic_test(
            self,
            actual_totals == expected_totals,
            "Each total_distance is the sum of input distances.",
            f"Expected totals {expected_totals}, got {actual_totals}."
        )

    def test_empty_distances(self):
        import user_code
        importlib.reload(user_code)
        athletes = [
            {"name": "D", "distances": []},
            {"name": "E", "distances": [1,2]},
        ]
        result = user_code.calculate_weekly_progress(athletes)
        found = False
        for i, athlete in enumerate(athletes):
            if athlete["distances"] == []:
                found = True
                total = result[i].get("total_distance")
                _dynamic_test(
                    self,
                    total == 0,
                    "Handles empty distances list by returning 0.",
                    f"Expected total_distance 0 for empty distances, got {total}."
                )
        _dynamic_test(
            self,
            found,
            "Test included athlete with empty distances.",
            "Test did not include any athlete with empty distances."
        )

def _dynamic_test(test_case, condition, success_message, failure_message):
    if condition:
        test_case._testMethodName = success_message
        test_case.assertTrue(True, success_message)
    else:
        test_case._testMethodName = failure_message
        test_case.fail(failure_message)

def normalize_text(text):
    text = text.lower()
    text = re.sub(r"\\s{2,}", " ", text)
    text = re.sub(r"\\s*([,:?])\\s*", r"\\1 ", text)
    return text.strip()

def change_var(code: str, var_name: str, value: str) -> str:
    tree = ast.parse(code)
    lines = code.splitlines()
    changed = False
    # Collect all assignment nodes to modify
    assign_nodes = [
        (i, node)
        for i, node in enumerate(tree.body)
        if isinstance(node, ast.Assign)
        and any(isinstance(target, ast.Name) and target.id == var_name for target in node.targets)
    ]

    # If nothing to change, return unmodified code
    if not assign_nodes:
        return code

    # Perform replacements for all matching assignments (from last to first to not break line offsets)
    for i, node in reversed(assign_nodes):
        start_line = node.lineno - 1
        line = lines[start_line]
        indent = ' ' * (len(line) - len(line.lstrip()))
        lines[start_line] = f"{indent}{var_name} = {value}"
        next_line = len(lines)
        for next_node in tree.body[i+1:]:
            if hasattr(next_node, 'lineno'):
                next_line = next_node.lineno - 1
                break
        if next_line > start_line + 1:
            lines[start_line+1:next_line] = []
        changed = True

    return '\\n'.join(lines) if changed else code

if __name__ == "__main__":
    unittest.main()


test_main.py

A practical Python course designed specifically for coaches, trainers, and sports professionals. Learn how to leverage Python to analyze performance, track progress, and make data-driven decisions to enhance coaching outcomes.

Learn how to use Python to monitor, analyze, and visualize individual athlete progress and performance metrics.

Use Python to analyze and compare team-level data, uncover trends, and support strategic coaching decisions.

Explore how Python can automate repetitive coaching tasks, generate reports, and provide actionable insights.

Challenge: Calculate Weekly Progress

Lösning

Challenge: Calculate Weekly Progress

Lösning