- Divisiblity of Differences CodeForces - 876B
2017-11-01 21:13
357 查看
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.InputFirst 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.OutputIf 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.ExampleInput
3 2 3 1 8 4Output
Yes 1 4Input
3 3 3 1 8 4Output
NoInput
4 3 5 2 7 7 7Output
Yes 2 7 7
题意:给你n k m三个整数,再接着为n个整数,问在n中是否含有k个数,他们两两
之间相差为m的倍数,
思路:思路难想,之前用map做,做了半天没写出来,看了学长的代码才想到,我们
可以直接对数据取余,标记出现的次数,代码很简单,一看就会明白。
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int num[110000];int book[110000];int main(){int n,k,m;while(~scanf("%d %d %d",&n,&k,&m)){memset(book,0,sizeof(book));int x,flag=0;for(int i=0; i<n; i++){scanf("%d",&num[i]);int t=num[i]%m;book[t]++;if(book[t]>=k){x=t;flag=1;}}if(flag){int term=0;printf("Yes\n");for(int i=0; i<n&&term<k; i++)if(num[i]%m==x){if(term==0)printf("%d",num[i]);else printf(" %d",num[i]);term++;}printf("\n");}else printf("No\n");}return 0;}
相关文章推荐
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- Codeforces Round #277 (Div. 2) E. LIS of Sequence
- codeforces C. Devu and Partitioning of the Array
- codeforces C. An impassioned circulation of affection
- codeforces A. Parliament of Berland【水】
- codeforces Minimum number of steps 思维
- Codeforces Round #399 E Game of Stones 博弈
- Codeforces Round #302 (Div. 2) A. Set of Strings
- Educational Codeforces Round 11 D. Number of Parallelograms 【pair的使用】
- Codeforces Round #342 (Div. 2) B. War of the Corporations 贪心
- A - Union of Doubly Linked Lists CodeForces - 847A(并查集)
- Ccodeforces 27E Number With The Given Amount Of Divisors(数论+搜索)
- Educational Codeforces Round 5 E. Sum of Remainders 数论
- [杂题] Codeforces Gym 101190 NEERC 16 L. List of Primes
- codeforces gym 2016-2017 NEERC, Moscow Subregional K. Knights of the Old Republic 最小生成树+dp
- Educational Codeforces Round 21 G. Anthem of Berland(dp+kmp)
- Codeforces Round #277.5 (Div. 2)——C贪心—— Given Length and Sum of Digits
- Codeforces Round #105 (Div. 2) D. Bag of mice
- Codeforces Codeforces Round #432 (Div. 2 D ) Arpa and a list of numbers
- Codeforces Round #399 E Game of Stones 博弈