##### Canadian Computing Competition: 2006 Stage 1, Senior #4

In mathematics, a *group*, , is an object that consists of a set of elements and an operator (which we will call ) so that if and are in so is . Operations also have the following properties:

- Associativity: For all , and in , .
- Identity: the group contains an "identity element" (we can use ) so that for each in , and .
- Inverse: for every element there is an inverse element (we denote by ) so that and .

Groups have a wide variety of applications including the modeling of quantum states of an atom and the moves in solving a Rubik's cube puzzle. Clearly, the integers under addition from a group ( is the identity, and the inverse of is , and you can prove associativity as an exercise), though that group is infinite and this problem will deal only with finite groups.

One simple example of a finite group is the integers modulo under the operation addition.

That is, the group consists of the integers and the operation is to add two keeping only the least significant digit. Here the identity is . This particular group has the property that , but this is not always the case. Consider the group that consists of the elements , , , , and . The "multiplication table" below defines the operations. Note that each of the required properties is satisfied (associativity, identity and inverse) but, for example, while .

Your task is to write a program which will read a sequence of multiplication tables and determine whether each structure defined is a group.

#### Input Specification

The input will consist of a number of test cases. Each test case begins with an integer . If the test case begins with , the program terminates. To simplify the input, we will use the integers to represent elements of the candidate group structure; the identity could be any of these (i.e., it is not necessarily the element ). Following the number in each test case are lines of input, each containing integers in the range . The integer on the line of this sequence is the value .

#### Output Specification

If the object is a group, output `yes`

(on its own line), otherwise output `no`

(on its own line). You should not output anything for the test case where .

#### Sample Input

```
2
1 2
2 1
6
1 2 3 4 5 6
2 1 5 6 3 4
3 6 1 5 4 2
4 5 6 1 2 3
5 4 2 3 6 1
6 3 4 2 1 5
7
1 2 3 4 5 6 7
2 1 1 1 1 1 1
3 1 1 1 1 1 1
4 1 1 1 1 1 1
5 1 1 1 1 1 1
6 1 1 1 1 1 1
7 1 1 1 1 1 1
3
1 2 3
3 1 2
3 1 2
0
```

#### Sample Output

```
yes
yes
no
no
```

#### Explanation

The first two collections of elements are in fact groups (that is, all properties are satisfied). For the third candidate, it is not a group, since but . In the last candidate, there is no identity, since is not the identity, since (not ), and is not the identity, since (not ) and is not the identity, since (not ).

## Comments

This comment is hidden due to too much negative feedback. Show it anyway.

The operators are simply 2 variable functions, not necessarily arithmetic functions. For example, in the 6 element group (iabcde), there is no mapping of the elements to (1,2,3,4,5,6) with an arithmetic function. (I think it is isomorphic to the group of symmetries of a triangle as well as the group of permutations with 3 elements.)

For those that are a bit confused about this problem, I have a few tips:

The described in the inverse definition is actually the identity element described in the identity definition, they are the same variable.

The grid is a times table, so a hint would be that is equivalent as the element at position in the grid.

An identity element could be as hinted in the problem statement, use

indexesas the elements to cover that case.This problem is surprisingly annoying, and I hope this helps.

In the input specification, the elements are given as to , so the elements can be used directly without indexes. I think there is no way to solve the problem without testing all triples for the associativity, so that the solution would take time. In C++, a

`vector<vector<int>>`

also works for recording the function definition.