Stay Hungry,Stay Foolish!

2023年1月10日
1032. Find a Multiple
摘要： 1032. Find a Multiple https://acm.timus.ru/problem.aspx?space=1&num=1032 思路 对于n个数 a[1] ... a[n] 首先计算累加和 s[1] ... s[n] s[i] = a[1] + a[2] + ... + a[i] 阅读全文
posted @ 2023-01-10 22:35 lightsong 阅读(19) 评论(0) 推荐(0) 编辑
Life Is Short, We Need Ship To Travel