CF12B.Correct Solution?
普及-
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number n to Bob and said:
—Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroes.
—No problem! — said Bob and immediately gave her an answer.
Alice said a random number, so she doesn't know whether Bob's answer is correct. Help her to find this out, because impatient brother is waiting for the verdict.
一个寒冷的冬夜,爱丽丝和她年长的哥哥鲍勃正坐在家中的壁炉旁,互相出一些有趣的题目来解答。轮到爱丽丝时,她告诉鲍勃一个数字 n,并说道:
— 重新排列这个数字的各位数字,得到不含前导零的最小可能的数。
— 没问题! — 鲍勃立刻给出了答案。
爱丽丝随口说出了一个数字,因此她并不知道鲍勃的答案是否正确。请帮她验证一下,因为性急的哥哥正在等待裁决结果。
输入格式
The first line contains one integer n (0 ≤ n ≤ 109) without leading zeroes. The second lines contains one integer m (0 ≤ m ≤ 109) — Bob's answer, possibly with leading zeroes.
第一行包含一个整数 n(0 ≤ n ≤ 109),不含前导零。
第二行包含一个整数 m(0 ≤ m ≤ 109)—— Bob 的答案,可能含前导零。
输出格式
Print OK if Bob's answer is correct and WRONG_ANSWER otherwise.
如果 Bob 的答案正确,输出 OK;否则输出 WRONG_ANSWER。
输入输出样例
输入#1
3310 1033
输出#1
OK
输入#2
4 5
输出#2
WRONG_ANSWER
输入解题思路,AI测评打分。不知道怎么写?