同余--基于题目的学习

参考资料：https://blog.csdn.net/

题目一：

Reduced ID Numbers Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10959   Accepted: 4329 Description T. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106-1. T. Chur finds this range of SINs too large for identification within her groups. For each group, she wants to find the smallest positive integer m, such that within the group all SINs reduced modulo m are unique. Input On the first line of the input is a single positive integer N, telling the number of test cases (groups) to follow. Each case starts with one line containing the integer G (1 ≤ G ≤ 300): the number of students in the group. The following G lines each contain one SIN. The SINs within a group are distinct, though not necessarily sorted. Output For each test case, output one line containing the smallest modulus m, such that all SINs reduced modulo m are distinct. Sample Input 2 1 124866 3 124866 111111 987651 Sample Output 1 8 Source