20240708

• Read the next section of “Just for Fun”
• Finished the chapter 2 of “Code That Fits In Your Head”
  • The chapter does not provide many insights.
  • I already configured GitHub Actions to run flake8 as linter and pytest as tests. I unfortulately don't have control of our infrastructure. So, there's nothing I can mimick right now.

1983A. Array Divisibility

It felt good to have this problem solved.

for _ in range(int(input())):
    n = int(input())
    print(" ".join([str(x) for x in range(1, n + 1)]))

My Thought Process

The easiest way to make the sum of numbers, whose indices are multiple of k, divisible by k, we can pick multiples of k for the numbers.

For example, when thinking about k = 3 and 10 input numbers, we need to pick {3a, 3b, 3c} where a, b, and c are integers for indices 3, 6, and 9, so that, the sum will be 3(a + b + c) which is divisible by 3.

I first thought of multiplying corresponding indices by 1, 2, 3, …, n, but after consideration, found out the array [1, 2, …, n] meets the condition!

Cheese 30g Protein shake 10g Eggs 10g

Total carbohydrate 50g

MUST:

• Read the next two sections of “Just for Fun”

TODO:

• Update my resume with the sign up feature
• Update my resume with the document structure and AWS S3

index 20240707 20240709