Codeforces Round #333 (Div. 2) A. Two Bases

本文介绍了一种比较两个不同基数表示的数值大小的方法。输入包括两组数字及其对应的基数,输出则是这两个数值之间的大小关系。文章通过具体示例说明了如何进行转换及比较。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >


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 ≤ 102 ≤ 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 ≤ 102 ≤ by ≤ 40bx ≠ 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 bxis much larger than by, so X is clearly larger than Y.



结题报告:Codeforces Round #333 — editorial


#include
  
   
#include
   
    
#include
    
     
#include
     
      
#include
      
using namespace std;
const int N=100005;
int a[N];
int b[N];
__int64 sum=0,ans=0,kk;
int main()
{
    int n,m,x,y;
    int i,j,k;
    kk=1;
    scanf("%d%d",&n,&x);
    for(i=0; i
       
        ans) { printf(">\n"); } else { printf("<\n"); } return 0; }
       
     
    
   
  



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值