Correct Solution?

                             Correct Solution?
Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u
Submit
 
Status


Description
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.


Input
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.


Output
Print OK if Bob's answer is correct and WRONG_ANSWER otherwise.


Sample Input
Input
3310
1033
Output
OK
Input
4
5
Output
WRONG_ANSWER


#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
char a[15],b[15];
int main()
{
    int x,y,i,j,cnt,tmp;
    while(~scanf("%s %s",a,b))
    {
        cnt=strlen(a);
        sort(a,a+cnt);
        i=0;
        while(a[i]=='0'&&i<cnt)i++;
        if(i<cnt)swap(a[i],a[0]);
        if(strcmp(a,b)==0)puts("OK");
        else puts("WRONG_ANSWER");
    }
    return 0;
}