fork()==0世界线变动

A. Lame King

B. Vaccination

C. Pull Your Luck

D. Accommodation

A. Walking Master

B. Mex Master

C. Sequence Master

E. Tree Master

A. Garland

B. Points on Plane

C. Sum on Subarrays

D. Binary String Sorting

A. Coins

B. Long Legs

C. Search in Parallel

A. LuoTianyi and the Palindrome String

B. LuoTianyi and the Table

C. LuoTianyi and the Show

D2. LuoTianyi and the Floating Islands (Hard Version)

E. LuoTianyi and XOR-Tree

A. New Palindrome

B. Maximum Sum

C. Contrast Value

D1. Red-Blue Operations (Easy Version)

D2. Red-Blue Operations (Hard Version)

E. Combinatorics Problem

给出两个数n和m, (n,m<=1e18)

有一堆谷共有n颗，

第i天会发生的事：

1. 给这堆谷最多加m颗，最多加到n。

2. 有i只鸟会吃掉i颗，若不足i颗则吃光。

问第几天会吃光。