Codeforces 870A. Search for Pretty Int
来源:互联网 发布:php个人管理系统 编辑:程序博客网 时间:2024/06/10 23:39
题目大意:给你n个数字和m个数字,如果两个数组中存在相同的数字,就输出这个数字,若没有,就输出两个数组中的最小的数字的组合起来的数
#include<bits/stdc++.h>using namespace std;bool book[10];int numa[10];int numb[10];int main(){int n,m;while(cin>>n>>m){for(int i=0;i<n;i++){scanf("%d",&numa[i]);book[numa[i]]=true;}for(int i=0;i<m;i++){scanf("%d",&numb[i]);}sort(numa,numa+n);sort(numb,numb+m);for(int i=0;i<m;i++){if(book[numb[i]]){cout<<numb[i]<<endl;return 0;}}cout<<min(numa[0],numb[0])<<max(numa[0],numb[0])<<endl;}}
阅读全文
0 0
- Codeforces 870A. Search for Pretty Int
- Codeforces 872 A Search for Pretty Integers
- CodeForces 872A Search for Pretty Integers
- Codeforces Round #440 div2 A. Search for Pretty Integers
- Codeforces Round #440 A. Search for Pretty Integers
- A. Search for Pretty Integers
- codeforces Search for Pretty Integers(水)
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination) A. Search for Pretty Integers
- Codeforces Round #440 (Div. 2) Search for Pretty Integers
- Elimination Round 2-A. Search for Pretty Integers
- Search for a Range
- Search for a Range
- Search for a Range
- Search for a Range !!!
- Search for a Range
- Search for a Range
- Search For A Range
- Search for a Range
- js-如何在两个页面之间互相传递数据?
- POJ 3040 浅谈矩阵快速幂优化LogN斐波拉契函数求解
- VS2013 MFC中TeeChart控件画波形使用总结
- COMBO口—光电复用
- RecyclerView 多条目(适配器)
- Codeforces 870A. Search for Pretty Int
- 十月十五日总结
- shell中continue和break区别
- CSS3选择器、CSS3圆角
- 链表的面试题(二)
- c/c++ #define const enum浅析
- 一款发帖软件的逆向分析(C#)
- android 常用权限和依赖
- mui介绍