AnimateWallpaper Release

Animate Wallpaper is a software that will change system wallpaper of Windows dynamically. It’s the 2nd generation of StopChangeBG

When working with ffmpeg it’s a lightweight tool to display a low-quality video on system wallpaper.

Tested on Windows7(32bit) and Windows10(64bit)

Please use absolute path instead of relative path

You can stop the program by killing it in task manager or rebooting.

Source

Download

Download

【Zhuky Perspective】Nanjing Touhou Only 2020 游记

Disclaimer

今天主要拍摄的是视频,就不配图啦!

本文由Zhuky执笔

Intro

大家好,我是zky,今天和XGN去了THO游玩,一早上完倪哥数学直接打车过去了(本来以为可以写一会儿作业,事实证明我太天真了),一路上很顺利,甚至没有出现我担心的找不到地方之类问题,车直接开进去停在了稻香音乐空间门口,名字起得不错,让我感到浓浓的风神录1面的味道~

整个活动场地给我的第一印象其实是“这么小?!”,不过没有让我失望,虽然有些挤,但是我们车万人却秩序井然(打游戏能在那么密集的弹幕中穿行自如,看来在三次元也依然如此啦!),在并不宽敞的空间里没有任何冲突。

Read More

Nanjing Touhou Only 2020 游记

Disclaimer: 如果您出现在图片中但是认为自己的隐私受到侵犯,请通过博客提供的联系方式联系我

大家好,我是XGN。差不多两三个月前无意间在thwiki上看到了南京THO03的消息。一看时间刚好是周六,而且是在玄武湖。作为一个新东方众,当然要过去冲动消费捧捧场凑凑热闹了呐。

差不多一个月前,地址改到了奥体的DMO稻香音乐空间。

所以今天我就和Zhuky去了THO。 (无意义

其实稻香音乐空间比我想象的要小一点,相比地图上也更是感觉小了许多,相对的,自然人就看上去多了许多。没想到去的时候买票附赠的东西都发完了,还要邮寄,真是 :facepalm:

会场人比想象中的少一点(注:大糊)

官方摊位(IDK为什么这么糊)

Read More

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.

Read More

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.

Read More

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

Read More