daviddoji/project-euler
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Ruff in pre-commit

Browse Source
This commit is contained in:
David Doblas Jiménez
2026-04-05 21:45:24 +02:00
parent 83515c4682
commit b485914e01
82 changed files with 4317 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

147
src/Julia/Problem054.jl Normal file
View File

@@ -0,0 +1,147 @@
#=
Created on 02 Oct 2021
@author: David Doblas Jiménez
@email: daviddoji@pm.me
Solution for Problem 54 of Project Euler
https://projecteuler.net/problem=54 =#
using BenchmarkTools
# function replace_values_in_string(text, args_dict)
# for (k, v) in args_dict
# text = text.replace(k, string(v))
# end
# return text
# end
# function n_of_a_kind(hand, n)
# return max([x for x in hand if hand.count(x) == n] || [0])
# end
# function to_numerical(hand)
# return sorted([int(x[:end]) for x in hand], reverse=True)
# end
# # 10 Ranks functions.
# function high_card(str_hand)
# return to_numerical(str_hand)
# end
# function one_pair(hand)
# return n_of_a_kind(hand, 2)
# end
# function two_pair(hand)
# pairs = set([x for x in hand if hand.count(x) == 2])
# return 0 if len(pairs) < 2 else max(pairs)
# end
# function three_of_a_kind(hand)
# return n_of_a_kind(hand, 3)
# end
# function straight(hand)
# return 0 if not list(range(hand[0], hand[-1]-1, -1)) == hand else max(hand)
# end
# function flush(str_hand)
# return len(set([x[-1] for x in str_hand])) == 1
# end
# function full_house(hand)
# return three_of_a_kind(hand) if one_pair(hand) and three_of_a_kind(hand) else 0
# end
# function four_of_a_kind(hand)
# return n_of_a_kind(hand, 4)
# end
# function straight_flush(str_hand)
# straight_result = straight(to_numerical(str_hand))
# return straight_result if straight_result and flush(str_hand) else 0
# end
# function royal_flush(str_hand)
# return flush(str_hand) && list(range(14, 9, -1)) == to_numerical(str_hand)
# end
function Problem54()
#=
In the card game poker, a hand consists of five cards and are ranked,
from lowest to highest, in the following way:
High Card: Highest value card.
One Pair: Two cards of the same value.
Two Pairs: Two different pairs.
Three of a Kind: Three cards of the same value.
Straight: All cards are consecutive values.
Flush: All cards of the same suit.
Full House: Three of a kind and a pair.
Four of a Kind: Four cards of the same value.
Straight Flush: All cards are consecutive values of same suit.
Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.
The cards are valued in the order:
2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.
If two players have the same ranked hands then the rank made up of the
highest value wins; for example, a pair of eights beats a pair of fives
(see example 1 below). But if two ranks tie, for example, both players
have a pair of queens, then highest cards in each hand are compared
(see example 4 below); if the highest cards tie then the next highest
cards are compared, and so on.
Consider the following five hands dealt to two players:
Hand Player 1 Player 2 Winner
1 5H 5C 6S 7S KD 2C 3S 8S 8D TD Player 2
Pair of Fives Pair of Eights
2 5D 8C 9S JS AC 2C 5C 7D 8S QH Player 1
Highest card Ace Highest card Queen
3 2D 9C AS AH AC 3D 6D 7D TD QD Player 2
Three Aces Flush with Diamonds
4 4D 6S 9H QH QC 3D 6D 7H QD QS Player 1
Pair of Queens Pair of Queens
Highest card Nine Highest card Seven
5 2H 2D 4C 4D 4S 3C 3D 3S 9S 9D Player 1
Full House Full House
With Three Fours with Three Threes
The file, poker.txt, contains one-thousand random hands dealt to two
players. Each line of the file contains ten cards (separated by a single
space): the first five are Player 1's cards and the last five are Player
2's cards. You can assume that all hands are valid (no invalid characters
or repeated cards), each player's hand is in no specific order, and in
each hand there is a clear winner.
How many hands does Player 1 win? =#
# replace_map = {"T"=> 10, "J"=> 11, "Q"=> 12, "K"=> 13, "A"=> 14}
# score = [0, 0]
# for line in open("../files/Problem54.txt", "r").read().splitlines():
# line = replace_values_in_string(line, replace_map).split()
# hands = line[:5], line[5:]
# for rank in (royal_flush, straight_flush, four_of_a_kind, full_house, flush,
# straight, three_of_a_kind, two_pair, one_pair, high_card):
# should_convert_hand = "str" not in rank.__code__.co_varnames[0] # Checks parameter name.
# result = [rank(to_numerical(hand) if should_convert_hand else hand) for hand in hands]
# if result[0] != result[1]:
# score[0 if result[0] > result[1] else 1] += 1
# break
# end
# end
# end
# return score[0]
return 0
end
println("Time to evaluate Problem $(lpad(54, 3, "0")):")
@btime Problem54()
println("")
println("Result for Problem $(lpad(54, 3, "0")): ", Problem54())

23
src/Julia/Problem060.jl Normal file
View File

@@ -0,0 +1,23 @@
#=
Created on 30 Oct 2021
@author: David Doblas Jiménez
@email: daviddoji@pm.me
Solution for Problem 60 of Project Euler
https://projecteuler.net/problem=60 =#
using BenchmarkTools
function Problem60()
#=
Statement =#
return
end
println("Time to evaluate Problem $(lpad(60, 3, "0")):")
@btime Problem60()
println("")
println("Result for Problem $(lpad(60, 3, "0")): ", Problem60())

88
src/Julia/Problems001-050/Problem011.jl Normal file
View File

@@ -0,0 +1,88 @@
#=
Created on 07 Jul 2021
@author: David Doblas Jiménez
@email: daviddoji@pm.me
Solution for Problem 11 of Project Euler
https://projecteuler.net/problem=11 =#
using BenchmarkTools
GRID = [
[8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
[49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
[81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
[52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91],
[22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80],
[24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50],
[32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70],
[67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
[24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
[21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
[78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
[16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
[86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
[19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
[4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
[88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
[4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
[20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
[20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
[1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48],
]
function grid_product(x, y, dx, dy, n)
result = 1
for i = 0:n
println("Accessing GRID: ", x, y, dx, dy)
println(y + i * dy, x + i * dx)
result *= GRID[y+i*dy][x+i*dx]
println("result from grid product: ", result)
end
return result
end
function Problem11()
#=
In the 20x20 grid above, four numbers along a diagonal line have been
marked in red.
The product of these numbers is 26 x 63 x 78 x 14 = 1788696.
What is the greatest product of four adjacent numbers in any direction
(up, down, left, right, or diagonally) in the 20x20 grid? =#
ans = 0
width = height = length(GRID)
adjacent_nums = 4
for y in 1:height
for x in 1:width
println("ans before: ", ans)
println(y, x)
if x + adjacent_nums <= width
ans = max(grid_product(x, y, 1, 0, adjacent_nums), ans)
end
if y + adjacent_nums <= height
ans = max(grid_product(x, y, 0, 1, adjacent_nums), ans)
end
if (x + adjacent_nums <= width) & (y + adjacent_nums <= height)
ans = max(grid_product(x, y, 1, 1, adjacent_nums), ans)
end
if (x - adjacent_nums >= -1) & (y + adjacent_nums <= height)
ans = max(grid_product(x, y, -1, 1, adjacent_nums), ans)
end
println("ans after: ", ans)
end
end
return ans
end
# println("Time to evaluate Problem 11:")
# @btime Problem11()
# println("")
# println("Result for Problem 11: ", Problem11())
Problem11()

10
src/Julia/create_template.py
View File

@@ -18,13 +18,13 @@ def create_problem():
@author: David Doblas Jiménez
@email: daviddoji@pm.me
Solution for Problem {args['problem']:0>3} of Project Euler
https://projecteuler.net/problem={args['problem']}
Solution for Problem {args["problem"]:0>3} of Project Euler
https://projecteuler.net/problem={args["problem"]}
=#
using BenchmarkTools
function Problem{args['problem']:0>3}()
function Problem{args["problem"]:0>3}()
#=
Statement
=#
@@ -35,9 +35,9 @@ def create_problem():
println("Took:")
@btime Problem{args['problem']:0>3}()
@btime Problem{args["problem"]:0>3}()
println("")
println("Result for Problem $(lpad({args['problem']}, 3, "0")): ", Problem{args['problem']:0>3}())
println("Result for Problem $(lpad({args["problem"]}, 3, "0")): ", Problem{args["problem"]:0>3}())
""" # noqa: E501
)