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:
x doesn’t contain neither digit 0 nor digit 1.
= .
Help friends find such number.
Input 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.
Output Output a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.
Examples Input 4 1234 Output 33222 Input 3 555 Output 555 Note 解题思路 要求输出的数最大，我一开始考虑的太少了，只想到了2和3.。。。然后就WA了 应该分解几个特殊的阶乘 详细见代码
#include<iostream> #include<algorithm> #include<cstring> #include<cmath> using namespace std; int main() { int n,i,j; int b[10]; memset(b,0,sizeof(b)); int sum=1; char a[20]; cin>>n; cin>>a; for(i=0;i<n;i++) { if(a[i]=='4') { b[2]+=2; b[3]++; } else if(a[i]=='6') { b[3]++; b[5]++; } else if(a[i]=='8') { b[2]+=3; b[7]++; } else if(a[i]=='9') { b[2]++; b[3]+=2; b[7]++; } else b[a[i]-'0']++; } for(i=7;i>=2;i--) { for(j=0;j<b[i];j++) cout<<i; } cout<<endl; return 0; }