1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36
|
/* The Computer Language Shootout
http://shootout.alioth.debian.org/
contributed by Isaac Gouy (Scala novice)
*/
import scala.collection.mutable.HashMap;
object hash {
def main(args: Array[String]) = {
val n = toPositiveInt(args);
var count = 0;
val table = new HashMap[String,Int]();
for (val i <- Iterator.range(1,n+1))
table += (Integer.toString(i, 16) -> i)
for (val i <- Iterator.range(1,n+1))
if (table contains Integer.toString(i, 10))
count = count + 1;
Console println(count);
}
private def toPositiveInt(s: Array[String]) = {
val i =
try { Integer.parseInt(s(0)); }
catch { case e: Exception => 1 }
if (i>0) i; else 1;
}
}
|