Digit Rotation

Problem code: DIGROT

All submissions for this problem are available.

For any positive integer, we define a digit rotation as either moving the first digit to the end of the number (left digit rotation), or the last digit to the front of the number (right digit rotation). For example, the number 12345 could be left digit rotated to 23451, or right digit rotated to 51234. If there are any leading zeros after digit rotation, they must be removed. So 10203 could be left digit rotated to 2031, then left digit rotated again to 312. Given an integer N, determine the largest integer that can result from performing a series of one or more digit rotations on N.

Input

Input will begin with an integer T (at most 1000), the number of test cases. Each test case consists of a positive integer N<100000000 (10^8) on a line by itself.

Output

For each test case, print the largest integer that can result from performing one or more digit rotations on N.

Sample Input

6
12345
54321
10901
211011
7
90

Sample Output

51234
54321
11090
211011
7
9
Author: pieguy
Date Added: 2-09-2011
Time Limit: 2 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


Comments

I have some questions

goon_boy @ 20 Sep 2011 03:49 PM
I have some questions regarding this problem. 1. Do I have to check both "Left Rotation" and "Right Rotation" for same test case or I may perform any of the one? If I am allowed to perform any one rotation, then for some particular test case the largest number will be different from "Left Rotation" to "Right Rotation". For example: 909 if a "left rotation" is performed after being rotated the number looks like: 909 ---> 099 == 99 ---> 99 The higest number is 909. but if "right rotation" is performed: 909 ---> 990 ---> 099 == 99 --->99 but in this case highest number is 990. 2.Why the output of 90 is 9???? Shouldn't it be 90?

if in case of 211011 ans is

sparknet @ 20 Sep 2011 05:52 PM
if in case of 211011 ans is 211011 itself.. but in case of 90 why it is 9 why not 90 ?

idem with last comment

dekteguh @ 20 Sep 2011 11:16 PM
idem with last comment

ya agree with "sparknet". And

goon_boy @ 21 Sep 2011 12:34 AM
ya agree with "sparknet". And same goes for sample input "54321" too.

@sparknet ... you have to do

linuxfreak @ 21 Sep 2011 11:37 AM
@sparknet ... you have to do at least one rotation.. so for 211011 do first left and right.. so again you get 211011.. bt with 90 even you do left or right.. 0 is lost.. so the answer is just 9..

Will anyone please tell me

goon_boy @ 21 Sep 2011 08:19 PM
Will anyone please tell me which rotation do I have to perform??? Either "left rotation" or "right rotation" or just both?? @linuxfreak sorry I don't understand what you explained. you said, "SO FOR 211011 DO FIRST LEFT AND RIGHT.. SO AGAIN YOU GET 211011.. BT WITH 90 EVEN YOU DO LEFT OR RIGHT.. 0 IS LOST.. SO THE ANSWER IS JUST 9..". Could you please tell it in detail? I have one more thing to ask, in order to find the highest number don't we compare the number with it's rotated number? Or do we have to start comparing when the number is rotated for the first time with rest of the rotated number??? Though it doesn't make any sense as if it is true, then result of "211011" or "54321" wouldn't be "211011" or "54321". Looking forward to your reply. Thanks in advance.

according to linuxfreak

moody @ 22 Sep 2011 02:57 PM
according to linuxfreak 211011 is left rotated to 110112 and then back to 211011 (right rotation)....which is right as the problem says...90 if right rotated becomes 0...and if left rotated becomes 9 (the answer).Even after doing this i am missing some test cases and still getting a wrong answer...Bt its fun in solving the prob... :)

i ran my program and all the

ashish12888 @ 9 Dec 2011 01:37 PM
i ran my program and all the given inputs are satisfied but its saying it as a wrong answer could someone provide me with new test cases which are the most tricky ones

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

HELP

Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

 

  • Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
  • Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
  • Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
  • Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
  • Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

    • If you are still having problems, see a sample solution here.

CodeChef is a global programming communityCodeChef hosts online programming competitions