🇺🇦 Python Programming Сhallenges
前往频道在 Telegram
Размышления на тему решения различных задач по спортивному программированию на Python и не только.
显示更多839
订阅者
无数据24 小时
无数据7 天
+1730 天
数据加载中...
吸引订阅者
九月 '24
九月 '24
+27
在0个频道中
八月 '24
+45
在0个频道中
Get PRO
七月 '24
+416
在0个频道中
Get PRO
六月 '240
在0个频道中
Get PRO
五月 '240
在0个频道中
Get PRO
四月 '240
在0个频道中
Get PRO
三月 '240
在0个频道中
Get PRO
二月 '240
在0个频道中
Get PRO
一月 '240
在0个频道中
Get PRO
十二月 '230
在0个频道中
Get PRO
十一月 '230
在0个频道中
Get PRO
十月 '230
在0个频道中
Get PRO
九月 '230
在0个频道中
Get PRO
八月 '230
在0个频道中
Get PRO
七月 '230
在0个频道中
Get PRO
六月 '230
在0个频道中
Get PRO
五月 '230
在0个频道中
Get PRO
四月 '230
在0个频道中
Get PRO
三月 '230
在0个频道中
Get PRO
二月 '230
在0个频道中
Get PRO
一月 '230
在0个频道中
Get PRO
十二月 '220
在0个频道中
Get PRO
十一月 '220
在0个频道中
Get PRO
十月 '220
在0个频道中
Get PRO
九月 '22
+3
在0个频道中
Get PRO
八月 '220
在0个频道中
Get PRO
七月 '220
在0个频道中
Get PRO
六月 '220
在0个频道中
Get PRO
五月 '22
+3
在0个频道中
Get PRO
四月 '22
+11
在0个频道中
Get PRO
三月 '220
在0个频道中
Get PRO
二月 '220
在0个频道中
Get PRO
一月 '220
在0个频道中
Get PRO
十二月 '210
在0个频道中
Get PRO
十一月 '210
在0个频道中
Get PRO
十月 '210
在0个频道中
Get PRO
九月 '210
在0个频道中
Get PRO
八月 '210
在0个频道中
Get PRO
七月 '210
在0个频道中
Get PRO
六月 '21
+1
在0个频道中
Get PRO
五月 '21
+4
在0个频道中
Get PRO
四月 '21
+6
在0个频道中
Get PRO
三月 '21
+414
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 25 九月 | 0 | |||
| 24 九月 | +1 | |||
| 23 九月 | +1 | |||
| 22 九月 | 0 | |||
| 21 九月 | +1 | |||
| 20 九月 | +23 | |||
| 19 九月 | 0 | |||
| 18 九月 | 0 | |||
| 17 九月 | 0 | |||
| 16 九月 | 0 | |||
| 15 九月 | 0 | |||
| 14 九月 | 0 | |||
| 13 九月 | 0 | |||
| 12 九月 | 0 | |||
| 11 九月 | 0 | |||
| 10 九月 | 0 | |||
| 09 九月 | 0 | |||
| 08 九月 | 0 | |||
| 07 九月 | 0 | |||
| 06 九月 | 0 | |||
| 05 九月 | 0 | |||
| 04 九月 | 0 | |||
| 03 九月 | +1 | |||
| 02 九月 | 0 | |||
| 01 九月 | 0 |
频道帖子
Today, around 15:25 GMT +2, I’ll present my talk at
@pyconit
about debugging Python applications inside the docker and k8s cluster. You can watch it online using the stream link https://2024.pycon.it/en/streaming or attend (Room Lasagna).
#pycon #pyconit #k8s
| 2 | https://twitter.com/1st1/status/1493748843430567942?s=21 | 606 |
| 3 |  Scalene: a high-performance CPU, GPU and memory profiler for Python
https://github.com/plasma-umass/scalene | 430 |
| 4 | Found very intersting approach to count the digits of an integers #python:
from math import floor, log10
def count_digits(n):
return 1 + floor(log10(n))
In [2]: count_digits(5)
Out[2]: 1
In [3]: count_digits(999)
Out[3]: 3
In [4]: count_digits(1000)
Out[4]: 4 | 586 |
| 5 | blue is a somewhat less uncompromising code formatter than black, the OG of Python formatters.
https://github.com/grantjenks/blue | 381 |
| 6 | Performance comparison: counting words in Python, Go, C++, C, AWK, Forth, and Rust
https://benhoyt.com/writings/count-words/ | 372 |
| 7 | It's just a trick
It's because unary minus is right-associative and binds tighter than binary minus which is left-associative
-12 // 5 => - 3
- (-12 // 5) => +3
The rest is just putting 0 at the start:
--0 == 0
and --0--12//5 is parsed as
-(-(0)) - (- (12 // 5))
from Twitter https://twitter.com/ericpromislow/status/1362475189125095425?s=21 | 514 |
| 8 | I can't recall where I saw this originally, but you can use the spaceship operator "--0--" to turn floor division into ceiling division:
>>> 12//5
2
>>> --0-- 12//5
3
There's also the ++0++ operator when you want to emphasize that you really *do* mean floor division:
>>> ++0++ 12//5
2
from https://bugs.python.org/issue43255#msg387248
But yes, -(-n // d) is the easy (if a little bit cryptic) way to get the ceiling of n / d. | 392 |
| 9 | Armin dislikes new PEP regarding structural pattern matching https://twitter.com/mitsuhiko/status/1359263135304187910
btw PEP has been approved!
https://www.python.org/dev/peps/pep-0636/ | 456 |
| 10 | Interesting thread how to solve interview problem https://twitter.com/al_grigor/status/1357028887209902088?s=21 | 473 |
| 11 | Releasing pip 20.3, featuring new dependency resolver
https://pyfound.blogspot.com/2020/11/pip-20-3-new-resolver.html | 751 |
| 12 | Airflow 2.0 ->
https://www.astronomer.io/blog/introducing-airflow-2-0/ | 863 |
| 13 | Hypermodern Python 👩🚀 🐍
Chapter 1: Setup
Chapter 2: Testing
Chapter 3: Linting
Chapter 4: Typing
Chapter 5: Documentation
Chapter 6: CI/CD
https://cjolowicz.github.io/posts/hypermodern-python-01-setup/ | 1 024 |
| 14 | Python 3.9 is around the corner
https://lwn.net/SubscriberLink/831783/8afbf1812decf4d9/ | 949 |
| 15 | Note #71 The seven rules of a great Git commit message
1. Separate subject from body with a blank line
2. Limit the subject line to 50 characters
3. Capitalize the subject line
4. Do not end the subject line with a period
5. Use the imperative mood in the subject line
6. Wrap the body at 72 characters
7. Use the body to explain what and why vs. how
https://chris.beams.io/posts/git-commit/ | 965 |
| 16 | Asynchronous IO Support for Core and ORM
SQLAlchemy 1.4 now supports Python asyncio-compatible database drivers using an all-new asyncio front-end interface to Connection for Core usage as well as Session for ORM use, using the AsyncConnection and AsyncSession objects.
https://docs.sqlalchemy.org/en/14/changelog/migration_14.html#asynchronous-io-support-for-core-and-orm | 906 |
| 17 | PEP 622 -- Structural Pattern Matching
Interesting proposal for python 3.10.
The proposed indentation structure is as following:
match some_expression:
case pattern_1:
...
case pattern_2:
...
and example from pep:
match number:
case 0:
print("Nothing")
case 1:
print("Just one")
case 2:
print("A couple")
case -1:
print("One less than nothing")
case 1-1j:
print("Good luck with that...")
https://www.python.org/dev/peps/pep-0622/ | 990 |
| 18 | Note #68: The Rules of Optimization Club
1. You do not optimize.
2. You do not optimize, without measuring first.
3. When the performance is not bound by the code, but by external factors, the optimization is over.
4. Only optimize code that already has full unit test coverage.
5. One factor at a time.
6. No unresolved bugs, no schedule pressure.
7. Testing will go on as long as it has to.
8. If this is your first night at Optimization Club, you have to write a test case.
from https://wiki.c2.com/?RulesOfOptimizationClub | 398 |
| 19 | https://youtu.be/8S8zwJBOD0w | 318 |
| 20 | Restructuring data, the Python way.
>>> import glom
>>> glom.assign({}, "a.b.c.d", 42, missing=dict)
{'a': {'b': {'c': {'d': 42}}}}
# Path-based access for nested structures
>>> target = {'a': {'b': {'c': 'd'}}}
>>> glom(target, 'a.b.c')
'd'
happy glomming! 😋
https://glom.readthedocs.io/en/latest/ | 791 |
