数论
文章平均质量分 59
弱酸型冷淡猪
这个作者很懒,什么都没留下…
展开
-
GDUT-寒假专题训练4--Combinations
题目:Computing the exact number of ways that N things can be taken M at a time can be a great challenge when N and/or M become very large. Challenges are the stuff of contests. Therefore, you are to make just such a computation given the following:GIVEN:原创 2022-02-23 14:34:44 · 319 阅读 · 0 评论 -
GDUT-寒假专题训练4--k-rounding
For a given positive integerndenote itsk-rounding as the minimum positive integerx, such thatxends withkor more zeros in base10and is divisible byn.For example,4-rounding of375is375·80 = 30000.30000is the minimum integer such that it end...原创 2022-02-23 13:44:13 · 188 阅读 · 0 评论