From d288475bf9595e7d6a1724a2ac412e3084669491 Mon Sep 17 00:00:00 2001
From: Sidney Zhang <zly@lyzhang.me>
Date: Fri, 9 Jan 2026 18:21:59 +0800
Subject: [PATCH] =?UTF-8?q?=E2=9C=A8=20feat(euler=5F39.py)=EF=BC=9A?=
 =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=AC=A7=E6=8B=89=E9=A1=B9=E7=9B=AE=E7=AC=AC?=
 =?UTF-8?q?39=E9=A2=98=E8=A7=A3=E5=86=B3=E6=96=B9=E6=A1=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 solutions/0039.IntegerTriangles/euler_39.py | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 solutions/0039.IntegerTriangles/euler_39.py

diff --git a/solutions/0039.IntegerTriangles/euler_39.py b/solutions/0039.IntegerTriangles/euler_39.py
new file mode 100644
index 0000000..69bb508
--- /dev/null
+++ b/solutions/0039.IntegerTriangles/euler_39.py
@@ -0,0 +1,8 @@
+"""
+If p is the perimeter of a right angle triangle with integral length sides,
+{a, b, c} , there are exactly three solutions for p = 120.
+
+{20,48,52},{24,45,51},{30,40,50}
+
+For which value of p<=1000, is the number of solutions maximised?
+"""