sicily 1190. Reduced ID Numbers

原创 2015年11月19日 17:11:16

1190. Reduced ID Numbers

Constraints

Time Limit: 2 secs, Memory Limit: 32 MB

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

题目分析

求一个数,使给定的数模它结果不同
暴力枚举,时间给了两秒


#include <iostream>
#include <map>

int id[301];
int count;

bool check(int k) {
  std::map<int, int> m;
  for (int i = 0; i < count; ++i) {
    int temp = id[i] % k;
    if (m[temp] == 0)
      m[temp] = 1;
    else
      return false;
  }
  return true;
}


int main()
{
  int test;
  std::cin >> test;
  while (test--) {
    std::cin >> count;
    for (int i = 0; i < count; ++i)
      std::cin >> id[i];
    int ans;
    for (ans = 1; !check(ans); ++ans);
    std::cout << ans << std::endl;
  }  
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

[POJ2769] Reduced ID Numbers

题目描述T.Chur在大学里教授不同群体的学生,每个学生都有一个独特的学生证号码(SIN),是0~10^6范围内的整数。但T.Chur觉得SIN的范围太大以至于不便于确定每个学生,故希望在每个组里都能...

POJ 2769 Reduced ID Numbers 同余定理

Reduced ID Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8989 ...

解题报告 之 POJ2769 Reduced ID Numbers

POJ2769 ,Reduced ID Numbers,数论,同余,ACM T. Chur teaches various groups of students at university U. E...
  • maxichu
  • maxichu
  • 2015年05月11日 12:18
  • 559

TOJ 2353.Reduced ID Numbers

题目链接:http://acm.tju.edu.cn/toj/showp2353.html 2353.   Reduced ID Numbers Time Limit: 1...

POJ 2769 Reduced ID Numbers [同余]【数论】

题目连接:http://poj.org/problem?id=2769 ——————————-. Reduced ID Numbers Time Limit: 2000MS Memor...

Reduced ID Numbers(POJ 2769)

题目:
  • npufz
  • npufz
  • 2014年08月22日 15:37
  • 214

Poj 2769 Reduced ID Number

Reduced ID Numbers Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 7882...

sicily 1050.Numbers & Letters

1050. Numbers & Letters Constraints Time Limit: 3 secs, Memory Limit: 32 MB Description ...

Sicily 1050. Numbers & Letters

Description In the early 80’s, a popular TV show on Dutch television was ‘Cijfers en Letters’ (Nu...

sicily1050-Numbers & Letters

#include #include using namespace std; int num[5]; int target; int finalres; bool get; void dfs(...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:sicily 1190. Reduced ID Numbers
举报原因:
原因补充:

(最多只允许输入30个字)