# Oracle

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1049    Accepted Submission(s): 460

Problem Description
There is once a king and queen, rulers of an unnamed city, who have three daughters of conspicuous beauty.

The youngest and most beautiful is Psyche, whose admirers, neglecting the proper worship of the love goddess Venus, instead pray and make offerings to her. Her father, the king, is desperate to know about her destiny, so he comes to the Delphi Temple to ask for an oracle.

The oracle is an integer n without leading zeroes.

To get the meaning, he needs to rearrange the digits and split the number into <b>two positive integers without leading zeroes</b>, and their sum should be as large as possible.

Help him to work out the maximum sum. It might be impossible to do that. If so, print Uncertain.

Input
The first line of the input contains an integer T (1T10), which denotes the number of test cases.

For each test case, the single line contains an integer n (1n<1010000000).

Output
For each test case, print a positive integer or a string Uncertain.

Sample Input
3 112 233 1

Sample Output
22 35 Uncertain
Hint
In the first example, it is optimal to split $112$ into $21$ and $1$, and their sum is $21 + 1 = 22$. In the second example, it is optimal to split $233$ into $2$ and $33$, and their sum is $2 + 33 = 35$. In the third example, it is impossible to split single digit $1$ into two parts.
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
typedef long long LL;
const int INF=0x7ffffff;
const int M=1e8+1;
char s1[M],s2[M];
int flag[11];
int i,j,k,n,m;
int mark;

int main()
{
int T;
scanf("%d",&T);
while(T--)
{
getchar();
scanf("%s",s1);
MS(flag,0);
int len=strlen(s1);
rep(i,0,len)flag[s1[i]-'0']++;
int sum=0,k;
rep(i,1,10)sum+=flag[i];
if(sum<2){
puts("Uncertain");continue;
}
rep(i,1,10)
if(flag[i]){
k=i;flag[i]--;break;
}
int t=0;
rep(i,0,10){
while(flag[i]){
if(i+k>=10){
s2[t++]=char((i+k)%10+'0');
k=1;
}
else s2[t++]=char(i+k+'0'),k=0;
flag[i]--;
}
}
if(k==1){
printf("1");
for(i=len-1;i>=0;i--)printf("%c",s2[i]);
}
else for(i=len-2;i>=0;i--)printf("%c",s2[i]);
printf("\n");
}
return 0;
}

• 本文已收录于以下专栏：

## hdu002大数相加

• s_naughty
• 2016年07月19日 11:35
• 84

## HDU 1047。多个大数相加

WA了一次，水过了，又是一道很早就想做的题。
• sky_miange
• 2015年01月01日 17:39
• 972

## HDU 5718 Oracle

Problem Description There is once a king and queen, rulers of an unnamed city, who have three dau...
• jtjy568805874
• 2016年07月18日 19:16
• 260

## HDU - 5718 - Oracle

Oracle Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total...
• w326159487
• 2017年11月09日 20:51
• 26

## Hdu 5718 Oracle【贪心】

Oracle Accepts: 599 Submissions: 2576 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 2621...
• mengxiang000000
• 2016年07月18日 11:30
• 466

## HDU 5718 Oracle（大数）

Oracle Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total...
• Mr_Treeeee
• 2017年11月09日 21:03
• 55

## hdu 5718 Oracle（模拟）

Oracle Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total...
• acm_cxq
• 2016年07月17日 22:48
• 285

## hdu 5718 Oracle

Oracle Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total...
• imzxww
• 2017年11月10日 15:57
• 26

## hdu 5718 oracle

http://acm.hdu.edu.cn/showproblem.php?pid=5718 #include using namespace std; cha...
• threeh20
• 2017年11月11日 21:16
• 73

## 杭州电子科技大学（HDU)ACM刷题----------大数相加之1002详解

• zys_1997
• 2016年04月11日 18:42
• 1069

举报原因： 您举报文章：HDU 5718 Oracle【大数相加】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)