已知数各位上的和和乘积求这个数

 

 

#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
char dp[901][8101];//length
char d[901][8101];//last digit
int main() {
    for (int i = 1;i <= 9;i++) {
        dp[i][i * i] = 1;
        d[i][i * i] = i;
    }
    for (int i = 1;i <= 900;i++) {
        for (int j = i;j <= 8100;j++) {
            for (int k = 1;k <= 9;k++) {
                if (i < k || j < k * k) break;
                if (dp[i - k][j - k * k] == 0 || dp[i - k][j - k * k] == 100) continue;
                if (dp[i][j] == 0 || dp[i - k][j - k * k] + 1  < dp[i][j]) {
                    dp[i][j] = dp[i - k][j - k * k] + 1;
                    d[i][j] = k;
                }
            }
        }
    }
    int n,a,b;
    scanf("%d",&n);
    while (n--) {
        scanf("%d%d",&a,&b);
        if (a > 900 || b > 8100 || dp[a][b] == 0) {
            puts("No solution");
            continue;
        }
        while (dp[a][b]) {
            int digit = d[a][b];
            printf("%d",digit);
            a -= digit;
            b -= digit * digit;
        }
        puts("");
    }
}

 

 

Sum of Digits

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 256    Accepted Submission(s): 82

Problem Description
Petka thought of a positive integer n and reported to Chapayev the sum of its digits and the sum of its squared digits. Chapayev scratched his head and said: "Well, Petka, I won't find just your number, but I can find the smallest fitting number." Can you do the same?
 

Input
The first line contains the number of test cases t (no more than 10000). In each of the following t lines there are numbers s1 and s2 (1 ≤ s1, s2 ≤ 10000) separated by a space. They are the sum of digits and the sum of squared digits of the number n.
 

Output
For each test case, output in a separate line the smallest fitting number n, or "No solution" if there is no such number or if it contains more than 100 digits.
 

Sample Input
4
9 81
12 9
6 10
7 9
 

Sample Output
9
No solution
1122
111112