Oh right, LSS does not exist anymore. Then it means, this world will be forgotten and removed soon. Don’t feel bad, it’s only a branch after all! Read Further Reading: How to know my OC first, won’t you?

2020-12-19

Diary►Random

Random Diary No. 1

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.

2020-12-15

OBCYSIO

Orange Boy Can You Solve It Out? Ep.43

Math 思考题!!

Super Random

We have X=0

Let’s call an assignment to be X=randint(1,X+1) where randint will return an uniformly random integer between [l,r]

What’s the expected number of assignments to make X an given integer N?

2020-12-15

OBCYSIO

Orange Boy Can You Solve It Out? Ep.42

思考题 with anime again

Spicy Wolf

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:

Assume they are at city x and all adjacent cities are in adj
Horo will first choose an adjacent city i randomly with the probability
Then Nora will choose an adjacent city j randomly with the probability
Then among city i and j, they will go to the one with higher profit.

For example, if the adjacent cities have [{P,F,G}]=[{1,2,3},{2,3,4},{5,6,7}], then a possible process is:

Horo chose city 1
Nora chose city 3
Lawrence decided to go to city 3 because it had higher profit
Possibility of this scene:

What’s the maximum expected profit after day T when the initial X is optimal? Please print the profit and the initial X.

2020-12-13

OBCYSIO

Orange Boy Can You Solve It Out? Ep.41

Long time no see 思考题!

Allow me to cut through those words!

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 , with its left-up corner at and right-down corner at . The left-up corner will move to and its right-down corner will move to linearly and smoothly in seconds. It will also have a health of

2020-12-09

Dev

StopChangeBG Release

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.

~~Download~~

Download