Basic_09_特殊回文数

问题描述

　　123321是一个非常特殊的数，它从左边读和从右边读是一样的。

　　输入一个正整数n， 编程求所有这样的五位和六位十进制数，满足各位数字之和等于n 。

输入格式

　　输入一行，包含一个正整数n。

输出格式

　　按从小到大的顺序输出满足条件的整数，每个整数占一行。

样例输入

52

样例输出

899998

989989

998899

数据规模和约定

　　1<=n<=54。

程序：

import java.util.Scanner;

public class Main {

public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for(long i=10000;i<1000000;i++){
if(i<100000){
int one = (int) (i%10);
int two = (int) (i/10%10);
int three = (int) (i/100%10);
int four = (int) (i/1000%10);
int five = (int) (i/10000);
int total = one+two+three+four+five;
if(one == five && two == four && total == n){
System.out.println(i);
}
}else{
int one = (int) (i%10);
int two = (int) (i/10%10);
int three = (int) (i/100%10);
int four = (int) (i/1000%10);
int five = (int) (i/10000%10);
int six = (int) (i/100000);
int total = one+two+three+four+five+six;
if(one == six && two == five && three == four && total == n){
System.out.println(i);
}
}
}

}
}