Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Divisors
Description Your task in this problem is to determine the number of divisors of C. Just for fun -- or do you need any special reason for such a useful computation? _{n}^{k}Input The input consists of several instances. Each instance consists of a single line containing two integers n and k (0 ≤ k ≤ n ≤ 431), separated by a single space. Output For each instance, output a line containing exactly one integer -- the number of distinct divisors of C. For the input instances, this number does not exceed 2_{n}^{k}^{63} - 1. Sample Input 5 1 6 3 10 4 Sample Output 2 6 16 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator