a = input()
b = input()
if a == '0' and b == '0' :
print('OK')
exit()
c = []
for i in a :
c.append(i)
c.sort()
d = ''
for i in c :
d += i
if c[0] == '0':
if len(d) > 1:
e = d[1] + d[0] + d[2:]
if e[0] == '0' :
print('WRONG_ANSWER')
elif e == b:
print('OK')
else:
print('WRONG_ANSWER')
else:
print('WRONG_ANSWER')
else:
if d == b :
print('OK')
else:
print('WRONG_ANSWER')
#include <cstdio>
#include <iostream>
#include <string>
int main(){
std::string input(""), answer(""), output("");
getline(std::cin, input);
getline(std::cin, answer);
int count[10] = {0};
char minNonZero('A');
for(int k = 0; k < input.size(); k++){
++count[input[k] - '0'];
if(input[k] > '0' && input[k] < minNonZero){minNonZero = input[k];}
}
if(minNonZero == 'A'){output = "0";}
else{
--count[minNonZero - '0'];
output += minNonZero;
for(int digit = 0; digit < 10; digit++){while(count[digit]--){output += ('0' + digit);}}
}
if(answer == output){puts("OK");}
else{puts("WRONG_ANSWER");}
return 0;
}1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |