Codeforces Round #440 A. Search for Pretty Integers
来源:互联网 发布:网络数据传输结构 编辑:程序博客网 时间:2024/06/10 22:48
You are given two lists of non-zero digits.
Let's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?
The first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.
The second line contains n distinct digits a1, a2, ..., an (1 ≤ ai ≤ 9) — the elements of the first list.
The third line contains m distinct digits b1, b2, ..., bm (1 ≤ bi ≤ 9) — the elements of the second list.
Print the smallest pretty integer.
2 34 25 7 6
25
8 81 2 3 4 5 6 7 88 7 6 5 4 3 2 1
1
In the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.
In the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.
水题,找最小的数要么在两个数组里头出现过,要么由两个数组中的数组成
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>using namespace std;int a[15],b[15];long long ff(long long q1,long long q2){ int s=0; long long t=q2; while(t) { t=t/10; s++; } return q1*((long long)(pow(10,s)))+q2;}int main() { int x,y; cin>>x>>y; for (int i=1; i<=x; i++) { cin>>a[i]; } for (int i=1; i<=y; i++) { cin>>b[i]; } sort(a+1, a+x+1); sort(b+1, b+y+1); bool f=false; long long t=1e9+7; for(int i=1;i<=x;i++) { for (int j=1; j<=y; j++) { if(a[i]==b[j]) { f=true; t=a[i]; break; } } if(f) break; } t=min(t,min(ff(a[1],b[1]),ff(b[1],a[1]))); cout<<t<<endl; // insert code here... //std::cout << "Hello, World!\n"; return 0;}
- Codeforces Round #440 div2 A. Search for Pretty Integers
- Codeforces Round #440 A. Search for Pretty Integers
- Codeforces Round #440 (Div. 2) Search for Pretty Integers
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination) A. Search for Pretty Integers
- Codeforces 872 A Search for Pretty Integers
- CodeForces 872A Search for Pretty Integers
- A. Search for Pretty Integers
- Elimination Round 2-A. Search for Pretty Integers
- codeforces Search for Pretty Integers(水)
- Codeforces 870A. Search for Pretty Int
- Educational Codeforces Round 5 A. Comparing Two Long Integers
- Codeforces Round #441 A. Trip For Meal
- [LeetCode] Search for a Range (sorted integers array,find start & end position of a target number)
- 【水题】Codeforces Round #289 509E Pretty Song
- Codeforces Round #422 D. My pretty girl Noora (数论)
- 【Codeforces Round #422 (Div. 2) D】My pretty girl Noora
- Educational Codeforces Round 5-A. Comparing Two Long Integers(模拟)
- Educational Codeforces Round 5 A. Comparing Two Long Integers (水)
- 第八周(1) 项目5
- 第880期机器学习日报(2017-02-14)
- 第890期机器学习日报(2017-02-24)
- 第889期机器学习日报(2017-02-23)
- Task原理剖析
- Codeforces Round #440 A. Search for Pretty Integers
- 使用 Docker 一步搞定 ZooKeeper 集群的搭建
- Java开发代码规范之编程规约(八)——并发处理
- Struct和Union的区别
- 第8周【项目1
- 第7周项目3- 负数把正数赶出队列
- Java计算器代码
- 第四周项目1-建立单链表
- 欢迎使用CSDN-markdown编辑器