Pro.ID21376 TitleHomogeneous squares Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21376 AC67 Submit103 Ratio65.05% 时间&空间限制描述Assume you have a square of size n that is divided into n×n positions just as a checkerboard. Two positions (x1,y1) and (x2,y2), where 1 ≤ x1,y1,x2,y2 ≤ n, are called "independent" if they occupy different rows and different columns, that is, x1≠x2 and y1≠y2 . More generally, n positions are called independent if they are pairwise independent. It follows that there are n! different ways to choose n independent positions. 输入The input contains several test cases. The first line of each test case contains an integer n (1 <= n <= 1000). Each of the next n lines contains n numbers, separated by exactly one space character. Each number is an integer from the interval [-1000000,1000000]. 输出Description Assume you have a square of size n that is divided into n×n positions just as a checkerboard. Two positions (x1,y1) and (x2,y2), where 1 ≤ x1,y1,x2,y2 ≤ n, are called "independent" if they occupy different rows and different columns, that is, x1≠x2 and y1≠y2 . More generally, n positions are called independent if they are pairwise independent. It follows that there are n! different ways to choose n independent positions. Input The input contains several test cases. The first line of each test case contains an integer n (1 <= n <= 1000). Each of the next n lines contains n numbers, separated by exactly one space character. Each number is an integer from the interval [-1000000,1000000]. Output For each test case output whether the specified square is homogeneous or not. Adhere to the format shown in the sample output. Sample Input 2 1 2 3 4 3 1 3 4 8 6 -2 -3 4 0 0 Sample Output homogeneous not homogeneous Author 样例输入2 1 2 3 4 3 1 3 4 8 6 -2 -3 4 0 0 样例输出homogeneous not homogeneous 提示作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-3 00:57 , Processed in 0.020086 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
