![]() |
VOOZH | about |
Given an array arr[] containing N distances of inch-feet system, such that each element of the array represents a distance in the form of {inch, feet}. The task is to add all the N inch-feet distances using structures.
Examples:
Input: arr[] = { { 10, 3.7 }, { 10, 5.5 }, { 6, 8.0 } };
Output: Feet Sum: 27 Inch Sum: 5.20
Input: arr[] = { { 1, 1.7 }, { 1, 1.5 }, { 6, 8 } };
Output: Feet Sum: 8 Inch Sum: 11.201. Traverse the struct array arr and find the summation of all the inches of the given set of N distances as:
feet_sum = feet_sum + arr[i].feet; inch_sum = inch_sum + arr[i].inch;
2. If the sum of all the inches (say inch_sum) is greater than 12, then convert the inch_sum into feet because
1 feet = 12 inches
3. Therefore update inch_sum to inch_sum % 12. Then find the summation of all the feet (say feet_sum) of N distances and add inches_sum/12 to this sum.
4. Print the feet_sum and inch_sum individually.
feet_sum = feet_sum + arr[i].feet; inch_sum = inch_sum + arr[i].inch;
Below is the implementation of the above approach:
Feet Sum: 27 Inch Sum: 5.20
Time Complexity: O(N), where N is the number of inch-feet distances.