**Small Triangles, Large Triangles C**

### Problem Statement :

You are given n triangles, specifically, their sides a(i), b(i) and c(i) . Print them in the same style but sorted by their areas from the smallest one to the largest one. It is guaranteed that all the areas are different. Input Format First line of each test file contains a single integer n. n lines follow with , a(i), b(i) and c(i) on each separated by single spaces. Constraints 1 <= n <= 100 1 <= a(i), b(i), c(i) <= 70 a(i) + b(i) > c(i) a(i) + c(i) > b(i) and b(i) + c(i) > a(i) . Output Format Print exactly n lines. On each line print 3 integers separated by single spaces, which are a(i), b(i) and c(i) of the corresponding triangle.

### Solution :

` ````
Solution in C :
#include <stdio.h>
#include <stdlib.h>
struct Triangle
{
int a, b, c;
};
int square(struct Triangle t)
{
int a = t.a, b = t.b, c = t.c;
return (a + b + c)*(a + b - c)*(a - b + c)*(-a + b + c);
}
void sort_by_square(struct Triangle* a, int n)
{
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (square(a[i]) > square(a[j]))
{
struct Triangle temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
int main()
{
int n;
scanf("%d", &n);
struct Triangle *a = calloc(n, sizeof(struct Triangle));
for (int i = 0; i < n; i++)
scanf("%d%d%d", &a[i].a, &a[i].b, &a[i].c);
sort_by_square(a, n);
for (int i = 0; i < n; i++)
printf("%d %d %d\n", a[i].a, a[i].b, a[i].c);
return 0;
}
```

## View More Similar Problems

## Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

View Solution →## Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

View Solution →## Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →## Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →