摘要:
"C. Sad powers" 题意: For each query you have to find the number of such x that L ≤ x ≤ R and there exist integer numbers a 0, p 1 such that x = a^p. q个 阅读全文
posted @ 2018-03-27 22:56
v9fly
阅读(265)
评论(0)
推荐(0)
摘要:
"D. Riverside Curio" 题意: 有 n 天,每天会在水位线上画一条线,告诉你每天在水位线上方已经有 a[i] 条线。问你 n 天在水位线下方的线总和最少是几条? tags: 考虑 f[i] 为第 i 天的线条数量,相邻的两天 f[] 最多相差 1 。 则 f[i] = a[i]+1 阅读全文
posted @ 2018-03-27 22:56
v9fly
阅读(159)
评论(0)
推荐(0)

浙公网安备 33010602011771号