Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Author: Nikolay Yunger
- * Date: 8/15/2014
- * Program: AP CS Summer Work
- */
- import java.util.Scanner;
- public class SummerProject{
- public static void main(String[] args) {
- String binary = toBase2(number);
- int number = getInput();
- String answer = "";
- int amt[] = getPalindromeList(number);
- for (int x=0; x<amt.length; x++)
- answer = answer + amt[x] + " ";
- System.out.println("The first"+number+"numbers are: "+answer);
- System.out.println("The sum of the first"+number+"numbers is: "+sum(amt));
- }
- public static int getInput(){
- Scanner input = new Scanner(System.in);
- System.out.print("How many numbers would you like? ");
- int number = 0;
- while(true){
- if (!input.hasNextInt()){
- System.out.print("Please enter a positive number: ");
- input.next();
- }else {
- number = input.nextInt();
- if(number<=0){
- System.out.println("Please enter a number greater than zero: ");
- }else if (number>0){
- break;
- }
- }
- }
- input.close();
- return number;
- }
- public static String toBase2(int n){
- String binary = Integer.toBinaryString(n);
- return binary;
- }
- public static boolean isPalindromic(String num){
- String mirror = new StringBuffer(num).reverse().toString();
- if (mirror.equals(num)){
- return true;
- }else{
- return false;
- }
- }
- public static int[] getPalindromeList(int n){
- int[] list = new int[n];
- int raise = 1;
- int counter = 0;
- while(list.length>counter);{
- if(isPalindromic(new Integer(raise).toString()) && isPalindromic(toBase2(raise))){
- list[counter]=raise;
- counter++;
- raise++;
- }else{
- raise++;
- }
- }
- return list;
- }
- public static int sum(int[] array){
- int total = 0;
- for(int x=0;x<array.length;x++)
- total += array[x];
- return total;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement