summaryrefslogtreecommitdiff
path: root/blog/2021-08-18.md
diff options
context:
space:
mode:
authoreug-vs <eugene@eug-vs.xyz>2021-08-18 21:51:24 +0300
committereug-vs <eugene@eug-vs.xyz>2021-08-18 21:51:24 +0300
commit933862e9d8cc8998b25a20d4789b845a17b6f9ee (patch)
tree5c1b3c1aaa261e83f1d72d1c266fca12450b9d95 /blog/2021-08-18.md
parent37f4e018c239867d70fcdc689200bff2cbb96eed (diff)
downloadeug-vs-xyz-933862e9d8cc8998b25a20d4789b845a17b6f9ee.tar.gz
fix: reformat text and correct typos
Diffstat (limited to 'blog/2021-08-18.md')
-rw-r--r--blog/2021-08-18.md4
1 files changed, 1 insertions, 3 deletions
diff --git a/blog/2021-08-18.md b/blog/2021-08-18.md
index 6567f35..6655824 100644
--- a/blog/2021-08-18.md
+++ b/blog/2021-08-18.md
@@ -14,9 +14,7 @@ totals = [271.01, 1078.61, 3333.44]
```
## Thinking
-Now, let's analyze the problem a bit. We'll try solving the problem for the total of `3333.44` in this example.
-
-There's **12** prices in the list. Now, let's suppose our total was made up from 2 prices. It could be any 2 numbers from the list, in fact there are a lot of possible pairs! To be precise, there are **66** of them! Luckily Python has an amazing package `itertools` which allows you to work with combinatorics. We can now list all these pairs:
+Now, let's analyze the problem a bit. There are **12** prices in the list. Let's suppose our total was made up from 2 prices. It could be any 2 numbers from the list, in fact there are a lot of possible pairs. To be precise, there are **66** of them! Luckily Python has an amazing package `itertools` which allows you to work with combinatorics. We can now list all these pairs:
```python
from itertools import combinations