MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

Codeforces_problems/Drazil and Factorial/solution.cpp:23–37  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

21using namespace std;
22
23int main() {
24 ios_base::sync_with_stdio(false);
25 cin.tie(NULL);
26 int digits;
27 string str , res;
28 cin >> digits;
29 cin >> str;
30 vector <string> vect{"","","2","3","322","5","53","7","7222","7332"};
31 for (int i = 0; i < digits; i++) {
32 res += vect[str[i] - '0'];
33 }
34 sort(res.rbegin(), res.rend());
35 cout << res << endl;
36 return 0;
37}

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected