codeforeces Round #441B
来源:互联网 发布:小红书是什么软件 编辑:程序博客网 时间:2024/06/11 05:06
input
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.
给你n个数,要求从中选出k个,任意两数之间差模m为0
记录模m余数为i的数个数为f[i]
查找到第一个f[i]=k即可,题目只要求输出任意一组解
#include<cstdio>using namespace std;int n,k,m,a[100001],f[100001];int main(){scanf("%d%d%d",&n,&k,&m);int t=-1;for (int i=1;i<=n;i++){scanf("%d",&a[i]);int x=a[i];x%=m;f[x]++;}for (int i=0;i<m;i++)if (f[i]>=k) {printf("Yes\n");t=i;break;}if (t!=-1) for (int i=1;i<=n&&k>0;i++)if (a[i]%m==t) {k--;printf("%d ",a[i]);}if (t==-1) printf("No");return 0;}
- codeforeces Round #441B
- codeforeces 239B
- Codeforeces
- Codeforeces 501B map的入门
- Codeforeces Round #226 (Div. 2) E---Bear in the Field(矩阵快速幂)
- Codeforeces 703B Mishka and trip(路径权值的计算)
- Codeforces Round #441 Div. 2 B
- Codeforces Round #441 B.Divisiblity of Differences
- codeforces round #441 B. Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- Codeforces Round #441A+B+C
- Codeforces (441B) Round #252 (Div. 2) B题
- Codeforces Round #136 B
- Round 3B
- Round #1 B. Spreadsheets
- round 172Div1 B
- Round #5 Problem B
- C++宽字符处理函数 与 普通函数 对照表
- swiper控件loop循环后,不能点击的上一个组的bug
- 将Matisse进程化
- Mysql5.7.20压缩版下载和安装
- 关于网站发布的一些问题
- codeforeces Round #441B
- java 从键盘输入n个数,升序输出
- SSH框架文件上传+下载
- hibernate多对多关系操作
- Andrew NG 机器学习 笔记-week6-应用机器学习的建议 ( Advice for Applying Machine Learning)
- SDE连接,创建数据集,数据导入以及数据导出
- 二叉树的创建及前序、中序、后序、层序遍历
- properties文件读取工具类
- 解码Base64并展示图片