缄默。 - 博客园

1213 - Fantasy of a Summation

摘要： 1213 - Fantasy of a Summation If you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen 阅读全文

posted @ 2017-10-12 10:48 缄默。阅读(142) 评论(0) 推荐(0) 编辑

1163 - Bank Robbery

摘要： 1163 - Bank Robbery In one very cold morning, Mark decides to rob a bank. But while trying hacking into the security system, he found that it is locke 阅读全文

posted @ 2017-10-10 16:03 缄默。阅读(171) 评论(0) 推荐(0) 编辑

1138 - Trailing Zeroes (III) 二分

摘要： 1138 - Trailing Zeroes (III) You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As y 阅读全文

posted @ 2017-10-10 15:25 缄默。阅读(120) 评论(0) 推荐(0) 编辑

light oj 1045 - Digits of Factorial K进制下N！的位数

摘要： 1045 - Digits of Factorial Factorial of an integer is defined by the following function f(0) = 1 f(n) = f(n - 1) * n, if(n > 0) So, factorial of 5 is 阅读全文

posted @ 2017-08-01 09:34 缄默。阅读(151) 评论(0) 推荐(0) 编辑

light oj 1035 - Intelligent Factorial Factorization 素因子分解

摘要： 1035 - Intelligent Factorial Factorization Given an integer N, you have to prime factorize N! (factorial N). Input Input starts with an integer T (≤ 1 阅读全文

posted @ 2017-07-31 10:29 缄默。阅读(148) 评论(0) 推荐(0) 编辑

light oj1028 - Trailing Zeroes (I)

摘要： 1028 - Trailing Zeroes (I) We know what a base of a number is and what the properties are. For example, we use decimal number system, where the base i 阅读全文

posted @ 2017-07-29 10:25 缄默。阅读(212) 评论(0) 推荐(0) 编辑

多校二 1003Maximum Sequence 模拟

摘要： Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1887 Accepted Submission(s): 671 阅读全文

posted @ 2017-07-28 16:23 缄默。阅读(120) 评论(0) 推荐(0) 编辑

light oj 1014 - Ifter Party分解因子

摘要： 1014 - Ifter Party I have an Ifter party at the 5th day of Ramadan for the contestants. For this reason I have invited C contestants and arranged P pi 阅读全文

posted @ 2017-07-24 15:45 缄默。阅读(188) 评论(0) 推荐(0) 编辑

light oj1170 - Counting Perfect BST卡特兰数

摘要： 1170 - Counting Perfect BST BST is the acronym for Binary Search Tree. A BST is a tree data structure with the following properties. i) Each BST conta 阅读全文

posted @ 2017-07-20 16:42 缄默。阅读(131) 评论(0) 推荐(0) 编辑

lightoj 1140 - How Many Zeroes?数位dp

摘要： 1140 - How Many Zeroes? Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes w 阅读全文

posted @ 2017-07-19 15:47 缄默。阅读(151) 评论(0) 推荐(0) 编辑