POJ2769同余问题

最新推荐文章于 2020-10-03 16:46:38 发布

situliang

最新推荐文章于 2020-10-03 16:46:38 发布

阅读量638

点赞数

分类专栏： ACM训练文章标签： poj2769 同余定理同余同余问题 poj2769超时

本文链接：https://blog.csdn.net/situliang/article/details/74019011

版权

该博客讨论了如何解决POJ2769问题，即在大学中为每个学生群体找到最小正整数m，使得学生证号（SIN）对m取模后各不相同。博主提供了输入输出示例，并分析了解题思路，涉及同余定理的应用。

摘要由CSDN通过智能技术生成

题目地址:http://poj.org/problem?id=2769

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.