南邮 OJ 1088 Gnome Sequencing

最新推荐文章于 2018-09-07 20:00:10 发布

chenrujun2010

最新推荐文章于 2018-09-07 20:00:10 发布

阅读量259

点赞数

分类专栏：南邮 OJ 文章标签：南邮OJ ACM Gnome Sequencing

本文链接：https://blog.csdn.net/changshu1/article/details/47273549

版权

南邮 OJ 专栏收录该内容

453 篇文章 44 订阅

订阅专栏

Gnome Sequencing

时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte
总提交 : 305 测试通过 : 203

比赛描述

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.

输入

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.

输出

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

样例输入

3
40 62 77
88 62 77
91 33 18

样例输出

Gnomes:
Ordered
Unordered
Ordered

题目来源

ACM Mid-Central Regional 2009

#include<stdio.h>
int main(){
	int N,a,b,c;
	scanf("%d",&N);
	printf("Gnomes:\n");
	while(N--){
		scanf("%d%d%d",&a,&b,&c);
		if(a>b&&b>c || a<b&&b<c)
			printf("Ordered\n");
		else
			printf("Unordered\n");
	}
}