Hello Programmers/Coders, Today we are going to share solutions of Programming problems of 30 Days Of Code, HackerRank. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Day 5: Loops in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Link for the Problem – Day 5: Loops – Hacker Rank Solution
Day 5: Loops – Hacker Rank Solution
Problem:
Objective
In this challenge, we will use loops to do some math. Check out the Tutorial tab to learn more.
Task
Given an integer, , print its first multiples. Each multiple (where ) should be printed on a new line in the form: n x i = result
.
Example
The printout should look like this:
3 x 1 = 3 3 x 2 = 6 3 x 3 = 9 3 x 4 = 12 3 x 5 = 15 3 x 6 = 18 3 x 7 = 21 3 x 8 = 24 3 x 9 = 27 3 x 10 = 30
Input Format
A single integer, .
Constraints
Output Format
Print lines of output; each line (where ) contains the of in the form:n x i = result
.
Sample Input
2
Sample Output
2 x 1 = 2 2 x 2 = 4 2 x 3 = 6 2 x 4 = 8 2 x 5 = 10 2 x 6 = 12 2 x 7 = 14 2 x 8 = 16 2 x 9 = 18 2 x 10 = 20
Day 5: Loops – Hacker Rank Solution
import java.util.Scanner; /** * @author Techno-RJ * */ public class Day5Loops { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); in.close(); for (int i = 1; i <= 10; i++) { System.out.println(n + " x " + i + " = " + n * i); } } }