C/C++ program to add N distances given in inch-feet system using Structures Last Updated : 21 May, 2020 Comments Improve Suggest changes Like Article Like Report 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.20 Approach: 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; 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 Therefore update inch_sum to inch_sum % 12. Then find the summation of all the feets(say feet_sum) of N distances and add inches_sum/12 to this sum. Print the feet_sum and inch_sum individually. Below is the implementation of the above approach: C // C program for the above approach #include "stdio.h" // Struct defined for the inch-feet system struct InchFeet { // Variable to store the inch-feet int feet; float inch; }; // Function to find the sum of all N // set of Inch Feet distances void findSum(struct InchFeet arr[], int N) { // Variable to store sum int feet_sum = 0; float inch_sum = 0.0; int x; // Traverse the InchFeet array for (int i = 0; i < N; i++) { // Find the total sum of // feet and inch feet_sum += arr[i].feet; inch_sum += arr[i].inch; } // If inch sum is greater than 11 // convert it into feet // as 1 feet = 12 inch if (inch_sum >= 12) { // Find integral part of inch_sum x = (int)inch_sum; // Delete the integral part x inch_sum -= x; // Add x%12 to inch_sum inch_sum += x % 12; // Add x/12 to feet_sum feet_sum += x / 12; } // Print the corresponding sum of // feet_sum and inch_sum printf("Feet Sum: %d\n", feet_sum); printf("Inch Sum: %.2f", inch_sum); } // Driver Code int main() { // Given set of inch-feet struct InchFeet arr[] = { { 10, 3.7 }, { 10, 5.5 }, { 6, 8.0 } }; int N = sizeof(arr) / sizeof(arr[0]); // Function Call findSum(arr, N); return 0; } C++ // C++ program for the above approach #include "iostream" using namespace std; // Struct defined for the inch-feet system struct InchFeet { // Variable to store the inch-feet int feet; float inch; }; // Function to find the sum of all N // set of Inch Feet distances void findSum(InchFeet arr[], int N) { // Variable to store sum int feet_sum = 0; float inch_sum = 0.0; int x; // Traverse the InchFeet array for (int i = 0; i < N; i++) { // Find the total sum of // feet and inch feet_sum += arr[i].feet; inch_sum += arr[i].inch; } // If inch sum is greater than 11 if (inch_sum >= 12) { // Find integral part of inch_sum int x = (int)inch_sum; // Delete the integral part x inch_sum -= x; // Add x%12 to inch_sum inch_sum += x % 12; // Add x/12 to feet_sum feet_sum += x / 12; } // Print the corresponding sum of // feet_sum and inch_sum cout << "Feet Sum: " << feet_sum << '\n' << "Inch Sum: " << inch_sum << endl; } // Driver Code int main() { // Given a set of inch-feet InchFeet arr[] = { { 10, 3.7 }, { 10, 5.5 }, { 6, 8.0 } }; int N = sizeof(arr) / sizeof(arr[0]); // Function Call findSum(arr, N); return 0; } Output: Feet Sum: 27 Inch Sum: 5.20 Time Complexity: O(N), where N is the number inch-feet distances. Comment More infoAdvertise with us Next Article C/C++ program to add N distances given in inch-feet system using Structures S sksinha1612 Follow Improve Article Tags : Mathematical C Programs C++ Programs Data Structures Programming Language C Language DSA cpp-structure C-Structure & Union Structure & Union cpp-struct +7 More Practice Tags : Data StructuresMathematical Similar Reads C Program to Add N Distances Given in inch-feet System using Structures 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 S 3 min read C program to find the Euclidean distance between two points Given four integers x1, y1, x2 and y2, which represents two coordinates (x1, y1) and (x2, y2) of a two-dimensional graph. The task is to find the Euclidean distance between these two points. Euclidean distance between two points is the length of a straight line drawn between those two given points. 2 min read C++ Program To Find The Sum Of Last N Nodes Of The Given Linked List Given a linked list and a number n. Find the sum of the last n nodes of the linked list.Constraints: 0 <= n <= number of nodes in the linked list. Examples: Input: 10->6->8->4->12, n = 2 Output: 16 Sum of last two nodes: 12 + 4 = 16 Input: 15->7->9->5->16->14, n = 4 10 min read C++ Program to Find Diagonal of a Rectangle Given two positive integers i.e, the length and breadth of the rectangle, the task is to find the length of the Diagonal of a Rectangle. Example: Input: length=4 breadth=3 output: The Diagonal is 5 The diagonal of a rectangle is sqrt (a*a+ b*b) C++ // C++ Program to Find Diagonal of a Rectangle #inc 1 min read C Program To Add Two Numbers Represented By Linked Lists- Set 1 Given two numbers represented by two lists, write a function that returns the sum list. The sum list is a list representation of the addition of two input numbers. Example: Input: List1: 5->6->3 // represents number 563 List2: 8->4->2 // represents number 842 Output: Resultant list: 1- 4 min read Like