【Codeforces Round 333 (Div 2)A 】【水题 简单进制模拟】Two Bases 不同进制数比大小

A. Two Bases

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

After seeing the "ALL YOUR BASE ARE BELONG TO US" meme for the first time, numbers X and Y realised that they have different bases, which complicated their relations.

You're given a number X represented in base b_x and a number Y represented in base b_y. Compare those two numbers.

Input

The first line of the input contains two space-separated integers n and b_x (1 ≤ n ≤ 10, 2 ≤ b_x ≤ 40), where n is the number of digits in the b_x-based representation of X.

The second line contains n space-separated integers x₁, x₂, ..., x_n (0 ≤ x_i < b_x) — the digits of X. They are given in the order from the most significant digit to the least significant one.

The following two lines describe Y in the same way: the third line contains two space-separated integers m and b_y (1 ≤ m ≤ 10,2 ≤ b_y ≤ 40, b_x ≠ b_y), where m is the number of digits in the b_y-based representation of Y, and the fourth line contains m space-separated integers y₁, y₂, ..., y_m (0 ≤ y_i < b_y) — the digits of Y.

There will be no leading zeroes. Both X and Y will be positive. All digits of both numbers are given in the standard decimal numeral system.

Output

Output a single character (quotes for clarity):

• '<' if X < Y
• '>' if X > Y
• '=' if X = Y

Sample test(s)

input

6 2
1 0 1 1 1 1
2 10
4 7

output

=

input

3 3
1 0 2
2 5
2 4

output

<

input

7 16
15 15 4 0 0 7 10
7 9
4 8 0 3 1 5 0

output

>

Note

In the first sample, X = 101111₂ = 47₁₀ = Y.

In the second sample, X = 102₃ = 21₅ and Y = 24₅ = 112₃, thus X < Y.

In the third sample,  and Y = 4803150₉. We may notice that X starts with much larger digits and b_x is much larger than b_y, so X is clearly larger than Y.

#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T> inline void gmax(T &a,T b){if(b>a)a=b;}
template <class T> inline void gmin(T &a,T b){if(b<a)a=b;}
const int N=0,M=0,Z=1e9+7,ms63=1061109567;
int n,m;
int a[12];
int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=n;++i)scanf("%d",&a[i]);
		LL bit=1;
		LL x=0;
		for(int i=n;i>=1;--i)
		{
			x+=a[i]*bit;
			bit*=m;
		}
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;++i)scanf("%d",&a[i]);
		bit=1;
		LL y=0;
		for(int i=n;i>=1;--i)
		{
			y+=a[i]*bit;
			bit*=m;
		}
		if(x==y)puts("=");
		else puts(x>y?">":"<");
	}
	return 0;
}
/*
【题意】
给你两个数X和Y，
每个数都是以{位数 进制 从高到低的每一位}这样的形式给出。
让你判断X和Y的大小关系。
位数n最大为10，进制m最大为40

【类型】
水题

【分析】
10^40也不过1e16级别，不会爆LL，所以水过

【时间复杂度&&优化】
O(n)

*/