JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Turkish Informatics Olympiad problem | Reply
Hi,

The problem is from Turkish Informatics Olympiad '98. Any hints on the problem are heavily appreciated =):

Given n(n<10) find the shortest string that contains all permutations of n.

example:

input: 3
output: 312313213

Thanks in advance
Subject Author Date
Turkish Informatics Olympiad problem kolistivra Nov 20, 2007 at 5:24 PM EST
Re: Turkish Informatics Olympiad problem kolistivra Nov 25, 2007 at 1:26 PM EST
Re: Turkish Informatics Olympiad problem TurboGears Nov 26, 2007 at 12:02 AM EST
Re: Turkish Informatics Olympiad problem sclo Nov 26, 2007 at 3:49 AM EST
Re: Turkish Informatics Olympiad problem kolistivra Nov 26, 2007 at 2:16 PM EST
Re: Turkish Informatics Olympiad problem misof Nov 26, 2007 at 3:10 PM EST
Re: Turkish Informatics Olympiad problem wongiseng Nov 27, 2007 at 8:40 AM EST
Re: Turkish Informatics Olympiad problem rlblaster Nov 27, 2007 at 9:49 AM EST
Re: Turkish Informatics Olympiad problem wongiseng Nov 27, 2007 at 12:00 PM EST
Re: Turkish Informatics Olympiad problem ardiankp Nov 27, 2007 at 12:55 PM EST
Re: Turkish Informatics Olympiad problem kolistivra Nov 28, 2007 at 2:52 AM EST
Re: Turkish Informatics Olympiad problem ardiankp Nov 28, 2007 at 8:36 AM EST
Re: Turkish Informatics Olympiad problem kolistivra Dec 6, 2007 at 8:32 AM EST
Re: Turkish Informatics Olympiad problem misof Nov 26, 2007 at 3:04 PM EST
RSS