POJ3913

^{此题比较简单!!不多说!!}

---

---

                                                                                        Gnome Sequencing

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1526		Accepted: 1022

Description

In the book All Creatures of Mythology, gnomes are kind, bearded creatures, while goblins tend to be bossy and simple-minded. The goblins like to harass the gnomes by making them line up in groups of three, ordered by the length of their beards. The gnomes, being of different physical heights, vary their arrangements to confuse the goblins. Therefore, the goblins must actually measure the beards in centimeters to see if everyone is lined up in order. Your task is to write a program to assist the goblins in determining whether or not the gnomes are lined up properly, either from shortest to longest beard or from longest to shortest.

Input

The input starts with line containing a single integer N, 0 < N < 30, which is the number of groups to process. Following this are N lines, each containing three distinct positive integers less than 100.

Output

There is a title line, then one line per set of beard lengths. See the sample output for capitalization and punctuation.

Sample Input

3
40 62 77
88 62 77
91 33 18

Sample Output

Gnomes:
Ordered
Unordered
Ordered

Source

Mid-Central USA 2009

 

 

 

 

2. #include <stdio.h>
3. bool is_ordered(int a, int b, int c)
4. {   
5.   if (a < b && b < c)    
6.      return true;   
7.   if (a > b && b > c)      
8.    return true;
9.     return false;
10. }
11. int main()
12. {   
13.   int n, a, b, c;   
14.   scanf("%d", &n);   
15.   printf("Gnomes:\n");   
16.   while (n--)    
17. {        
18. scanf("%d %d %d", &a, &b, &c);      
19.    if (is_ordered(a, b, c))       
20.       printf("Ordered\n");       
21.   else            
22. printf("Unordered\n");
23.     }
24.     return 0;
25. }