Changeset 3840

Timestamp:

Jul 11, 2008, 12:25:17 AM (13 years ago)

Author:

yura

Message:

• Program text for Alien.

Location:

applications/trunk/UGPSummerSchool2008/src

Files:

• Alien.rf (modified) (3 diffs)
• Sequence.rf (modified) (1 diff)
• Sort.rf (modified) (1 diff)

applications/trunk/UGPSummerSchool2008/src/Alien.rf

@@ +1 @@
+// http://code.google.com/codejam/contest
+//
+// Problem
+//
+// The decimal numeral system is composed of ten digits, which we represent as
+// "0123456789" (the digits in a system are written from lowest to highest).
+// Imagine you have discovered an alien numeral system composed of some number
+// of digits, which may or may not be the same as those used in decimal. For
+// example, if the alien numeral system were represented as "oF8", then the
+// numbers one through ten would be (F, 8, Fo, FF, F8, 8o, 8F, 88, Foo, FoF).
+// We would like to be able to work with numbers in arbitrary alien systems.
+// More generally, we want to be able to convert an arbitrary number that's
+// written in one alien system into a second alien system.
+//
+// Input
+//
+// The first line of input gives the number of cases, N. N test cases follow.
+// Each case is a line formatted as
+//
+//     alien_number source_language target_language
+//
+// Each language will be represented by a list of its digits, ordered from
+// lowest to highest value. No digit will be repeated in any representation,
+// all digits in the alien number will be present in the source language, and
+// the first digit of the alien number will not be the lowest valued digit of
+// the source language (in other words, the alien numbers have no leading
+// zeroes). Each digit will either be a number 0-9, an uppercase or lowercase
+// letter, or one of the following symbols !"#$%&'()*+,-./:;<=>?@[\]^_`{|}~
+//
+// Output
+//
+// For each test case, output one line containing "Case #x: " followed by the
+// alien number translated from the source language to the target language.
+//
+// Limits
+//
+// 1 <= N <= 100.
+//
+// Small dataset
+//
+// 1 <= num digits in alien_number <= 4,
+// 2 <= num digits in source_language <= 10,
+// 2 <= num digits in target_language <= 10.
+//
+// Large dataset
+//
+// 1 <= alien_number (in decimal) <= 1000000000,
+// 2 <= num digits in source_language <= 94,
+// 2 <= num digits in target_language <= 94.
+//
+// Sample
+//
+// Input
+//
+// 4
+// 9 0123456789 oF8
+// Foo oF8 0123456789
+// 13 0123456789abcdef 01
+// CODE O!CDE? A?JM!.
+//
+// Output
+//
+// Case #1: Foo
+// Case #2: 9
+// Case #3: 10011
+// Case #4: JAM!
+
 $module Alien;
 
@@ -4 +71 @@
 
 $func ToInt (e.system) (e.number) = s.int;
-$func FromInt e.system s.int = e.number;
 
 ToInt (e.system) (e.number) =
@@ -12 +78 @@
                         <Add <Mult s.int s.base> <Length e.head>> e.number2;            
         } :: s.int e.number, e.number :, s.int;
+
+$func FromInt e.system s.int = e.number;
 
 FromInt e.system s.int =

applications/trunk/UGPSummerSchool2008/src/Sequence.rf

@@ -4 +4 @@
 // 7, 9, 4, 5, 8, 6, 3, 4, 7, 5, 3, 9, 6, 8, 3, 5, 7.
 // (http://people.csail.mit.edu/namin/bits/reasoned-schemer/sequence-program.scm.html)
+
+$module Sequence;
 
 $use StdIO;

applications/trunk/UGPSummerSchool2008/src/Sort.rf

@@ +1 @@
+$module Sort;
+
 $use Compare StdIO;