A9837 | Drazil and Factorial
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Drazil is playing a math game with Varda.
Let's define  for positive integer $x$ as a product of factorials of its digits. For example, .
First, they choose a decimal number $a$ consisting of $n$ digits that contains at least one digit larger than $1$ . This number may possibly start with leading zeroes. Then they should find maximum positive number $x$ satisfying following two conditions:
1\. $x$ doesn't contain neither digit $0$ nor digit $1$ .
2\.  = .
Help friends find such number.
Let's define  for positive integer $x$ as a product of factorials of its digits. For example, .
First, they choose a decimal number $a$ consisting of $n$ digits that contains at least one digit larger than $1$ . This number may possibly start with leading zeroes. Then they should find maximum positive number $x$ satisfying following two conditions:
1\. $x$ doesn't contain neither digit $0$ nor digit $1$ .
2\.  = .
Help friends find such number.
输入格式
The first line contains an integer $n$ ( $1<=n<=15$ ) — the number of digits in $a$ .
The second line contains $n$ digits of $a$ . There is at least one digit in $a$ that is larger than $1$ . Number $a$ may possibly contain leading zeroes.
The second line contains $n$ digits of $a$ . There is at least one digit in $a$ that is larger than $1$ . Number $a$ may possibly contain leading zeroes.
输出格式
Output a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.
输入输出样例
输入 #1
4 1234
输出 #1
33222
输入 #2
3 555
输出 #2
555
In the first case, 
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted