169人阅读 评论(0)

# Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

# Description

Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some order to form a second integer. Unless the resulting integer is 0, the integer may not start with the digit 0.

For example, if you are given the digits 0, 1, 2, 4, 6 and 7, you can write the pair of integers 10 and 2467. Of course, there are many ways to form such pairs of integers: 210 and 764, 204 and 176, etc. The absolute value of the difference between the integers in the last pair is 28, and it turns out that no other pair formed by the rules above can achieve a smaller difference.

# Input

The first line of input contains the number of cases to follow. For each case, there is one line of input containing at least two but no more than 10 decimal digits. (The decimal digits are 0, 1, ..., 9.) No digit appears more than once in one line of the input. The digits will appear in increasing order, separated by exactly one blank space.

# Output

For each test case, write on a single line the smallest absolute difference of two integers that can be written from the given digits as described by the rules above.

# Sample Input

1
0 1 2 4 6 7



# Sample Output

28



#include <iostream>
#include <algorithm>
#include <cmath>

int main()
{
int test;
std::cin >> test;
std::string line;
getline(std::cin, line);
while (test--) {
getline(std::cin, line);
if (line == "0") {
std::cout << "0" << std::endl;
continue;
}
if (line.length() == 3) {
std::cout << line[2] - line[0] << std::endl;
continue;
}
std::string str = "";
for (int i = 0; i < line.length(); i += 2)
str = str + line[i];
//std::cout << str << std::endl;
int min = 44444;
int astart = 0;
int bstart = str.length()/2;
do {
if (str[astart] == '0' || str[bstart] == '0')
continue;
int a = 0, weight = 1;
for (int i = bstart-1; i >= 0; --i) {
a += (str[i] - '0') * weight;
weight *= 10;
}
int b = 0;
weight = 1;
for (int i = str.length()-1; i >= bstart; --i) {
b += (str[i] - '0') * weight;
weight *= 10;
}
min = min < fabs(a-b) ? min : fabs(a-b);
//std::cout << a << "  " << b << "   " << min << std::endl;
}  while (std::next_permutation(str.begin(), str.end()));
std::cout << min << std::endl;
}
}

0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：23426次
• 积分：1241
• 等级：
• 排名：千里之外
• 原创：104篇
• 转载：0篇
• 译文：1篇
• 评论：3条
文章分类
阅读排行
评论排行
最新评论