Python: Total Damages Exampleskill_book = { 'mage': {'punch':10, 'spellcast':50}, 'shielder': {'punch': 5 }, 'vanguard': {'quickpunch':10, 'punch':20, 'kick':30} }assert total_damage(skill_book, [('mage','punch'), ('mage','punch')]) == 20 # each mage's punch deal 10 damageassert total_damage(skill_book, [('mage','punch'), ('vanguard','punch')]) == 30 # each vanguard's punch deal 20 damage, so the total is 10+20 = 30assert total_damage(skill_book, [('mage','spellcast'), ('vanguard','punch'), ('vanguard','punch')]) == 90assert total_damage(skill_book, [('vanguard','punch'), ('vanguard','kick'), ('shielder','punch')]) == 55 In an RPG game, you are controlling a team of multiple heroes to fight against monsters. Each hero equips withvarious offensive skills each of which deals different amount of damage. The amount of damage for the skills is givenin a dictionary as follows:{ : { : , : ,: { : , : ,},..},}where 's and 's are strings, and 's are a non-negative integers. For example, if performs an attack with , the amount of damage from that attack is .The game keeps a combat_log which basically is a list heros' actions. Each action is a tuple (hero_name, skill_name)which means that hero_name performs skill_name . The total damage is simply the sum of all damages dealt by allthe attacks in the combat log.Your task is to write a function total_damage(skill_book:dict[str,dict[str,int]], combat_log:list[tuple[str,str]])-> int that computes the total amount of damage dealt from all actions in the given combat_log according to theskill_book written in the aforementioned format.

The program text is given below: #defintion of the skill book skill_book = { 'mage': {'punch':10,…

Python: Total Damages Example skill_book = { 'mage': {'punch':10, 'spellcast':50}, 'shielder': {'punch': 5 }, 'vanguard': {'quickpunch':10, 'punch':20, 'kick':30} } assert total_damage(skill_book, [('mage','punch'), ('mage','punch')]) == 20 # each mage's punch deal 10 damage assert total_damage(skill_book, [('mage','punch'), ('vanguard','punch')]) == 30 # each vanguard's punch deal 20 damage, so the total is 10+20 = 30 assert total_damage(skill_book, [('mage','spellcast'), ('vanguard','punch'), ('vanguard','punch')]) == 90 assert total_damage(skill_book, [('vanguard','punch'), ('vanguard','kick'), ('shielder','punch')]) == 55

Python: Total Damages Example skill_book = { 'mage': {'punch':10, 'spellcast':50}, 'shielder': {'punch': 5 }, 'vanguard': {'quickpunch':10, 'punch':20, 'kick':30} } assert total_damage(skill_book, [('mage','punch'), ('mage','punch')]) == 20 # each mage's punch deal 10 damage assert total_damage(skill_book, [('mage','punch'), ('vanguard','punch')]) == 30 # each vanguard's punch deal 20 damage, so the total is 10+20 = 30 assert total_damage(skill_book, [('mage','spellcast'), ('vanguard','punch'), ('vanguard','punch')]) == 90 assert total_damage(skill_book, [('vanguard','punch'), ('vanguard','kick'), ('shielder','punch')]) == 55

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter14: Files And Streams

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
# define stemmer functionstemmer = SnowballStemmer('english') # tokenise datatokeniser = TreebankWordTokenizer()tokens = tokeniser.tokenize(data) # define lemmatiserlemmatizer = WordNetLemmatizer() # bag of wordsdef bag_of_words_count(words, word_dict={}): """ this function takes in a list of words and returns a dictionary with each word as a key, and the value represents the number of times that word appeared""" for word in words: if word in word_dict.keys(): word_dict[word] += 1 else: word_dict[word] = 1 return word_dict # remove stopwordstokens_less_stopwords = [word for word in tokens if word not in stopwords.words('english')] # create bag of wordsbag_of_words = bag_of_words_count(tokens_less_stopwords) Use the stemmer and lemmatizer functions (defined in the cells above) from the relevant library to find the stem and lemma of the nth word in the token list. Function Specifications: Should take a list as input and…
Count dominators def count_dominators(items): An element of items is said to be a dominator if every element to its right (not just the one element that is immediately to its right) is strictly smaller than it. By this definition, the last item of the list is automatically a dominator. This function should count how many elements in items are dominators, and return that count. For example, dominators of [42, 7, 12, 9, 13, 5] would be the elements 42, 13 and 5. Before starting to write code for this function, you should consult the parable of "Shlemiel the painter" and think how this seemingly silly tale from a simpler time relates to today's computational problems performed on lists, strings and other sequences. This problem will be the first of many that you will encounter during and after this course to illustrate the important principle of using only one loop to achieve in a tiny fraction of time the same end result that Shlemiel achieves with two nested loops. Your workload…
Rooks on a rampage def safe_squares_rooks(n, rooks): A generalized n-by-n chessboard has been invaded by a parliament of rooks, each rook represented as a two-tuple (row, column) of the row and the column of the square that the rook is in. Since we are again computer programmers instead of chess players and other normal folks, our rows and columns are numbered from 0 to n - 1. A chess rook covers all squares that are in the same row or in the same column. Given the board size n and the list of rooks on that board, count the number of empty squares that are safe, that is, are not covered by any rook. To achieve this in reasonable time and memory, you should count separately how many rows and columns on the board are safe from any rook. Because permuting the rows and columns does not change the answer to this question, you can imagine all these safe rows and columns to have been permuted to form an empty rectangle at the top left corner of the board. The area of that safe rectangle is…
A lecturer makes use of a list to store the scores of a test similar to the following: var scores = [45,50,89,90,46,67] Each element in the list represents the score obtained by student i, where i is the respective index. To help the lecturer perform some operations, you are required to write and test the following functions Function called captureScores This function accepts an integer representing the number of students in the class e.g. 5 It then captures the scores for the 5 students, one by one, adding them to a list of integers Finally, it returns the list once all n scores have been captured. Hint – Make use of a loop. Start with an empty list, use the add() method to populate your list with scores, one by one as they are captured.
A lecturer makes use of a list to store the scores of a test similar to the following: var scores = [45,50,89,90,46,67] Each element in the list represents the score obtained by student i, where i is the respective index. To help the lecturer perform some operations, you are required to write and test the following functions Function called captureScores This function accepts an integer representing the number of students in the class e.g. 5 It then captures the scores for the 5 students, one by one, adding them to a list of integers Finally, it returns the list once all n scores have been captured. Hint – Make use of a loop. Start with an empty list, use the add() method to populate your list with scores, one by one as they are captured. Function called printResults that takes a list of integers as an argument ( e.g. list scores) and prints the result for each score using the following grading scheme Score Result 0 – 44…
A spell checker in a word processing program makes suggestions when it finds a word not in the dictionary. To determine what words to suggest, it tries to find similar words. One measure of word similarity is the Levenshtein distance, which measures the number of substitutions, additions, or deletions that are required to change one word into another. For example, the words spit and spot are a distance of 1 apart; changing spit to spot requires one substitution (i for o). Likewise, spit is distance 1 from pit since the change requires one deletion (the s). The word spite is also distance 1 from spit since it requires one addition (the e). The word soot is distance 2 from spit since two substitutions would be required. a. Create a graph using words as vertices, and edges connecting words with a Levenshtein distance of 1. Use the misspelled word “moke” as the center, and try to find at least 10 connected dictionary words. How might a spell checker use this graph? b. Improve the method…
class Solution(object): def longestCommonPrefix(self, strs): result ="" for i in strs[0]: for j in strs[1]: for k in strs[2]: if i == j and i == k: result+=i if len(result) >0: return result else: return result IndexError: list index out of range for j in strs[1]: Line 5 in longestCommonPrefix (Solution.py) ret = Solution().longestCommonPrefix(param_1) Line 31 in _driver (Solution.py) _driver() Line 41 in <module> (Solution.py) can someone explain why this is wrong?
File Encryption and DecryptionWrite a program that uses a dictionary to assign “codes” to each letter of the alphabet. Forexample:codes = { ‘A’ : ‘%’, ‘a’ : ‘9’, ‘B’ : ‘@’, ‘b’ : ‘#’, etc . . .}Using this example, the letter A would be assigned the symbol %, the letter a would beassigned the number 9, the letter B would be assigned the symbol @, and so forth.The program should open a specified text file, read its contents, then use the dictionaryto write an encrypted version of the file’s contents to a second file. Each character in thesecond file should contain the code for the corresponding character in the first file.Write a second program that opens an encrypted file and displays its decrypted contentson the screen. in phyton
Arithmetic progression def arithmetic_progression(items): An arithmetic progression is a numerical sequence so that the stride between each two consecutive elements is constant throughout the sequence. For example, [4, 8, 12, 16, 20] is an arithmetic progression of length 5, starting from the value 4 with a stride of 4. Given a non-empty list items of positive integers in strictly ascending order, find and return the longest arithmetic progression whose all values exist somewhere in that sequence. Return the answer as a tuple (start, stride, n) of the values that define the progression. To ensure unique results to facilitate automated testing, if there exist several progressions of the same length, this function should return the one with the lowest start. If several progressions of equal length emanate from the lowest start, return the progression with the smallest stride. items expected results [42] (42, 0, 1) [2, 4, 6, 7, 8, 12, 17] (2, 2, 4) [1, 2, 36, 49, 50, 70, 75, 98,…
CCC '13 J1 - Next in line Canadian Computing Competition: 2013 Stage 1, Junior #1 You know a family with three children. Their ages form an arithmetic sequence: the difference in ages between the middle child and youngest child is the same as the difference in ages between the oldest child and the middle child. For example, their ages could be 5, 10 and 15, since both adjacent pairs have a difference of 5 years. Given the ages of the youngest and middle children, what is the age of the oldest child? Input Specification The input consists of two integers, each on a separate line. The first line is the age Y of the youngest child (0
a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?