1795. Digital Friends

单点时限: 2.0 sec

内存限制: 256 MB

Two positive integers are called friends if they consist of the same decimal digits. So 123 and 32331313323213 are friends, but 123 and 22121221 are not.

Two positive integers (that are not friends) are called almost friends if a single neighbour exchange in one of them results in a pair of friends. A neighbour exchanges two neighbouring digits a and b into a-1 and b+1, or into a+1 and b-1, provided that these new digits are still in the range 0…9, and that no leading zero is generated. So 123 and 2223042 are almost friends(let 04->13), and 137 and 470 are neither friends nor almost friends(note that 13 -> 04 is not allowd).

The problem is to determine if two given integers are friends or almost friends.

输入格式

The frist line of the input contains a single number: the number of test cases to follow. Each test case has the following format:

One line with two integer x and y, separated by a single space, with 0 < x, y < 10^100.Both integers start with a non-zero digit.

输出格式

For every test case in the input, the output should contain a single line with the string “friends” or “almost friends” or “nothing”, reflecting the property of the two given integers

样例

Input
4
123 32331313323213
123 22121221
123 223042
137 470
Output
friends
almost friends
almost friends
nothing

8 人解决,10 人已尝试。

9 份提交通过,共有 16 份提交。

5.7 EMB 奖励。

创建: 12 年,3 月前.

修改: 2 年,6 月前.

最后提交: 1 年,11 月前.

来源: The 2006 Benelux Algorithm Programming Contest

题目标签