shunfurh 于 2017.01.05 23:37 提问

Friends or Enemies?

Description

A determined army on a certain border decided to enumerate the coordinates in its patrol in a way to make it difficult for the enemy to know what positions they are referring to in the case that the radio signal used for communication is intercepted. The enumeration process chosen was the following: first it is decided where the axes x and y are; then, a linear equation that describes the position of the border relative to the the axes (yes, it is a straight line) is defined; finally, all points on the Cartesian plane that is not part of the border are enumerated, the number 0 being attributed to the coordinate (0, 0) and starting from there numbers being attributed to integral coordinates following a clockwise spiral, always skipping points that fall on the border (see Figure 1). If the point (0, 0) falls on the border, the number 0 is attributed to the first point that is not part of the border following the specified order.

Figure 1: Enumeration of points of integral coordinates

In fact the enemy does not have to know either what position the army is referring to or the system used to enumerate the points. Such a project, complicated the life of the army, once that it is difficult to determine whether two points are on the same side of the border or on opposite sides. That is where they need your help.

Input

The input contains several test cases. The first line of the input contains an integer N (1 ≤ N ≤ 100) which represents the quantity of test cases. N test cases follow. The first line of each test case contains two integers a and b (−5 ≤ a ≤ 5 and −10 ≤ b ≤ 10) which describe the equation of the border: y = ax + b. The second line of each test case contains an integer K, indicating the number of queries that follow it (1 ≤ K ≤ 1000). Each one of the following K lines describes a query, composed by two integers M and N representing the enumerated coordinates of two points (0 ≤ M, N ≤ 65535).

Output

For each test case in the input your program should produce K + 1 lines. The first line should contain the identification of the test case in the form Caso X, where X should be substituted by the case number (starting from 1). The K following lines should contain the results of the K queries made in the corresponding case in the input, in the form:

Mesmo lado da fronteira (The same side of the border)

or

Lados opostos da fronteira (Opposite sides of the border)

Sample Input

2
1 2
10
26 25
25 11
24 9
23 28
25 9
25 1
25 0
9 1
23 12
26 17
1 2
12
0 1
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
Sample Output

Caso 1
Caso 2

1个回答

caozhy      2017.01.05 23:50

POJ 3119 Friends or Enemies?

HDU5874 Friends and Enemies

Friends and Enemies HDU - 5874
On an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two dwarves on the island ar
【HDU5874】Friends and Enemies（思维）

hdu 5874 Friends and Enemies

HDU 5874 Friends and Enemies
Problem Description On an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two
NFV&SDN: Friends or Enemies?

HDU 5874 Friends and Enemies（构造）
Description 有m个人n种珠子，现在要用这些种珠子给m个人每人串一条项链（长度可以为0），两个人之间要么是朋友关系要么是敌人关系，要求两个人是朋友时他们的项链必须至少有一个颜色相同的珠子，两个人是敌人时他们的项链必须没有颜色相同的珠子，判断这n种珠子是否能满足条件 Input 多组用例，每组用例输入两个整数m和n分别表示人数和珠子种类数，以文件尾结束输入(m,n<2^31) Out
POJ 3119 Friends or Enemies? 笔记

hdu 5874 Friends and Enemies(思维）
On an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two dwarves on the island ar