shunfurh
编程介的小学生
2019-08-16 22:18
采纳率: 92.7%
浏览 82

Everlasting L怎么用C语言来实现

Problem Description
Matt loves letter L.

A point set P is (a, b)-L if and only if there exists x, y satisfying:

P = {(x, y), (x + 1, y), . . . , (x + a, y), (x, y + 1), . . . , (x, y + b)}(a, b ≥ 1)

A point set Q is good if and only if Q is an (a, b)-L set and gcd(a, b) = 1.

Matt is given a point set S. Please help him find the number of ordered pairs of sets (A, B) such that:

Input
The first line contains only one integer T , which indicates the number of test cases.

For each test case, the first line contains an integer N (0 ≤ N ≤ 40000), indicating the size of the point set S.

Each of the following N lines contains two integers xi, yi, indicating the i-th point in S (1 ≤ xi, yi ≤ 200). It’s guaranteed that all (xi, yi) would be distinct.

Output
For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y is the number of pairs.

Sample Input
2
6
1 1
1 2
2 1
3 3
3 4
4 3
9
1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2
3 3

Sample Output
Case #1: 2
Case #2: 6

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 邀请回答

相关推荐