Problem specification:  There is a grid of NXN squares. We can easily determines how many different rectangles (squares are excluded) there are in the grid. For example, in a 3X3 grid, you can find 22 different rectangles, marked as the green rectangles. You can see that we did not count the red ones as they are squares. In this assignment, you will write a Java program that takes the value   of N as input and determines the total area of all the rectangles in the grid. Assume that the smallest squares in the  grid have length 1. So a 3X2 rectangle will have an area of 6. For example, the total area of all the rectangles in the 3X3  grid is 66.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           Input specification:  The input is a single integer which represents N, the size of the square grid. The value of N is in the range 1 ≤  ≤ 70.  Output specification:  The output of your program is a single integer that represents the total area of all the rectangles in the grid. Note: You must not print anything extraneous (such as “Please enter N” or “the result is”).  Sample input:  Sample output: 8  10  22 12432  43032  3882032

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

 

Problem specification: 

There is a grid of NXN squares. We can easily determines how many different rectangles (squares are excluded) there are in the grid. For example, in a 3X3 grid, you can find 22 different rectangles, marked as the green rectangles. You can see that we did not count the red ones as they are squares. In this assignment, you will write a Java program that takes the value  

of N as input and determines the total area of all the rectangles in the grid. Assume that the smallest squares in the  grid have length 1. So a 3X2 rectangle will have an area of 6. For example, the total area of all the rectangles in the 3X3  grid is 66.

 

     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     



     
     
     




Input specification: 

The input is a single integer which represents N, the size of the square grid. The value of N is in the range 1 ≤  ≤ 70. 

Output specification: 

The output of your program is a single integer that represents the total area of all the rectangles in the grid. Note: You must not print anything extraneous (such as “Please enter N” or “the result is”). 

Sample input: 

Sample output:

10 

22

12432 

43032 

3882032

 

Problem specification:
There is a grid of NXN squares. We can easily determines how many different rectangles (squares are excluded) there are
in the grid. For example, in a 3X3 grid, you can find 22 different rectangles, marked as the green rectangles. You can see
that we did not count the red ones as they are squares. In this assignment, you will write a Java program that takes the value
of N as input and determines the total area of all the rectangles in the grid. Assume that the smallest squares in the
grid have length 1. So a 3X2 rectangle will have an area of 6. For example, the total area of all the rectangles in the 3X3
grid is 66.
Input specification:
The input is a single integer which represents N, the size of the square grid. The value of N is in the range 1 < N < 70.
Output specification:
The output of your program is a single integer that represents the total area of all the rectangles in the grid.
Note: You must not print anything extraneous (such as “Please enter N" or “the result is").
Sample input:
Sample output:
Q +
I 2 12433
43032
3882032
8
Page
1
10
22
Transcribed Image Text:Problem specification: There is a grid of NXN squares. We can easily determines how many different rectangles (squares are excluded) there are in the grid. For example, in a 3X3 grid, you can find 22 different rectangles, marked as the green rectangles. You can see that we did not count the red ones as they are squares. In this assignment, you will write a Java program that takes the value of N as input and determines the total area of all the rectangles in the grid. Assume that the smallest squares in the grid have length 1. So a 3X2 rectangle will have an area of 6. For example, the total area of all the rectangles in the 3X3 grid is 66. Input specification: The input is a single integer which represents N, the size of the square grid. The value of N is in the range 1 < N < 70. Output specification: The output of your program is a single integer that represents the total area of all the rectangles in the grid. Note: You must not print anything extraneous (such as “Please enter N" or “the result is"). Sample input: Sample output: Q + I 2 12433 43032 3882032 8 Page 1 10 22
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY