[USACO 2010 Feb B]Scavenger Hunt
题号:NC24719
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

Farmer John has scattered treats for Bessie at special places in the pasture. Since everyone knows that smart cows make tasty milk, FJ has placed the treats at locations that require Bessie to think.
He has given her two numbers, P and Q (1 <= P <= 6,000; 1 <= Q <= 6,000), and she has to check every point in the pasture whose x-coordinate is a factor of P and whose y-coordinate is a factor of Q to find her treat.
Suppose FJ gives Bessie P = 24 and Q = 2. Here are all of their respective factors:
P = 24 => 1, 2, 3, 4, 6, 8, 12, 24
Q = 2 => 1, 2
Bessie would thus check grid locations: (1, 1), (1, 2), (2, 1), (2, 2), (3, 1)..
Help Bessie by printing all of the points she ought to check.

输入描述:

* Line 1: Two space separated integers: P and Q

输出描述:

* Lines 1..?: A complete list of unique pairs of space-separated integers sorted by the first number and, if tied, the second number: a factor of P followed by a factor of Q
示例1

输入

复制
24 2

输出

复制
1 1
1 2
2 1
2 2
3 1
3 2
4 1
4 2
6 1
6 2
8 1
8 2
12 1
12 2
24 1
24 2