Please note, this is a STATIC archive of website www.w3resource.com from 19 Jul 2022, cach3.com does not collect or store any user information, there is no "phishing" involved.
w3resource

Java Exercises: Create maximum number of regions obtained by drawing n given straight lines

Java Basic: Exercise-234 with Solution

If you draw a straight line on a plane, the plane is divided into two regions. For example, if you pull two straight lines in parallel, you get three areas, and if you draw vertically one to the other you get 4 areas.

Write a Java program to create maximum number of regions obtained by drawing n given straight lines.
Input:
(1 ≤ n ≤ 10,000)

Sample Solution:

Java Code:

import java.util.*;

public class Main { 
    public static void main(String[] args){ 
        Scanner scan = new Scanner(System.in);
		System.out.println("Input number of straight lines:");
     	int n=scan.nextInt();
		System.out.println("Number of regions:");
        System.out.println((n * (n + 1) >> 1) + 1);
    }
}

Sample Output:

Input number of straight lines:
5
Number of regions:
16

Pictorial Presentation:

Java exercises: Create maximum number of regions obtained by drawing n given straight lines.

Flowchart:

Flowchart: Create maximum number of regions obtained by drawing n given straight lines.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Java program that accept a even number (n should be greater than or equal to 4 and less than or equal to 50,000, Goldbach number) from the user and create a combinations that express the given number as a sum of two prime numbers. Print the number of combinations.
Next: Write a Java program to test whether AB and CD are orthogonal or not.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Java: Tips of the Day

How to sort an ArrayList?

Collections.sort(testList);
Collections.reverse(testList);

That will do what you want. Remember to import Collections though!

Ref: https://bit.ly/32urdSe