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 bx and a number Y represented in base by. Compare those two numbers.

Input

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

The second line contains n space-separated integers x1, x2, ..., xn (0 ≤ xi < bx) — 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 by (1 ≤ m ≤ 10,2 ≤ by ≤ 40, bx ≠ by), where m is the number of digits in the by-based representation of Y, and the fourth line contains m space-separated integers y1, y2, ..., ym (0 ≤ yi < by) — 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 = 1011112 = 4710 = Y.

In the second sample, X = 1023 = 215 and Y = 245 = 1123, thus X < Y.

In the third sample,  and Y = 48031509. We may notice that X starts with much larger digits and bx is much larger than by, so X is clearly larger than Y.

题意：给你一个n位的bx进制数，和m位的by进制数。比较他们的大小，输出时大于还是等于还是小于

简单题，直接上代码

手速和读题还是太慢了！！

注意要用long long，int还暴

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

const int N = 20;
int b[N];
int y[N];

int main(void)
{
    int i;
    long long tmp1, tmp2;
    int n, m;
    int bx, yx;
    cin >> n >>bx;
    tmp1 = tmp2 = 0;
    long long temp = 1;
    for(i = 0; i < n; i++)
    {
        cin >> b[i];
    }
    for(i = n-1; i >= 0; i--)
    {
        tmp1 += temp*b[i];
        temp *= bx;
    }
    temp = 1;
    cin >> m >>yx;
    for(i = 0; i < m; i++)
    {
        cin >> y[i];
    }
    for(i = m-1; i >= 0; i--)
    {
        tmp2 += temp*y[i];
        temp *= yx;
    }
//    cout << tmp1 << '\t' << tmp2 << endl;
    if(tmp1 == tmp2) cout << "=" << endl;
    else if(tmp1 > tmp2) cout << ">" << endl;
    else cout << "<" << endl;
    return 0;
}