摘要：
Time Limit: 2 second(s) Memory Limit: 32 MB All of you know about "Alauddin vai". But what you don't know is, he sometimes walks while sleeping. Yes, 阅读全文
摘要：
You are given two positive integer numbers a and b. Permute (change order) of the digits of a to construct maximal number not exceeding b. No number i 阅读全文
摘要：
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 120. But in different bases 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文
摘要：
Find the number of trailing zeroes for the following function: nCr * pq where n, r, p, q are given. For example, if n = 10, r = 4, p = 1, q = 1, then 阅读全文
摘要：
In a strange planet there are n races. They are completely different as well as their food habits. Each race has a food-eating period. That means the 阅读全文
摘要：
Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable. In this problem, you will be given tw 阅读全文
摘要：
给出圆的圆心和半径，以及三角形的三个顶点，问圆同三角形是否相交。相交输出"Yes"，否则输出"No"。（三角形的面积大于0）。 Input Output Input示例 Output示例 1 #include<stdio.h> 2 #include<string.h> 3 #include<math 阅读全文
摘要：
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of 阅读全文