codeforce_876B_ B - Divisiblity of Differences

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.

Sample Input
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
题意 给你n个数，从中挑选出来k个数满足任意两数差能被m除；
输出这些数；
解；直接找出所组模数相同的

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

const int N=(int)1e5+10;
int main()
{
    int n,k,m,num[N],i,j,ans[N];
    while(cin>>n>>k>>m)
    {
        int stu[N]= {0},f=0,pos;
        for(i=0; i<n; i++)
        {
            scanf("%d",&num[i]);
            int t=num[i]%m;
            stu[t]++;
            if(stu[t]>=k)
            {
                f=1;
                pos=t;
            }
        }
        if(f)
        {
            puts("Yes");
            int cnt=0;
            for(i=0;i<n;i++)
            {
                if(num[i]%m==pos)
                {
                    ans[cnt++]=num[i];
                }
                if(cnt>=k)
                    break;
            }
            for(i=0;i<cnt;i++)
                printf("%d%c",ans[i],i==cnt-1?'\n':' ');
        }
        else
            puts("No");

    }
    return 0;
}