2018年1月5日
light oj 1035 - Intelligent Factorial Factorization(阶乘的素因子分解)
摘要： Given an integer N, you have to prime factorize N! (factorial N). Input Input starts with an integer T (≤ 125), denoting the number of test cases. Eac 阅读全文
posted @ 2018-01-05 20:20 风子磊 阅读(154) 评论(0) 推荐(0) 编辑
light oj 1138 - Trailing Zeroes (III)(阶乘末尾0)
摘要： You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For e 阅读全文
posted @ 2018-01-05 19:34 风子磊 阅读(89) 评论(0) 推荐(0) 编辑