Codeforces Round #292 (Div. 2) 515C - Drazil and Factorial Solution

Problem Link :  https://codeforces.com/problemset/problem/515/C

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long  n,i;

    string sa[]= {"","","2","3","322","5","53","7","7222","7332"};

    string s="",st;

    cin>>n>>st;

    for(i=0; i<n; i++)

    {

        s+=sa[st[i]-'0'];

    }

    sort(s.begin(),s.end());

    reverse(s.begin(),s.end());

    cout<<s<<endl;

}