A. Search for Pretty Integers
来源:互联网 发布:知乎 中国到底有多强大 编辑:程序博客网 时间:2024/06/13 11:18
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<cstdio>#include<iostream>#include<string>#include<cstring>#include<cmath>using namespace std;int main(){int mas1[10];int mas2[10];int n, m, i, j, min = 100;scanf("%d %d", &n, &m);for (i = 0; i<n; i++) {scanf("%d", &mas1[i]);}for (i = 0; i<m; i++) {scanf("%d", &mas2[i]);}for (i = 0; i<n; i++) {for (j = 0; j<m; j++){if (mas1[i] == mas2[j] && mas1[i] < min){min = mas1[i];}if (mas1[i] > mas2[j] && (mas2[j] * 10 + mas1[i]) < min){min = (mas2[j] * 10 + mas1[i]);}if (mas1[i] < mas2[j] && (mas1[i] * 10 + mas2[j]) < min){min = (mas1[i] * 10 + mas2[j]);}}}printf("%d\n", min);return 0;}
- A. Search for Pretty Integers
- Codeforces 872 A Search for Pretty Integers
- CodeForces 872A Search for Pretty Integers
- Codeforces Round #440 div2 A. Search for Pretty Integers
- Elimination Round 2-A. Search for Pretty Integers
- Codeforces Round #440 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
- Codeforces 870A. Search for Pretty Int
- [LeetCode] Search for a Range (sorted integers array,find start & end position of a target number)
- 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
- 四周学会爬虫网课.第一周
- 【十五】机器学习之路——决策树(1)
- 多线程-ReentrantLock
- 欢迎使用CSDN-markdown编辑器
- 文章标题
- A. Search for Pretty Integers
- @RequestMapping 用法详解之地址映射(转)
- 利用pytorch实现Fooling Images(添加特定噪声到原始图像,使神经网络误识别)
- 设计模式之禅21
- 双链表--uva12657 Boxes in a Line 从入门到放弃
- 深入浅出的讲解傅里叶变换
- 今年海运快递丢货了吗 分享 给大家预防 (普宁跨境电商外贸 )
- css动画之过渡
- 异常处理