f1: Calculate the minimum of areas of the elements that length of place is the square number > 1 (Assume that there are at least 1 element that satisfies the condition).
(A square number is an integer that is the square of an integer. In other words, it is the product of some integer with itselft)
f2: Reverse the second 3 elements in the list (from the 4th element to 6th element, other elements are unchanged) (Assume that there are at least 6 elements).
f3: Replace the first element by the first element having minimum area.
When running, the program will add some data to the list. Sample output might look something like:
Paper No: 7
Add how many elements: 0
4 of 4
Add how many elements: 0
Enter TC(1-fl;2-f2;3-f3): 2
Enter TC(1-f1;2-f2;3-f3): 1
The list before running f2:
(A,6) (B,9) (C,2) (D,9) (E,2) (F,9) (G,2) (H,5)
The list before running f1:(A123,8) (B,2) (C12,6) (D1,7) (E234,6)
OUTPUT:(A,6) (B,9) (C,2) (F,9) (E,2) (D,9) (G,2) (H,5)
Zoom
OUTPUT:6
Add how many elements: 0
+ 95%
Close
