思路:暴力即可
AC代码:
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <queue> #include <stack> #include <map> #include <cstring> #include <climits> #include <cmath> #include <cctype> typedef long long ll; using namespace std; bool flag; void cf(int n) { int i; for(i=10000; i<=99999; i++) { int c = i; if(c/10000 != c%10 || c/1000%10 != c % 100 / 10) { continue; } int sum = 0; while(c) { sum += c % 10; c /= 10; } if(sum == n) { flag = true; printf("%d\n",i); } } for(i=100000; i<=999999; i++) { int c = i; if(c/100000 != c%10 || c/10000%10 != c % 100 / 10 || c / 1000 % 10 != c % 1000 / 100) { continue; } int sum = 0; while(c) { sum += c % 10; c /= 10; } if(sum == n) { flag = true; printf("%d\n",i); } } } int main() { int n; while(scanf("%d",&n) != EOF) { flag = false; cf(n); if(!flag) { printf("-1\n"); } } return 0; }