POJ 2769 Reduced ID Numbers 同余定理
来源:互联网 发布:windows无法访问xp 编辑:程序博客网 时间:2024/05/19 04:27
Reduced ID Numbers
Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8989Accepted: 3610
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
211248663124866111111987651
Sample Output
18
这道题是对同余定理的考查,思路很简单,暴力地枚举j,直到j满足集合中任意两个数对j取余都不相等,此时停止循环;
对于代码中的memset,比用for循环初始化为0快,只是在数组大的时候。在数组大小比较小时则for初始化比较省时(我在这超时了4、5次了)
一共是n个学生,所以去完模之后至少要有n个不同的值,所有程序里面的j要从n开始的。当然从1开始也不会错,只是一个小小的优化吧。
代码如下:
#include <stdio.h>#include <string.h>#include <math.h>int a[10000001];int main(){int i,j,n;int cas,ans,t;int s[303];int f;scanf("%d",&cas);while(cas--){scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&s[i]);for(j=n;j<1000000;j++){f=0;for(i=0;i<=j;i++)//这里用memset的话会超时的!a[i]=0;for(i=0;i<n;i++){if(a[s[i]%j]){f=1;break;}a[s[i]%j]=1;}if(!f)break;}printf("%d\n",j);}return 0;}
0 0
- POJ 2769 Reduced ID Numbers (同余定理)
- POJ 2769 Reduced ID Numbers 同余定理(暴力)
- POJ 2769 Reduced ID Numbers 同余定理
- poj 2769 Reduced ID Numbers (同余定理)
- POJ 2769 Reduced ID Numbers (同余)
- Reduced ID Numbers(poj2769同余定理)
- poj2769 Reduced ID Numbers 同余定理
- POJ2769 Reduced ID Numbers【同余定理】
- POJ Reduced ID Numbers 同余 暴力
- POJ 2769 Reduced ID Numbers [同余]【数论】
- 2769 Reduced ID Numbers 同余问题
- POJ2769 Reduced ID Numbers[同余]
- Reduced ID Numbers (同余)
- 同余定理:poj2769 Reduced ID Numbers(标记数组)+hdu1021 Fibonacci Again(应用于递推公式)
- poj 2769 Reduced ID Numbers
- Poj 2769 Reduced ID Numbers
- POJ 2769 Reduced ID Numbers
- POJ 2769 Reduced ID Numbers
- A* 寻路算法
- 编写acad.rx文件自动加载arx文件
- 二分图匹配KM算法 POJ2195
- vim设置
- Codeforces 478D Red-Green Towers dp
- POJ 2769 Reduced ID Numbers 同余定理
- 终端下的文本浏览器w3m
- 什么是显卡?为什么计算机要有显卡?
- UVA - 11054 Wine trading in Gergovia
- hdoj 1877 又一版 A+B
- HDU 1392 Surround the Trees(凸包周长)
- Mergesort
- 通讯录
- Hashmap 的实现原理