Don't wanna be here? Send us removal request.
Statistics
We looked inside some of the posts by ryanilao-java-program-blog and here's what we found interesting.
Average Info
Notes Per Post
2
Likes Per Post
2
Reblog Per Post
0
Reply Per Post
0
Time Between Posts
3 hours
Number of Posts By Type
Text
8
Last Seen Tumblr Blogs
Fun Fact
25% of US internet users with an annual income of $80-100K use Tumblr.
Text
Java - Abundant Sequence
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class AbundantNumbers { public static void main (String[] args){ Scanner scanner = new Scanner(System.in); int total = 0;
System.out.println("Enter a valid number: "); int inNum = scanner.nextInt(); scanner.nextLine();
for(int i=1; i <= inNum; i++) { for (int j = 1; j < i; j++){ if ((i % j) == 0) { total += j; } } if (total > i) { System.out.print(i + " "); } total = 0; } } }
0 notes
Text
Java - Bubble Sort
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class BubbleSort { public static void main (String[] args){ Scanner scanner = new Scanner(System.in);
int [] intArr = new int[10]; int swap;
System.out.println("Enter a series of 10 numbers: "); for(int i = 0; i < intArr.length; i++){ intArr[i] = scanner.nextInt(); scanner.nextLine(); }
//int [] sortedArr = new int[intArr.length]; for(int i = 0; i < intArr.length; i++) { for(int j = i + 1; j < intArr.length; j++){ if (intArr[i] > intArr[j]) { swap = intArr[j]; intArr[j] = intArr[i]; intArr[i] = swap; } } } System.out.println("Sorted Array: "); for(int i = 0; i < intArr.length; i++){ System.out.println(intArr[i]); } } }
0 notes
Text
Java - Armstrong Number
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class ArmstrongNumber { public static void main (String[] args){ Scanner scanner = new Scanner(System.in);
int total = 0;
System.out.println("Enter a valid number: "); int inputNo = scanner.nextInt(); scanner.nextLine();
int orig = inputNo; int remainder = inputNo%10; inputNo /= 10; total += (remainder * remainder *remainder);
while (inputNo != 0) {
remainder = inputNo%10; inputNo /= 10; total += (remainder * remainder *remainder); }
if (total == orig) { System.out.println(orig + " is an Armstrong number."); } else { System.out.println(orig + " is not an Armstrong number."); } } }
0 notes
Text
Java - Factorial
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class Factorial { public static void main(String[] args){ Scanner scanner = new Scanner (System.in); System.out.println("Enter a valid number: "); int inNum = scanner.nextInt(); scanner.nextLine();
int total = 1;
for(int i = inNum; i >= 1; i--){ total *= i; }
System.out.println(inNum + "! is " + total); } }
0 notes
Text
Java - Palindrome (not using reverse)
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class Palindrome { public static void main(String[] args){ Scanner scanner = new Scanner(System.in); System.out.println("Enter a string: "); String inString = scanner.nextLine(); String ouString = "";
String[] arrString = inString.split("");
for(int i = (arrString.length - 1); i >= 0; i--){ ouString += arrString[i]; } if (inString.equals(ouString)) { System.out.println(inString + " is a palindrome."); } else { System.out.println(inString + " is not a palindrome."); } } }
0 notes
Text
Java - To list the fibonacci number sequence
package FooBar; import java.util.Scanner; /** * * @author ryilao */ public class FibonacciNumber { public static void main(String[] args) { Scanner scanner = new Scanner (System.in); int initialVal = 0; int additive = 1; int valHolder;
System.out.println("Enter a valid number: "); int inputNo = scanner.nextInt(); scanner.nextLine();
System.out.println("Fibonacci Series: "); System.out.print(initialVal + " ");
for(int i = 0; i <= inputNo; i++) { valHolder = additive; additive = initialVal + additive; initialVal = valHolder;
System.out.print(initialVal + " "); } } }
2 notes
·
View notes
Text
Java - to find prime numbers
package exam;
/** * * @author ryilao */ public class prime_numbers { public static void main(String[] args) { int max = 500; int cntr = 0;
for (int i = 2; i <= max; i++) { for (int j = 2; j < (i + 1); j++) { int mod = i % j; if (mod == 0) { cntr++; } } if (cntr == 1) { // System.out.println (cntr); System.out.println(i + " is a prime number"); } cntr = 0; } } }
0 notes
Text
Java - List perfect squares from user input
package FooBar;
import java.util.Scanner;
/** * * @author ryilao */ public class SquarePanels { public static void main(String[] args) { Scanner user_input = new Scanner(System.in); int input_number; System.out.println("Enter the area (1 - 1000000):"); input_number = user_input.nextInt(); if (input_number > 1 && input_number < 1000000) { //answer(input_number); int[] Slist = answer(input_number); for (int x = 0; x < Slist.length; x++) { if (Slist[x] != 0) { System.out.print(Slist[x] + " "); } } } else { System.out.println("Invalid Area."); } }
public static int[] answer(int area) { int[] SquareList = new int[20]; int Tarea = area; int i = 0; int PSquare; double square;
do { if (Tarea > 1) { square = Math.sqrt(Tarea); PSquare = (int) square; SquareList[i++] = PSquare * PSquare; Tarea = Tarea - (PSquare * PSquare); } else { SquareList[i++] = Tarea; break; } } while (Tarea >= 1); return SquareList; } }
0 notes