摘要:
"套题传送门" A. Orac and Factors B. Orac and Models C. Orac and LCM AC代码 A. Orac and Factors 【数学】$f(n)$返回$n$的最小非1因数,求经过$k$次$f(n) +n$后的结果。 当$n$为偶数时,其最小非1因数为
阅读全文
posted @ 2020-05-15 12:07
Ayasan
阅读(403)
推荐(0)
编辑
摘要:
"套题传送门" A. Sum of Round Numbers B. Same Parity Summands C. K th Not Divisible by n D. Alice, Bob and Candies E. Special Elements F. Binary String Reco
阅读全文
posted @ 2020-05-15 11:46
Ayasan
阅读(97)
推荐(0)
编辑
摘要:
"比赛传送门" A. Most Unstable Array B. Two Arrays And Swaps C. Board Moves D. Note that the answer exists and unique. AC代码 A. Most Unstable Array 找规律发现: $n
阅读全文
posted @ 2020-05-15 10:51
Ayasan
阅读(164)
推荐(0)
编辑