Download 2025MCM_ICM/ProblemC/GreatCoach.py from edzee3000/GithubData: direct link, hf CLI and curl.
- Browser
- Download file 3.27 kB
-
https://huggingface.co/datasets/edzee3000/GithubData/resolve/main/2025MCM_ICM/ProblemC/GreatCoach.py
- Command line
-
hf download hf://datasets/edzee3000/GithubData/2025MCM_ICM/ProblemC/GreatCoach.py
-
curl -L -o GreatCoach.py https://huggingface.co/datasets/edzee3000/GithubData/resolve/main/2025MCM_ICM/ProblemC/GreatCoach.py
3.27 kB
| import pandas as pd | |
| import csv | |
| from collections import defaultdict | |
| import itertools | |
| def GreatCoach(): | |
| path = f"../predata/team_programs.csv" | |
| k=16 | |
| data=read_csv(path) | |
| improve_years = find_improve_fast_year(data) | |
| # print(improve_years) | |
| pairs = find_pairs_within_k(improve_years, k) | |
| print(pairs) | |
| WriteData(pairs) | |
| def LoadData(): | |
| path = f"../predata/team_programs.csv" | |
| df = pd.read_csv(path,index_col=0) | |
| return df | |
| # 读取CSV文件 | |
| def read_csv(file_name): | |
| data = defaultdict(lambda: defaultdict(dict)) | |
| with open(file_name, 'r') as file: | |
| reader = csv.DictReader(file) | |
| for row in reader: | |
| team = row['Team'] | |
| sport = row['Sport'] | |
| for year in range(1896, 2025, 4): | |
| if str(year) in row: | |
| data[sport][team][year] = float(row[str(year)]) | |
| return data | |
| # 找到每个国家在每个运动项目中的表现提升最快的年份 | |
| def find_improve_fast_year(data): | |
| improve_years = defaultdict(lambda: defaultdict(list)) | |
| improve_limit=15 | |
| for sport, teams in data.items(): | |
| for team, performances in teams.items(): | |
| max_increase = 0 | |
| improve_year = None | |
| sorted_years = sorted(performances.keys()) | |
| for i in range(1, len(sorted_years)): | |
| increase = performances[sorted_years[i]] - performances[sorted_years[i - 1]] | |
| if increase > max_increase and increase >= improve_limit: | |
| max_increase = increase | |
| improve_year = sorted_years[i] | |
| if improve_year: | |
| improve_years[sport][team].append(improve_year) | |
| return improve_years | |
| # 对每个链表进行排序并找到在窗口期k内的配对 | |
| def find_pairs_within_k(improve_years, k): | |
| pairs = defaultdict(list) | |
| for sport, teams in improve_years.items(): | |
| # print(teams) | |
| keys_list = list(teams.keys()) | |
| values_list = [values[0] for values in teams.values()] | |
| l=len(keys_list) | |
| for i in range(l): | |
| for j in range(i+1,l): | |
| team1=keys_list[i] | |
| team2=keys_list[j] | |
| year1=values_list[i] | |
| year2=values_list[j] | |
| if abs(year1-year2)<=k and abs(year1-year2)>=4: | |
| pairs[sport].append((team1, year1, team2, year2)) | |
| # for team1, year1 in teams.items(): | |
| # for team2, year2 in teams.items(): | |
| # if team1 != team2 and year1[0]!=year2[0]: | |
| # if abs(year1[0]-year2[0])<=k: | |
| # pairs[sport].append((team1, year1[0], team2, year2[0])) | |
| return pairs | |
| def WriteData(data): | |
| # 写入文件 | |
| path = f"./MaybeGreatCoachPairs.txt" | |
| # file_path = 'sports_data.txt' # 定义文件路径 | |
| with open(path, 'w', encoding='utf-8') as file: | |
| for sport, pairs in data.items(): | |
| # 将数据格式化为字符串 | |
| formatted_data = f"{sport} : {pairs}\n" | |
| file.write(formatted_data) # 写入文件 | |
| print(f"数据已成功写入文件:{path}") | |
| if __name__=="__main__": | |
| GreatCoach() | |