Drazil and Factorial - CodeForces 513 C 水题

Drazil and Factorial

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

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.

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.

Sample test(s)

input

4
1234

output

33222

input

3
555

output

555

Note

In the first case,


思路：找一个最大的数，使得每个位的阶乘的乘积与给定数相同。

思路：2、3、5、7没变化，4变成322,6变成53,8变成7222,9变成7332。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int T,t,n,m,a[100],b[100];
char s[100];
int main()
{
    int i,j,k;
    scanf("%d",&n);
    scanf("%s",s+1);
    for(i=1;i<=n;i++)
    {
        k=s[i]-'0';
        if(k==2 || k==3 || k==5 ||k==7)
          b[k]++;
        else if(k==4)
          b[3]++,b[2]+=2;
        else if(k==6)
          b[5]++,b[3]++;
        else if(k==8)
          b[7]++,b[2]+=3;
        else if(k==9)
          b[7]++,b[3]+=2,b[2]++;
    }
    for(i=9;i>=1;i--)
       for(j=1;j<=b[i];j++)
          printf("%d",i);
    printf("\n");
}