'Algorithm&DataStructures'에 해당되는 글 38건

MakingStar(2)

1. Question

1) Enter a Number N

2) You should make a tier star top

3) First layer line has a star, Second has two.....and Last layer has N star 

4) Layer size must be N

5) The shape of layer is right alignment

2. Solution

public class MakingStar_2 { public static void main(String[]args){ Scanner n = new Scanner(System.in); int a = n.nextInt(); int temp = a; for(int i = 0; i<a; i++){ for(int h = 1; h< temp; h++){ System.out.print(" "); } temp--; for(int k = 0; k<i+1; k++){ System.out.print("*"); } System.out.println(); } } }

MakingStar(1)

1.Question

1) Enter a Number N

2) You should make a tier star top

3) First layer line has a star, Second has two.....and Last layer has N star 

4) Layer size must be N

2. Solution

import java.util.Scanner; public class MakingStar_1 { public static void main(String[]args){ Scanner n = new Scanner(System.in); int a = n.nextInt(); for(int i = 0; i<a; i++){ for(int k = 0; k<i+1; k++){ System.out.print("*"); } System.out.println(); } } }

Multiplication table

1. Question

1) Enter a number N

2) To print out from N*1 to N*9

2. Solution

import java.util.Scanner; public class MultiplicationTable { public static void main(String[]args){ Scanner a = new Scanner(System.in); int b = a.nextInt(); int c; for(int i = 1; i<10; i++){ c = b * i; System.out.println(b+" * "+i+" = "+ c); } } }

CountBackwardsN

1. Question

1) You have a number N

2) Print out numbers backwards from N to 1

2. Solution

import java.util.Scanner; public class CountBackward { public static void main(String[]args){ Scanner c = new Scanner(System.in); int a = c.nextInt(); for(int i = a; i>0; i-- ){ System.out.println(i); } } }