2 人解决，13 人已尝试。
2 份提交通过，共有 55 份提交。
9.8 EMB 奖励。
单点时限: 15.0 sec
内存限制: 256 MB
You start with a sequence of consecutive integers. You want to group them into sets.
You are given the interval, and an integer
Then you consider each pair of integers in the interval. If the two integers share a prime factor which is at least
How many different sets there will be at the end of this process?
One line containing an integer C, the number of test cases in the input file.
For each test case, there will be one line containing three single-space-separated integers
For each test case, output one line containing the string Case #X: Y where
2 10 20 5 10 20 3
Case #1: 9 Case #2: 7
2 人解决，13 人已尝试。
2 份提交通过，共有 55 份提交。
9.8 EMB 奖励。