K.I.S.S.

Late night psychology research

Daily life of a Touhou CD collector

Poetic inspiration in the late night

A small illness, peeling an orange, feeling life isn’t so bad

A return after a year

AI Translated from Chinese Background Redmi Note 12 Turbo, MIUI 14, unlocked bootloader. Process 1. Backup First, backup important data. This step is crucial as flashing will wipe all data. 2. Download Required Files Platform Tools (adb and fastboot) Custom recovery (e.g., TWRP) Custom ROM (e.g., HyperOS, Pixel Experience) 3. Unlock Bootloader Use MIUI Unlock tool to unlock bootloader. Note this requires binding device account for certain days. 4. Flash Recovery # Boot to fastboot mode adb reboot bootloader # Flash recovery fastboot flash recovery recovery.img 5. Install ROM Boot to recovery mode Wipe data/factory reset Install ROM zip file Reboot Post-flash Setup Restore apps and data Configure system settings Install Google services if needed Notes Unlocking bootloader will void warranty Be careful with ROM sources, use trusted ones Keep recovery image backup

AI Translated from Chinese Problem Problem Statement Given a tree, for each node, consider the maximum value d such that after removing d edges, the node can still reach at least one other node. Compute the sum of these d values across all nodes. Input The first line contains an integer n (1 ≤ n ≤ 2×10^5), the number of nodes in the tree. The next n-1 lines contain edges of the tree. ...

When life gives you joy, indulge in it; don’t let the wine cup face the moon empty

AI Translated from Chinese Problem D. Flipper Problem: Given an n-permutation p[], select an interval [l, r] (l <= r), construct a new permutation: a[r+1:] + a[l:r].reverse() + a[1:l] (using Python slice notation, i.e., left-closed right-open interval). Find the lexicographically largest permutation that can be constructed. Analysis Assume the answer is represented by $ ans_i $. Initial analysis: when $ r = n $, $ ans_1 = r_n $, otherwise $ ans_1 = r_{n+1} $. To ensure lexicographic maximum, we need to select the largest possible $ r $. ...

More than just Hello world