USACO 2011 November Contest, Bronze Division 2- Awkward Digits > 문제은행 : 정보올림피아드&알고리즘




3741 : Awkward Digits

제한시간
1000 ms   
메모리제한
128 MB   
해결횟수
0 회   
시도횟수
0 회   

문제

Bessie the cow is just learning how to convert numbers between different bases, but she keeps making errors since she cannot easily hold a pen between her two front hooves.

Whenever Bessie converts a number to a new base and writes down the result, she always writes one of the digits wrong. For example, if she converts the number 14 into binary (i.e., base 2), the correct result should be "1110", but she might instead write down "0110" or "1111". Bessie never accidentally adds or deletes digits, so she might write down a number with a leading digit of "0" if this is the digit she gets wrong.

Given Bessie's output when converting a number N into base 2 and base 3, please determine the correct original value of N (in base 10). You can assume N is at most 1 billion, and that there is a unique solution for N.

Please feel welcome to consult any on-line reference you wish regarding base-2 and base-3 numbers, if these concepts are new to you.


입력형식

* Line 1: The base-2 representation of N, with one digit written incorrectly.

* Line 2: The base-3 representation of N, with one digit written incorrectly.​


출력형식

* Line 1: The correct value of N. 


입력 예

1010 212

출력 예

14

Hint!

* INPUT DETAILS:

When Bessie incorrectly converts N into base 2, she writes down "1010".

When she incorrectly converts N into base 3, she writes down "212".​ 

 

 

* OUTPUT DETAILS:

The correct value of N is 14 ("1110" in base 2, "112" in base 3).​ 




USACO 2011, Bronze Division, Bronze

경기도 안양시 동안구 평촌대로 109 협성골드프라자 601호

TEL : 031-360-4144 FAX : 031-388-0996 E-mail : hancomc@hotmail.com, comkiwer@naver.com

Copyrightⓒ 2010 jungol. All right reserved.

TOP