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

摘要：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 阅读全文

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

摘要：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 阅读全文

摘要：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 阅读全文

摘要：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 阅读全文

摘要：1102 - Problem Makes Problem As I am fond of making easier problems, I discovered a problem. Actually, the problem is 'how can you make n by adding k  阅读全文

摘要：1214 - Large Division Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an i 阅读全文

摘要：1095 - Arrange the Numbers Consider this sequence {1, 2, 3 ... N}, as an initial sequence of first N natural numbers. You can rearrange this sequence 阅读全文

摘要：1058 - Parallelogram Counting There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose ve 阅读全文

摘要：题目链接：http://www.lightoj.com/volume_showproblem.php?problem=1067 1067 - Combinations Given n different objects, you want to take k of them. How many wa 阅读全文