algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 10:48:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

from __future__ import annotations (#2464)

Browse Source 
* from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! Format Python code with psf/black push

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2020-09-23 13:30:13 +02:00
committed by GitHub
parent 6e6a49d19f
commit 9200a2e543
72 changed files with 275 additions and 250 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
project_euler/problem_39/sol1.py
View File

@ -6,11 +6,12 @@ If p is the perimeter of a right angle triangle with integral length sides,
For which value of p ≤ 1000, is the number of solutions maximised?
"""
from __future__ import annotations
from collections import Counter
from typing import Dict
def pythagorean_triple(max_perimeter: int) -> Dict:
def pythagorean_triple(max_perimeter: int) -> dict:
"""
Returns a dictionary with keys as the perimeter of a right angled triangle
and value as the number of corresponding triplets.