codeforces round #441 B. Divisiblity of Differences(数学)

time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.

Numbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.

Input
First line contains three integers n, k and m (2 ≤ k ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000) — number of integers in the multiset, number of integers you should select and the required divisor of any pair of selected integers.

Second line contains n integers a1, a2, …, an (0 ≤ ai ≤ 109) — the numbers in the multiset.

Output
If it is not possible to select k numbers in the desired way, output «No» (without the quotes).

Otherwise, in the first line of output print «Yes» (without the quotes). In the second line print k integers b1, b2, …, bk — the selected numbers. If there are multiple possible solutions, print any of them.

Examples
input
3 2 3
1 8 4
output
Yes
1 4
input
3 3 3
1 8 4
output
No
input
4 3 5
2 7 7 7
output
Yes
2 7 7
**这道题刚开始想的是一个nlogn的算法，就是记录数字出现的次数之后去重，进行一个小于nlogn的循环，但结果却是超时了。
正解：如果两个数对m取余之后相等的话，那么这两个数一定相差m的倍数；所以确定m之内每个余数的个数之后找到符合条件的遍历输出即可。
代码：**

#include <bits/stdc++.h>  
using namespace std;  

const int maxn = 1e5 + 10;  
int k,n,m,a[maxn],vis[maxn];  

int main(){  
    while(~scanf("%d%d%d",&n,&k,&m)){  
        memset(vis,0,sizeof(vis));  
        for(int i = 0; i < n; i ++) scanf("%d",&a[i]), vis[a[i] % m] ++;  
        int flag = 0;  
        for(int i = 0; i < m; i ++){  
            if(vis[i] >= k){  
                printf("Yes\n");  
                flag = 1;  
                int sum = 0;  
                for(int j = 0; j < n; j ++){  
                    if(sum >= k) break;  
                    if(a[j] % m == i){  
                        if(sum) printf(" %d",a[j]);  
                        else printf("%d",a[j]);  
                        sum ++;  
                    }  
                }  
                printf("\n");  
            }  
            if(flag) break;  
        }  
        if(!flag) printf("No\n");  
    }  
    return 0;  
}