20240723

• I've been writing Rust problems, and it's driving me insane.
  • Released v0.0.1 of the command to count cyclomatic complexity huyfififi/cyclon
  • Configured a GitHub Actions workflow with the project. ex. GitHub Actions
  • I created the base structure of the project. I'll create pull requests from now on. Not sure my friend is willing to review them tho.
• Participated Codeforces Round 961 (Div. 2)
  • Let's play Gym instead of maximizing the number of participated contests.

1988A. Split the Multiset

The maximum number of ones I can increase in one operation => k - 1

How can I do that? => remove n and add (k - 1 ones and n - (k - 1))

For example, (n, k) = (16, 4)

{16}: initial state
{1, 1, 1, 13}
{1, 1, 1, 1, 1, 1, 10}
{1, 1, 1, 1, 1, 1, 1, 1, 1, 7}
{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4}
{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}

My takeaway is that I should think about the optimal number and consider how to do it after the observation.

for _ in range(int(input())):
    n, k = map(int, input().split())
    count: int = 0
    while n > 1:
        n -= k - 1
        count += 1
    print(count)

Ketone 5 mg/dl

Protein shake 15g Sushi salad 15g Cheese 10g

Total carbohydrate 40g

MUST:

• Review 1995A
• Review 1995B
• Go to Hayword Library

TODO:

• Update my resume with the sign up feature
• Update my resume with the document structure and AWS S3
• Update my LinkedIn summary section
• Consider the microservice independency with Redis/RabbitMQ

index 20240722 20240724