1069. The Black Hole of Numbers (20)
2015-12-06 11:26
309 查看
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from the first one. Repeat in this manner we will soon end up at the number 6174 -- the "black hole" of 4-digit numbers. This number is named Kaprekar Constant.
For example, start from 6767, we'll get:
7766 - 6677 = 1089 9810 - 0189 = 9621 9621 - 1269 = 8352 8532 - 2358 = 61747641 - 1467 = 6174
... ...
Given any 4-digit number, you are supposed to illustrate the way it gets into the black hole.
Input Specification:
Each input file contains one test case which gives a positive integer N in the range (0, 10000).
Output Specification:
If all the 4 digits of N are the same, print in one line the equation "N - N = 0000". Else print each step of calculation in a line until 6174 comes out as the difference. All the numbers must be printed as 4-digit numbers.
Sample Input 1:[/b]
来源: <http://www.patest.cn/contests/pat-a-practise/1069>
[/code]
来自为知笔记(Wiz)
For example, start from 6767, we'll get:
7766 - 6677 = 1089 9810 - 0189 = 9621 9621 - 1269 = 8352 8532 - 2358 = 61747641 - 1467 = 6174
... ...
Given any 4-digit number, you are supposed to illustrate the way it gets into the black hole.
Input Specification:
Each input file contains one test case which gives a positive integer N in the range (0, 10000).
Output Specification:
If all the 4 digits of N are the same, print in one line the equation "N - N = 0000". Else print each step of calculation in a line until 6174 comes out as the difference. All the numbers must be printed as 4-digit numbers.
Sample Input 1:[/b]
6767Sample Output 1:[/b]
7766 - 6677 = 1089 9810 - 0189 = 9621 9621 - 1269 = 8352 8532 - 2358 = 6174Sample Input 2:[/b]
2222Sample Output 2:[/b]
2222 - 2222 = 0000
来源: <http://www.patest.cn/contests/pat-a-practise/1069>
#include<stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#pragma warning(disable:4996)
using namespace std;
vector<int> num;
bool cmp(int a, int b) {
return a < b;
}
int main(void) {
int n,result=-1;
int temp;
int high, low;
cin >> n;
temp = n;
while (1) {
num.clear();
while (temp>0) {
num.push_back(temp % 10);
temp = temp / 10;
}
if (num.size() < 4)
for (int i = num.size(); i < 4; i++)
num.push_back(0);
sort(num.begin(), num.end(), cmp);
low = num[0] * 1000 + num[1] * 100 + num[2] * 10 + num[3];
high = num[3] * 1000 + num[2] * 100 + num[1] * 10 + num[0];
result = high - low;
printf("%04d - %04d = %04d\n", high, low, result);
if (result == 6174 || result == 0)
break;
temp = result;
}
return 0;
}
[/code]
来自为知笔记(Wiz)
相关文章推荐
- 【转】设计模式六大原则(3):依赖倒置原则
- python核心编程-partial函数
- 基础练习 闰年判断
- 计算机网络_3_应用层
- 1068. Find More Coins (30)
- 1067. Sort with Swap(0,*) (25)
- 广工15新生赛 大数模拟运算
- C#通过正则表达式实现提取网页中的图片
- Java可变参数应用实操
- Scala 内部类及外部类
- 1066. Root of AVL Tree (25)
- Codeforces 603B - Moodular Arithmetic 数论 应用群的基本性质
- javaScript闭包
- C++显示类型转换
- 2015年大二上-数据结构-串(4)- 字符串加密
- 学习Android开发的二十套免费理想资源
- Xcode真机调试(有证书)
- strcat_s使用问题
- 1065. A+B and C (64bit) (20)
- 【转】设计模式六大原则(2):里氏替换原则