This post is all about the solution of the E. Vlad and a Pair of Numbers Codeforces Round #847 (Div. 3) Problem solution.

E. Vlad and a Pair of Numbers Codeforces Round #847 (Div. 3) Problem solution

Codeforces

Problem Statement :

Vlad discovered two positive numbers (a,b>0). He discovered that ab=a+b2, where denotes the bitwise exclusive OR and division is done without rounding.
Because it is easier to remember one number than two, Vlad remembered only ab, which we will denote as x. Assist him in locating any suitable a and b, or inform him that they do not exist.



Format of Input :

Each test contains a number of test cases. The first line contains the number t (1t500) of test cases. The test cases are described below.

A test case's only line contains the string s (3|s|100) — the capybaras' names written together. The string only contains the English letters 'a' and 'b'.

The sum of string lengths across all test cases is guaranteed not to exceed 500.

Format of the Output :

For every test case, print three strings a, b, and c separated by spaces on a single line — capybara names, such that writing them without spaces results in a line s. ab and cb, or ba and bc, must be satisfied.

If you have several options for restoring the names, print any of them. If the names are unable to be recovered, print ":(" (without quotes)


Also Check this out:-

A. Polycarp and the Day of Pi Codeforces Round #847 (Div. 3) Problem solution, Click Here
B. Taisia and Dice Codeforces Round #847 (Div. 3) Problem solution, Click Here
C. Premutation Codeforces Round #847 (Div. 3) Problem solution, Click Here
D. Matryoshkas Codeforces Round #847 (Div. 3) Problem solution, Click Here
E. Vlad and a Pair of Numbers Codeforces Round #847 (Div. 3) Problem solution, Click Here
F. Timofey and Black-White Tree Codeforces Round #847 (Div. 3) Problem solution, Click Here
Solution of the Problem: Click Here