摘要：
Problem Description Long long ago, there was a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There are n bi 阅读全文
摘要：
There are NN light bulbs indexed from 00 to N-1N−1. Initially, all of them are off. A FLIP operation switches the state of a contiguous subset of bulb 阅读全文
摘要：
题目描述 多次询问，每次询问给一个值域范围 [l,r][l,r]，要回答下列四个问题： 从这个范围内选出两个整数(两个数可相同)， (1) 这两个数的最小公倍数最大是多少？ (2) 这两个数的最小公倍数最小是多少？ (3) 这两个数的最大公约数最大是多少？ (4) 这两个数的最大公约数最小是多少？ 阅读全文
摘要：
A digit sum S_b(n)Sb(n) is a sum of the base-bb digits of nn. Such as S_{10}(233) = 2 + 3 + 3 = 8S10(233)=2+3+3=8, S_{2}(8)=1 + 0 + 0 = 1S2(8)=1+0+ 阅读全文