Kaprekars Constant算法挑战涉及将4位数字按降序和升序排列，然后相减。如果差值不是6174，则重复此过程，直到得到6174或发现循环次数。
Challenge
Using the C# language, have the function
KaprekarsConstant(num) take the
num parameter being passed which will be a 4-digit number with at least two distinct digits. Your program should perform the following routine on the number: Arrange the digits in descending order and in ascending order (adding zeroes to fit it to a 4-digit number)
最低0.47元/天 解锁文章
1587
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
