首页 > 代码库 > Reduced ID Numbers (memset 的关键用处)
Reduced ID Numbers (memset 的关键用处)
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 题目大意: 对给出的几组数据对一个相同的数m取模,是余数不同。。。。。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn=1000000+5; int a[305]; int b[maxn]; int main() { int n,i; cin>>n; while(n--) { int t; cin>>t; for(i=0;i<t;i++) scanf("%d",&a[i]); if(t==1) printf("1\n"); else { for(i=2;;i++) { bool flag=0; memset(b,0,sizeof(int)*(i+1)); //关键用处,否则TLE到死。。。 for(int j=0;j<t;j++) { b[a[j]%i]++; if(b[a[j]%i]==2) { flag=1; break;} } if(flag==0) break; } cout<<i<<endl; } } return 0; }
Reduced ID Numbers (memset 的关键用处)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。