poj 2769 Reduced ID Numbers (同余定理)
来源:互联网 发布:安装网络打印机 编辑:程序博客网 时间:2024/05/26 05:53
Reduced ID Numbers
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10341 Accepted: 4114
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
Source
Northwestern Europe 2005
#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int f[305];int vis[100001];int main(){ int T; int n; int i,j; scanf("%d",&T); while(T--) { scanf("%d",&n); for( i=0;i<n;i++) scanf("%d",&f[i]); for( i=n;;i++) { memset(vis,0,sizeof(vis)); for( j=0;j<n;j++) { if(vis[f[j]%i]) { //find=0; break; } vis[f[j]%i]=1; } if(j>=n)break; } printf("%d\n",i); } 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
- POJ 1068:Parencodings(模拟)
- HDFS的java操作
- GigE Vision简介
- I NEED A OFFER! HDU 1203
- @Async异步注解
- poj 2769 Reduced ID Numbers (同余定理)
- CSS核心属性
- 20170802题目
- 关于Spring中的<context:annotation-config/>配置
- [__NSCFConstantString size]: unrecognized selector sent to instance 错误
- C语言基础(六)指针和多维数组
- STL vector
- 定时任务--在Spring 中配置Quartz
- Flask之Helpers