题目:http://soj.me/1190
本题时间很多,所以各种方法都是可以爆出来的。只是在这里记录下“同余”的概念。而这道题是求不是所有数字的同余的最小数字。
(同余:数学上,两个整数除以同一个整数,若得相同余数,则二整数同余。
http://baike.baidu.com/view/79282.htm)
1190代码如下:
// Problem#: 1190
// Submission#: 2182279
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
/*
* ICPC.cpp
*
* Created on: 2013-7-3
* Author: Administrator
*/
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int i,number,temp;
int stu_num;
int case_num;
scanf("%d", &case_num);
while(case_num--)
{
scanf("%d", &stu_num);
int a[stu_num],b[stu_num];
for(i = 0; i < stu_num; i++)
scanf("%d", &a[i]);
if(stu_num == 1)
cout << "1" << endl;
else
{
number = 1;
while(number++)
{
for(i = 0; i < stu_num; i++)
b[i] = a[i] % number;
sort(b,b+stu_num);
temp = 0;
for(i = 1; i < stu_num; i++)
{
if(b[i] == b[i-1])
{
temp = 1;
break;
}
}
if(temp == 1)
{
continue;
}
else
{
cout << number << endl;
break;
}
}
}
}
return 0;
}