hihocoder-1186-求约数

1.题目

#1186 : Coordinates

时间限制: 10000ms

单点时限: 1000ms

内存限制: 256MB

描述

Give you two integers P and Q. Let all divisors of P be X-coordinates. Let all divisors of Q be Y-coordinates.

For example, when P=6 and Q=2, we can get the coordinates (1,1) (1,2) (2,1) (2,2) (3,1) (3,2) (6,1) (6,2).

You should print all possible coordinates in the order which is first sorted by X-coordinate when coincides, sorted by Y-coordinate.

输入

One line with two integers P and Q(1 <= P, Q <= 10000).

输出

The output may contains several lines , each line with two integers X_i and Y_i, denoting the coordinates.

样例输入

6 2

样例输出

1 1
1 2
2 1
2 2
3 1
3 2
6 1
6 2

2.分析

水题，求出P的约数列表pList，求Q的约数列表qList，两两搭配即可。

注意约数列表从小到大排列，不能重复。

3.代码