codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

12B.md (1132B)


      1 Source: https://codeforces.com/problemset/problem/12/B
      2 
      3 B. Correct Solution?
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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:
     22 
     23 —Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroes.
     24 
     25 —No problem! — said Bob and immediately gave her an answer.
     26 
     27 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.
     28 
     29 Input
     30 
     31 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.
     32 
     33 Output
     34 
     35 Print OK if Bob's answer is correct and WRONG_ANSWER otherwise.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 3310  
     43 1033
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 OK
     50 ```
     51 
     52 Input
     53 
     54 ```
     55 4  
     56 5
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 WRONG_ANSWER
     63 ```