Random diary as it is.
Today I turned 16 and I finished Spice and Wolf 2 anime as well.
I really appreciated Zhuky.RLG’s hoodie and the cake my parents bought.
Yes, I really like Spice and Wolf and I may be digging gold recently from the franchise as well.
思考题 with anime again
XGN have watched the famous anime Spice and Wolf and now as usual, he will propose a problem.
In the country, there are N cities and M bidirectional roads. Each road connects two city and has a dangerous point Di. Each city has three properties: Pi - the profit, Fi - the deliciousness of the food there and Gi - the number of attractions in the city.
Now Lawrence, Horo and Nora are at city 1. Before the trip, Lawrence will give Nora X coins, which will be determined by you. This will make all roads with dangerous points less than or equal to X be available for passing.
Their journey will last for T days. In each day, they will first move to an adjacent city. There Lawrence will do some business and get Pi coins. The way they determine which city to go will follow these rules:
adjFor example, if the adjacent cities have [{P,F,G}]=[{1,2,3},{2,3,4},{5,6,7}], then a possible process is:
What’s the maximum expected profit after day T when the initial X is optimal? Please print the profit and the initial X.
Long time no see 思考题!
Have you ever played Danganronpa? It’s a game which allows you to cut through others words by exposing lies. Our adorable swordsman Ookami decides to try it too!
There are N words Ookami needs to cut. They will appear in a plane as rectangles. The i-th one will appear at second
Stop Change BG is a software that will forbid changing system wallpaper of Windows.
It works by simply setting the background every 1 second and runs in the background.
Tested on Windows7(32bit) and Windows10(64bit)
You can stop the program by killing it in task manager or rebooting.
Recently I did a research on the R18 and R18G rate of Touhou characters on Pixiv.
Link to the result: Google
