- Divisiblity of Differences CodeForces
来源:互联网 发布:英语选择题答案软件 编辑:程序博客网 时间:2024/05/22 10:55
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.
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.
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.
3 2 31 8 4
Yes1 4
3 3 31 8 4
No
4 3 52 7 7 7
Yes2 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;}
- - Divisiblity of Differences CodeForces
- Codeforces 876B. Divisiblity of Differences
- Codeforces Round #441 B.Divisiblity of Differences
- Codeforces 876 B Divisiblity of Differences
- codeforces round #441 B. Divisiblity of Differences
- CodeForces 876B Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- codeforces 876B Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences 题解
- CodeForces-876B Divisiblity of Differences
- codeforces876B Divisiblity of Differences
- Codeforces876B-Divisiblity of Differences
- Codeforces Round #441 Div 2 B. Divisiblity of Differences
- Codeforces-876B-Divisiblity of Differences(取模)
- Codeforces Round #441 div2 B. Divisiblity of Differences
- Codeforces 876 B Divisiblity of Differences 基础数学
- java 二分查找
- B
- 表格 Css
- 数据结构之顺序表
- 区块链记账原理
- - Divisiblity of Differences CodeForces
- hessian入门案例(一)
- 集成学习
- 报数
- UVA
- Javascript中,有一个函数,执行时对象查找时,永远不会去查找原型,这个函数是?
- 浅谈数据抓取的几种方法
- java虚拟机内存详解
- C++拷贝构造函数