CF991F.Concise and clear
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Vasya is a regular participant at programming contests and is already experienced in finding important sentences in long statements. Of course, numbers constraints are important — factorization of a number less than 1000000 is easier than of a number less than 1000000000. However, sometimes it's hard to understand the number at the first glance. Could it be shortened? For example, instead of 1000000 you could write 106 , instead of 1000000000 — 109 , instead of 1000000007 — 109+7 .
Vasya decided that, to be concise, the notation should follow several rules:
- the notation should only consist of numbers, operations of addition ("+"), multiplication ("*") and exponentiation ("^"), in particular, the use of braces is forbidden;
- the use of several exponentiation operations in a row is forbidden, for example, writing "234" is unacceptable;
- the value of the resulting expression equals to the initial number;
- the notation should consist of the minimal amount of symbols.
Given n , find the equivalent concise notation for it.
输入格式
The only line contains a single integer n ( 1≤n≤10000000000 ).
输出格式
Output a concise notation of the number n . If there are several concise notations, output any of them.
输入输出样例
输入#1
2018
输出#1
2018
输入#2
1000000007
输出#2
10^9+7
输入#3
10000000000
输出#3
100^5
输入#4
2000000000
输出#4
2*10^9
说明/提示
The third sample allows the answer 10^10 also of the length 5 .