Codeforce 515C. Drazil and Factorial（字符串思维题）

【CodeForces】C. Drazil and Factorial

题目链接：Click Here

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

只要想到这个就很简单了，利用字符串存储，去相应替代每一个即可

// Author : RioTian
// Time : 20/10/14
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, i, Fac[10] = {0, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880};
string a[] = {"", "", "2", "3", "322", "5", "53", "7", "7222", "7332"};
string s, ss = "";
int main() {
// freopen("in.txt","r",stdin);
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> s;
for (i = 0; i < n; ++i)
ss += a[s[i] - '0'];
sort(ss.rbegin(), ss.rend());
cout << ss << endl;
}