Blue Bridge Mug-palindrome number (string!!) ）

Problem description Observation Number: 12321,123321 all have a common feature, which is the same whether reading from left to right or from right to left. Such numbers are called: palindrome numbers.

The subject asks you to find some 5-bit or 6-bit decimal digits. Meet the following requirements:
The sum of the individual digits of the number equals the integer entered. The input format is a positive integer n (10<n<100), which indicates the number of digits and that are required to be satisfied. The output formats several lines, each containing a 5-bit or 6-bit integer that satisfies the requirement.
Numbers are arranged in order from small to large.
If no conditions are met, output: 1 Sample Input 44 sample output 99899
499994
589985
598895
679976
688886
697796
769967
778877
787787
796697
859958
868868
877778
886688
895598
949949
958859
967769
976679
985589
994499 Sample Input 60 sample output-1

Idea: First the palindrome sequence of the table hit well, calculated exactly 1800, so I array open 2000

Then sweep the front and back, and then the output will meet the conditions.

AC Code:

[CPP]View Plaincopyprint?

2. #include <cstdio>
4. #include <cstring>
6. #include <algorithm>
8. Using namespace std;
12. const INT MAXN = 2000;
14. int PALIN[MAXN], num = 0;
18. int Is_palin (int n) //Determine if it is a palindrome number
20. {
22. if (n<100000)
24. {
26. if ((n/10000 = = n%10) && (n/1000%10 = = n/10%10))
28. return 1;
30. }
32. Else
34. {
36. if (n/100000 = = n%10) && (n/10000%10 = = n/10%10) && (n/1000%10 = n/100%10))
38. return 1;
40. }
42. return 0;
44. }
48. void init () //palindrome number playing table
50. {
52. For (int i=10000; i<=999999; i++)
54. {
56. if (Is_palin (i)) palin[num++] = i;
58. }
60. }
64. int fun (int n) //Determine if the condition is met
66. {
68. int t = 0, m = n;
70. While (m)
72. {
74. T + = m%10;
76. M/= 10;
78. }
80. return t;
82. }
86. int main ()
88. {
90. Init ();
92. int n;
94. While (scanf ("%d", &n)! = EOF)
96. {
98. if (N < 5 | | n>54) {printf (" -1\n");  continue;}
100. For (int i=0; i<num; i++)
102. {
104. if (fun (palin[i]) = = N) printf ("%d\n", Palin[i]);
106. }
108. }
110. return 0;
112. }

Blue Bridge Mug-palindrome number (string!!) ）