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

Last update on March 10 2025 12:23:01 (UTC/GMT +8 hours)

Maximum Regions from Straight Lines

If you draw a straight line on a plane, the plane is divided into two regions. For example, if you draw two straight lines in parallel, you get three areas. If you draw vertically from one to the other you get 4 areas.
Write a Java program to create the maximum number of regions obtained by drawing n given straight lines.
Input:
(1 ≤ n ≤ 10,000)

Visu al Presentation:

Sample Solution:

Java Code:

// Importing the necessary package for Scanner class
import java.util.*;

// Main class named "Main"
public class Main { 
    // Main method to execute the program
    public static void main(String[] args){ 
        // Creating a Scanner object to read input from the console
        Scanner scan = new Scanner(System.in);

        // Prompting the user to input the number of straight lines
        System.out.println("Input number of straight lines:");

        // Reading the input value for the number of straight lines
        int n = scan.nextInt();

        // Outputting the number of regions based on the given formula
        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

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to compute the maximum number of regions formed by n straight lines when some lines may be parallel.
• Write a Java program to calculate the maximum number of regions created by n lines with at least one concurrent intersection.
• Write a Java program to determine the maximum regions formed by drawing n non-parallel, non-concurrent lines.
• Write a Java program to compute the maximum number of regions in a plane when n lines are drawn with no three intersecting at one point.

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.