Codeforces Round #333 (Div. 2) A. Two Bases
来源:互联网 发布:如何选择企业排名优化 编辑:程序博客网 时间:2024/04/29 22:46
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.
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 a single character (quotes for clarity):
- '<' if X < Y
- '>' if X > Y
- '=' if X = Y
6 21 0 1 1 1 12 104 7
=
3 31 0 22 52 4
<
7 1615 15 4 0 0 7 107 94 8 0 3 1 5 0
>
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还暴
- Codeforces Round #333 (Div. 2) A. Two Bases
- Codeforces Round #333 (Div. 2) A. Two Bases
- Codeforces Round #333 (Div. 2) A. Two Bases
- Codeforces Round #333 (Div. 2) A. Two Bases
- Codeforces Round #333 (Div. 2) A. Two Bases
- Codeforces Round #333 (Div. 2) 602 Two Bases
- Codeforces Round #333 (Div. 2)A. Two Bases(模拟,计算进制)
- Codeforces Round #333 (Div. 2) A. Two Bases (进制转换比较大小)
- 【Codeforces Round 333 (Div 2)A 】【水题 简单进制模拟】Two Bases 不同进制数比大小
- CodeForces 602A Two Bases(简单题,比较两个不同进制数的大小)——Codeforces Beta Round #333 (Div. 2)
- Codeforces 602A Two Bases
- CodeForces 602 A. Two Bases
- Codeforces 602A Two Bases
- Codeforces Round #212 (Div. 2) A A. Two Semiknights Meet
- coderforce Codeforces Round #333 (Div. 1) A. The Two Routes
- Codeforces Round #212 (Div. 2) A. Two Semiknights Meet
- Codeforces Round #128 (Div. 2) A. Two Problems
- Codeforces Round #306 (Div. 2)---A. Two Substrings
- javascript之this关键字
- 布隆过滤器
- 垂直和水平居中方法小结
- AsynTask异步任务+HttpURLConnection网络请求+Gson解析数据+添加到sqlite数据库展示数据
- Kafka+Spark Streaming+Redis实时计算整合实践
- Codeforces Round #333 (Div. 2) A. Two Bases
- poj1932&&hdoj1317XYZZY【SPFA判环】
- Linux C语言写的超级简单端口扫描器
- 【Linux编程】用c语言判断大小端
- A + B Problem II—1002
- 让人惊叹的Android Studio快捷键总结
- HTML+CSS+JavaScript
- 2015年Java代码之03
- NIO对字节流的读写