PAT 1069. The Black Hole of Numbers (20)
来源:互联网 发布:浙江国税网络发票查询 编辑:程序博客网 时间:2024/06/05 15:30
1069. The Black Hole of Numbers (20)
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 = 6174
7641 - 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:6767Sample Output 1:
7766 - 6677 = 10899810 - 0189 = 96219621 - 1269 = 83528532 - 2358 = 6174Sample Input 2:
2222Sample Output 2:
2222 - 2222 = 0000
这道题我还是把它当成字符串处理问题做的。 代码如下:
#include <iostream>#include <algorithm>#include <cmath>#include <string>#include <iomanip>#include <cstring>using namespace std;int main(void){string raw;cin>>raw;int i;int temp=4-raw.size();if(temp>0){string t="";for(i=0;i<temp;i++)t+='0';t+=raw;raw=t;}for(i=0;i<raw.size();i++)if(raw[i]!=raw[0])break;if(i>=raw.size()){cout<<raw<<" - "<<raw<<" = "<<"0000";return 0;}sort(raw.begin(),raw.end());string rev=raw;reverse(rev.begin(),rev.end());int result=atoi(rev.c_str())-atoi(raw.c_str());while(result!=6174){cout<<rev<<" - "<<raw<<" = ";char buf[5];sprintf(buf,"%d",result);rev=buf;int j=4-rev.size();raw="";for(i=0;i<j;i++)raw+='0';raw+=rev;cout<<raw<<endl;sort(raw.begin(),raw.end());rev=raw;reverse(rev.begin(),rev.end());result=atoi(rev.c_str())-atoi(raw.c_str());}cout<<rev<<" - "<<raw<<" = "<<result;}
- PAT 1069. The Black Hole of Numbers
- PAT 1069. The Black Hole of Numbers
- pat 1069. The Black Hole of Numbers
- PAT--1069. The Black Hole of Numbers
- PAT-The Black Hole of Numbers (20)
- 【PAT】1069. The Black Hole of Numbers (20)
- PAT (Advanced) 1069. The Black Hole of Numbers (20)
- PAT A 1069. The Black Hole of Numbers (20)
- PAT 1069. The Black Hole of Numbers (20)
- pat 1069. The Black Hole of Numbers (20)
- PAT 1069. The Black Hole of Numbers (20)
- PAT 1069. The Black Hole of Numbers (20)
- PAT(甲级)1069. The Black Hole of Numbers (20)
- PAT甲级练习1069. The Black Hole of Numbers (20)
- PAT-A 1069. The Black Hole of Numbers (20)
- PAT-A-1069. The Black Hole of Numbers (20)
- 【PAT甲级】1069. The Black Hole of Numbers (20)
- Pat(A) 1069. The Black Hole of Numbers (20)
- 给服务器发送JSON数据
- 亲爱的程序猿们怎么找工作
- 介绍Nginx
- 程序员必须知道的10大基础实用算法及其讲解
- 每日5题(线程)
- PAT 1069. The Black Hole of Numbers (20)
- Linux shell获取时间和时间间隔(ms级别)
- pdf文档如何修改乱序页面
- php错误:You don't have permission to access / on this server.
- Linux文件夹文件创建、删除
- [LeetCode 171]Excel Sheet Column Number
- ubuntu12上docker部署hadoop集群环境
- 求最小环入门详解
- 分布式日志收集系统Apache Flume的设计介绍