Codeforces Round #440 div2 A. Search for Pretty Integers
来源:互联网 发布:税收数据质量管理 编辑:程序博客网 时间:2024/05/19 14:40
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.
题意 输入n,m,接下来两行为两个序列,如果两个序列中有相同的输出相同的最小的那个数,如果没有就从两个序列中分别取出一个数,输出这两个数组成的最小两位数。
桶排序就好
#include <cstdio>#include <cstring>#include <string>#include <iostream>#include <algorithm>#include <set>#include <stack>#include <queue>#include <vector>#include <cmath>using namespace std;#define ll long long #define mem(a, b) memset(a, b, sizeof(a))#define inf 0x3f3f3f3f#define mod 10000000007#define Maxn 10000005#define debug() puts("F*** you every!");int main(){int n, m, a[50], b[50], w;mem(a, 0);mem(b, 0);scanf("%d%d", &n, &m);for (int i = 0; i < n; i ++) {scanf("%d", &w);a[w]++;}for (int i = 0; i < m; i++) {scanf("%d", &w);b[w]++;}int flag = 0;for (int i = 1; i < 10; i ++) {if (a[i] != 0 && b[i] != 0){printf("%d\n", i);flag = 1;break;}}int s1, s2;if (flag == 0) {for (int i = 0; i < 10; i ++) { if (a[i] != 0) {s1 = i;break;}}for (int i = 0; i < 10; i ++) { if (b[i] != 0) {s2 = i;break;}}printf("%d%d\n", s1 > s2 ? s2 : s1, s1 <= s2 ? s2 : s1);}}
- 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
- Codeforces Round #441 div2 A. Trip For Meal
- codeforces div2 round#231 A
- codeforces div2 round#230 A
- codeforces Round 411 div2 A
- Codeforces Round #376A (div2)
- Codeforces Round #440(div2)
- codeforces Round #237(div2) A解题报告
- codeforces Round #238(div2) A解题报告
- OkHttp请求
- BP神经网络的matlab实现
- 表单验证
- 10.15PCA
- angularjs 初使用2
- Codeforces Round #440 div2 A. Search for Pretty Integers
- 【数论】[HNOI2006]鬼谷子的钱袋
- angularjs $http请求--图书
- Codeforces Round #440 (Div. 1) B. Something with XOR Query
- angular制作购物车
- RecyclerView
- 购物车综合练习题angular js
- HDU 5943 Kingdom of Obsession(二分图匹配+数论)
- 原购物车只有删除和查询