Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) A-C题解

A. Search for Pretty Integers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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?

Input

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.

Output

Print the smallest pretty integer.

Examples

input

2 3
4 2
5 7 6

output

25

input

8 8
1 2 3 4 5 6 7 8
8 7 6 5 4 3 2 1

output

1

Note

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<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<set>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))

using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=105;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll inv(ll b){if(b==1)return 1; return (mod-mod/b)*inv(mod%b)%mod;}
ll fpow(ll n,ll k){ll r=1;for(;k;k>>=1){if(k&1)r=r*n%mod;n=n*n%mod;}return r;}

int main()
{
	int a[10],b[10],visita[10],visitb[10];
	int i,j,k,n,m;
	while(cin>>m>>n)
	{
		mset(visita,0);
		mset(visitb,0);
		for(i=0;i<m;i++)
		{
			cin>>a[i];
			visita[a[i]]=1;
		}
		for(j=0;j<n;j++)
		{
			cin>>b[j];
			visitb[b[j]]=1;
		}
		int flag=0,temp;
		for(i=0;i<10;i++)
		if(visita[i]&&visitb[i])
		{
			flag=1;
			temp=i;
			break;
		}
		
		if(flag)
		{
			cout<<temp<<endl;
		}
		else
		{
			sort(a,a+m);
			sort(b,b+n);
			if(a[0]>b[0])
			swap(a[0],b[0]);
			cout<<a[0]<<b[0]<<endl;
		}
	}
	return 0;
}

B. Maximum of Maximums of Minimums

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into exactly k non-empty subsegments. You'll then compute the minimum integer on each subsegment, and take the maximum integer over the k obtained minimums. What is the maximum possible integer you can get?

Definitions of subsegment and array splitting are given in notes.

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤  105) — the size of the array a and the number of subsegments you have to split the array to.

The second line contains n integers a1,  a2,  ...,  an ( - 109  ≤  ai ≤  109).

Output

Print single integer — the maximum possible integer you can get if you split the array into k non-empty subsegments and take maximum of minimums on the subsegments.

Examples

input

5 2
1 2 3 4 5

output

5

input

5 1
-4 -5 -3 -2 -1

output

-5

Note

A subsegment [l,  r] (l ≤ r) of array a is the sequence al,  al + 1,  ...,  ar.

Splitting of array a of n elements into k subsegments [l1, r1], [l2, r2], ..., [lk, rk] (l1 = 1, rk = n, li = ri - 1 + 1 for all i > 1) is ksequences (al1, ..., ar1), ..., (alk, ..., ark).

In the first example you should split the array into subsegments [1, 4] and [5, 5] that results in sequences (1, 2, 3, 4) and (5). The minimums are min(1, 2, 3, 4) = 1 and min(5) = 5. The resulting maximum is max(1, 5) = 5. It is obvious that you can't reach greater result.

In the second example the only option you have is to split the array into one subsegment [1, 5], that results in one sequence( - 4,  - 5,  - 3,  - 2,  - 1). The only minimum is min( - 4,  - 5,  - 3,  - 2,  - 1) =  - 5. The resulting maximum is  - 5.

给定n个数，有k个划分，保证每个划分中的最小数的最大数最大。

真的是很简单，k==1的话输出最小值，k>=3的话输出最大值，k==2的话输出两侧端点的最大值。

代码实现：

#include<iostream> 
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<set>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))

using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=105;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll inv(ll b){if(b==1)return 1; return (mod-mod/b)*inv(mod%b)%mod;}
ll fpow(ll n,ll k){ll r=1;for(;k;k>>=1){if(k&1)r=r*n%mod;n=n*n%mod;}return r;}
ll map[100005];

int main()
{
	ll n,i,j,k,x;
	while(cin>>n>>k)
	{
		ll maxx=-inf,minn=inf,tempi,tempj;
		for(i=0;i<n;i++)
		{
			cin>>map[i];
			if(maxx<map[i])
			{
				maxx=map[i];
				tempi=i;
			}
			if(minn>map[i])
			{
				minn=map[i];
				tempj=i;
			}
		}
		ll xx=inf,yy=inf;
		if(k>=3)
		cout<<maxx<<endl;
		else if(k==1)
		cout<<minn<<endl;
		else
		{
			ll ans=max(map[0],map[n-1]);
			cout<<ans<<endl;
		}
	}
	return 0;
}

C. Maximum splitting

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings.

An integer greater than 1 is composite, if it is not prime, i.e. if it has positive divisors not equal to 1 and the integer itself.

Input

The first line contains single integer q (1 ≤ q ≤ 105) — the number of queries.

q lines follow. The (i + 1)-th line contains single integer ni (1 ≤ ni ≤ 109) — the i-th query.

Output

For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.

Examples

input

1
12

output

3

input

2
6
8

output

1
2

input

3
1
2
3

output

-1
-1
-1

Note

12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands.

8 = 4 + 4, 6 can't be split into several composite summands.

1, 2, 3 are less than any composite number, so they do not have valid splittings.

输入n，输出最多能有几个合数相加值等于n，若没有输出0.

打表找规律。

代码实现：

#include<iostream> 
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<set>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))

using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=105;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll inv(ll b){if(b==1)return 1; return (mod-mod/b)*inv(mod%b)%mod;}
ll fpow(ll n,ll k){ll r=1;for(;k;k>>=1){if(k&1)r=r*n%mod;n=n*n%mod;}return r;}

int main()
{
	int q,n;
	cin>>q;
	while(q--)
	{
		scanf("%d",&n);
		if(n<3) 
		cout<<"-1"<<endl;
		else if(n==5) 
		cout<<"-1"<<endl;
		else if(n%4==1) 
		cout<<n/4-1<<endl;
		else if(n%4==0) 
		cout<<n/4<<endl;
		else if(n%4==2) 
		cout<<n/4<<endl;
		else if(n==7||n==11) 
		cout<<"-1"<<endl;
		else 
		cout<<n/4-1<<endl;
	}
	return 0;
}