POJ 2769 Reduced ID Numbers
2014-11-08 17:39
302 查看
/* 用visited数组来判断是否同余,每次计算完要记得重置,重置时不能用memset,会超时 因为n<300,可以考虑建一个索引数组set,每次记录位置 */ #include<stdio.h> #include<string> #define N 1000005 int a[305]; int visited ; int set[305]; int n,m; void clear() { int i; for(i=0;i<=n;i++) { visited[set[i]]=0; } } void solve() { int i,j; int post=1; for(i=n;;i++) { clear(); post=1; int num=0; for(j=0;j<n;j++) { int x=a[j]%i; if (!visited[x]) { set[num++]=x; visited[x]=1; } else { post=0; break; } } if (post) break; } printf("%d\n",i); } int main() { #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif int T; int i,j; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } solve(); } return 0; }
相关文章推荐
- POJ 2769 Reduced ID Numbers 解题报告
- poj 2769 Reduced ID Numbers
- POJ 2769 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(memset使用技巧)
- 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
- poj 2769 Reduced ID Numbers(memset使用技巧)
- POJ 2769 Reduced ID Numbers
- POJ2769 Reduced ID Numbers
- Poj 2769 Reduced ID Numbers
- POJ 2769 Reduced ID Numbers 同余定理(暴力)
- POJ2769 Reduced ID Numbers【同余定理】
- POJ 2769 Reduced ID Numbers
- poj 2769 Reduced ID Numbers (同余定理)