标签:
Problem here
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.
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 a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.
4
1234
33222
3
555
555
答案參考這裡
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string arr[] = {"0", "0", "2", "3", "322", "5", "53", "7", "7222", "7332"};
bool cmp(char &a, char &b){
return a > b;
}
int main(){
int n;
cin >> n;
string input;
cin >> input;
string result = "";
for(int i = 0; i < input.length(); i++){
if(input[i] != ‘0‘ && input[i] != ‘1‘){
result += arr[input[i]-‘0‘];
}
}
sort(result.begin(), result.end(), cmp);
cout << result << endl;
return 0;
}
【CodeForces】C. Drazil and Factorial
标签:
原文地址:http://blog.csdn.net/leonghouheng/article/details/51340614