Created
January 19, 2016 01:07
-
-
Save JosephKiranBabu/c2a13c85d60c030111fe to your computer and use it in GitHub Desktop.
My first python program.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
# -*- coding: utf-8 -*- | |
from runner.koan import * | |
# Greed is a dice game where you roll up to five dice to accumulate | |
# points. The following "score" function will be used calculate the | |
# score of a single roll of the dice. | |
# | |
# A greed roll is scored as follows: | |
# | |
# * A set of three ones is 1000 points | |
# | |
# * A set of three numbers (other than ones) is worth 100 times the | |
# number. (e.g. three fives is 500 points). | |
# | |
# * A one (that is not part of a set of three) is worth 100 points. | |
# | |
# * A five (that is not part of a set of three) is worth 50 points. | |
# | |
# * Everything else is worth 0 points. | |
# | |
# | |
# Examples: | |
# | |
# score([1,1,1,5,1]) => 1150 points | |
# score([2,3,4,6,2]) => 0 points | |
# score([3,4,5,3,3]) => 350 points | |
# score([1,5,1,2,4]) => 250 points | |
# | |
# More scoring examples are given in the tests below: | |
# | |
# Your goal is to write the score method. | |
def score(dice): | |
def add_scores(): return sum(map(score_1, dice)) | |
if len(dice) == 0: | |
return 0 | |
elif len(dice) < 3: | |
return add_scores() | |
else: | |
n = has_3_identical(dice) | |
def calc_sum(remainder): | |
if n == 1: | |
return 1000 + remainder | |
else: | |
return n*100 + remainder | |
if n != 0: | |
if has_all_identical(dice): | |
return calc_sum((len(dice) - 3)*score_1(dice[0])) | |
else: | |
return calc_sum(sum(map(score_1, remove_3(dice, n)))) | |
else: | |
return add_scores() | |
def score_1(i): return {1: 100, 5: 50}.get(i, 0) | |
def has_3_identical(seq): | |
for i in range(1,7): | |
if len(list(filter(lambda n: n == i, seq))) >= 3: | |
return i | |
return 0 | |
def remove_3(seq, elem): | |
for _ in range(3): seq.remove(elem) | |
return seq | |
def has_all_identical(seq): | |
for i in range(1,len(seq)): | |
if seq[i-1] != seq[1]: return False | |
return True | |
# Test cases start from here | |
class AboutScoringProject(Koan): | |
def test_score_of_an_empty_list_is_zero(self): | |
self.assertEqual(0, score([])) | |
def test_score_of_a_single_roll_of_5_is_50(self): | |
self.assertEqual(50, score([5])) | |
def test_score_of_a_single_roll_of_1_is_100(self): | |
self.assertEqual(100, score([1])) | |
def test_score_of_multiple_1s_and_5s_is_the_sum_of_individual_scores(self): | |
self.assertEqual(300, score([1,5,5,1])) | |
def test_score_of_single_2s_3s_4s_and_6s_are_zero(self): | |
self.assertEqual(0, score([2,3,4,6])) | |
def test_score_of_a_triple_1_is_1000(self): | |
self.assertEqual(1000, score([1,1,1])) | |
def test_score_of_other_triples_is_100x(self): | |
self.assertEqual(200, score([2,2,2])) | |
self.assertEqual(300, score([3,3,3])) | |
self.assertEqual(400, score([4,4,4])) | |
self.assertEqual(500, score([5,5,5])) | |
self.assertEqual(600, score([6,6,6])) | |
def test_score_of_mixed_is_sum(self): | |
self.assertEqual(250, score([2,5,2,2,3])) | |
self.assertEqual(550, score([5,5,5,5])) | |
self.assertEqual(1150, score([1,1,1,5,1])) | |
def test_ones_not_left_out(self): | |
self.assertEqual(300, score([1,2,2,2])) | |
self.assertEqual(350, score([1,5,2,2,2])) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment