A - DZY Loves Hash
DZY has a hash table with p buckets, numbered from 0 to p - 1. He wants to insert nnumbers, in the order they are given, into the hash table. For the i-th number xi, DZY will put it into the bucket numbered h(xi), where h(x) is the hash function. In this problem we will assume, that h(x) = x mod p. Operation a mod b denotes taking a remainder after division a by b.
However, each bucket can contain no more than one element. If DZY wants to insert an number into a bucket which is already filled, we say a "conflict" happens. Suppose the first conflict happens right after the i-th insertion, you should output i. If no conflict happens, just output -1.
Input
The first line contains two integers, p and n (2 ≤ p, n ≤ 300). Then n lines follow. The i-th of them contains an integer xi (0 ≤ xi ≤ 109).
Output
Output a single integer — the answer to the problem.
Example
10 5
0
21
53
41
53
4
5 5
0
1
2
3
4
-1
题目的意思是,按顺序给出几个数,判断从哪个操作开始,hash值有重复.
题目很水,模拟一下就好了.
1 #include<cstdio>
2 #include<cstring>
3 #include<algorithm>
4 using namespace std;
5 bool vis[1000];
6 int main(){
7 int n,m;
8 scanf("%d%d",&m,&n);
9 for (int i=1; i<=n; i++){
10 int x; scanf("%d",&x);
11 x%=m; if (vis[x]){printf("%d",i); return 0;}
12 vis[x]=1;
13 }
14 puts("-1");
15 return 0;
16 }