By default the python has a default maximum recursion limitation, which is 1000. We can adjust it a little bit by using the following code: import sys sys.setrecursionlimit(10000) Recently, I encountered a problem in a problem from code forces, which by using Python’s recursion way, a recursion error will be…

AtCoder ABC 329 E — Stamp Last Saturday, there is a very nice problem from the AtCoder beginner contest. The problem can be solved by using BFS if we think the problem reversely. This is not a very standard BFS and it is quit interesting. Question See here. Basic idea We think the…

Abstract GPT-4 with vision (GPT-4V) enables users to instruct GPT-4 to analyze image inputs provided by the user, and is the latest capability we are making broadly available. Incorporating additional modalities (such as image inputs) into large language models (LLMs) is viewed by some as a key frontier in artificial intelligence…

On git bash of windows, if you wanna update the home folder, do the following # check the old home folder echo $HOME # update the home folder to a new location export HOME={new_home_folder_path}

AtCoder: D — Polyomino — This is the question D of basic contest from AtCoder (ABC322). Question D — Polyomino Solution It can use backtracking to solve this problem. However, as we have to do some preparation job, the code is a bit long. #include<iostream>…

A super nice problem needs several technologies to solve — This was the 3rd problem of the weekly LC contest 357 (August 5, 2023). This is a super nice problem. I like it as it covers several impotant topics: BFS DFS Backtracking Binary Search It is the first time, I found one problem can cover so many topics. If I…

The color is nice, however, it will be even better if we do not have the border color. Such as following:

2762. Continuous Subarrays 2762. Continuous Subarrays It was the 3rd question of the weekly 352 code competition of LC . The key trick is finding the min/max value in a sliding window. I had a previous post Sliding window min/max, priority queue & Monotonic Queue. Multiset This has the time complexity…

2719. Count of Integers This is the 4th hard question of the LC 348 weekly contest question. 2719. Count of Integers Explanation If we can change the problem to the following, it will be easier: _count(num, min_sum, max_sum) = number of numbers in [0, num] whose digit sum is in [min_sum…