codeforces 876B Divisiblity of Differences
来源:互联网 发布:淘宝支付宝登陆界面 编辑:程序博客网 时间:2024/05/21 17:42
http://codeforces.com/problemset/problem/876/B
给出一串数,找出k个数,这k个数之间两两相减的差必须都要对m取余为0。
关键点就是,这样的k个数每个对m取余的结果都相同,根据这个点就好做了。
#include<bits/stdc++.h>using namespace std;int main(){int n,k,m; while(cin>>n>>k>>m) { int nu[111111]; int a[111111]; int i; memset(nu,0,sizeof(nu)); for(i=0;i<n;i++) {scanf("%d",&a[i]); nu[a[i]%m]++; } int s; int ma=-1; for(i=0;i<m;i++) { if(nu[i]>ma) { ma=nu[i]; s=i; } } int js=0; int q=0; if(ma<k){ cout<<"No"<<endl; continue; }cout<<"Yes"<<endl; for(i=0;i<n;i++) { if(js==k)break; if(a[i]%m==s) { if(q++)cout<<" "; cout<<a[i]; js++; } } cout<<endl; }return 0;}
阅读全文
0 0
- Codeforces 876B. Divisiblity of Differences
- Codeforces 876 B Divisiblity of Differences
- CodeForces 876B Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences
- codeforces 876B Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences 题解
- CodeForces-876B Divisiblity of Differences
- Codeforces-876B-Divisiblity of Differences(取模)
- Codeforces 876 B Divisiblity of Differences 基础数学
- CodeForces 876B 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 #441 B. Divisiblity of Differences
- - Divisiblity of Differences CodeForces
- Codeforces Round #441 Div 2 B. Divisiblity of Differences
- Codeforces Round #441 div2 B. Divisiblity of Differences
- CF B. Divisiblity of Differences【water+WA9】
- 二叉树的基本概念
- 运维之系统服务篇------ RAID磁盘阵列 、 进程管理 、 日志管理 、 systemctl控制
- 201710211100->AsyncDownloadTexture
- 给定一个排序的链表,删除所有具有重复数字的节点,从原始列表中只留下不同的数字。
- C++学习笔记——C语言中的fgets()函数
- codeforces 876B Divisiblity of Differences
- 干货 | 【深度学习】 在 【推荐算法】 上的应用研究进展
- Rhyme/ Java IO流关闭工具类
- Deep learning
- codeforces 876C Classroom Watch
- 存储过程学习
- 在分类中如何处理训练集中不平衡问题
- ubuntu17.10<apt-get出现Unable to connect to 127.0.0.1:8888>
- 51nod 1244 莫比乌斯函数之和