Write a function that will play Rock, Paper, Scissors with itself. It will pick two random elements from a list. Then the function must know if random element #1 won, lost or drawed. The list is rps=['rock', 'paper', 'scissors'] Then the function must add to a dictionary the number of times the first element won per option in the list. Example { 'rock':'400', 'paper':'300', 'scissors':'300' } You need to run this at least 1000 times. You can either create a single thread, or you can create multiple threads. You need to use the random module and the random.choice(LISTNAME) to pick a random element from a list.

Write a function that will play Rock, Paper, Scissors with itself. It will pick two random elements from a list. Then the function must know if random element #1 won, lost or drawed. The list is rps=['rock', 'paper', 'scissors'] Then the function must add to a dictionary the number of times the first element won per option in the list. Example { 'rock':'400', 'paper':'300', 'scissors':'300' } You need to run this at least 1000 times. You can either create a single thread, or you can create multiple threads. You need to use the random module and the random.choice(LISTNAME) to pick a random element from a list.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function; void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support File…
Write a function that takes a list removal(L), delete from it all the elements whose indicesare divisible by 3. And return the resulting list after removing unwanted elements.Example:>>>removal(['A', 'B', 'C', 'D', 'E'])['B', 'C','E'
Write a function piggyBank in Python that accepts a sequence of "coins" and returns counts of the coins and the total value of the bank. the coins will be given by a list of single characters, each one of 'Q','D','N',P', representing quarter, dime, nickel, penny the function returns a tuple with two items:1. a dictionary with counts of each denomination. They should always be listed in theorder 'Q','D','N',P'2. the total value in whole cents of the amount in the bank Sample result examples: >>> piggyBank(['D', 'P', 'Q', 'Q', 'D', 'P', 'P'])({'Q': 2, 'D': 2, 'N': 0, 'P': 3}, 73) >>> piggyBank(['D', 'D', 'N', 'N', 'N'])({'Q': 0, 'D': 2, 'N': 3, 'P': 0}, 35) >>> piggyBank(['P', 'D', 'N', 'P', 'N', 'N', 'N', 'Q', 'D', 'P', 'Q', 'Q', 'D'])({'Q': 3, 'D': 3, 'N': 4, 'P': 3}, 128) >>> piggyBank(['D', 'P', 'Q', 'Q', 'D', 'P', 'P'])==({'Q': 2, 'D': 2, 'N': 0,'P': 3}, 73)True Please only give to me the final code or "tool" that could generate any of the…
Write a python program... Write a function called merge2(d1,d2) that takes two dictionaries as input parameters. This function will create a new dictionary that contains everything from the two input dictionaries and return it. The same key might appear in both input dictionaries. In the output dictionary, the value for each key will be a list that has all values corresponding to this key in the two input dictionaries. Sample run,>>> d1 = {'a': 100, 'b': 200, 'c':300}>>> d2 = {'a': 300, 'b': 200, 'd':400} >>> d3 = merge2(d1,d2)>>> display(d3)a, [100,300]b, [200,200]c, [300]d, [400]
Write a function letter_count that accepts a string txt and returns a list containing the number of times that each letter of the alphabet occurs within txt. The returned list should contain the number of occurences of all twenty-six letters of the Latin alphabet, counting both upper and lower-case instances. For example, the string 'Abacus' contains two instances of the letter 'a', and so the first element of the returned list would be 2
Write a function averageB in Python that has a parameter scoreDict which is a dictionary where the keys are strings and the values are floating point numbers representing scores. The function returns the average score for all keys that start with a b (uppercase or lowercase) or returns 0 if there are no keys that start with b.
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the vlaue is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe.Note that it is possible for an…
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the vlaue is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe.Note that it is possible for an…
Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN). The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns. Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!
Can you answer with Python programming language ? Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the value is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5),("orange",25),("salt",40)] checkStock(stock, ingr) should return [("flour",70), ("apple",2),("orange",25)] which means we need…
Write a Python Code for the given function and conditions: Given function: def insert(self, newElement) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.