C++ Only: Karan has N items in his store (numbered 1 to N); And in i Each valid (1 <= I<= N). the weight of the i th object is Wi. As Chef is very sensitive to nature. Karan wants to arrange all the weights on one side and the weights on the other side. Karan can arrange two dependent items with the help of an exchange during a single operation. Karan needs the minimum working number required to set the All-Equal weight item on one side and the All-Odd Weights on the other. Karan cannot solve this problem so he asks you to solve it. Help Chef solve this problem.

C++ Only: Karan has N items in his store (numbered 1 to N); And in i Each valid (1 <= I<= N). the weight of the i th object is Wi. As Chef is very sensitive to nature. Karan wants to arrange all the weights on one side and the weights on the other side. Karan can arrange two dependent items with the help of an exchange during a single operation. Karan needs the minimum working number required to set the All-Equal weight item on one side and the All-Odd Weights on the other. Karan cannot solve this problem so he asks you to solve it. Help Chef solve this problem.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
I am learning C for a class I am taking and a homework assignment asks us to makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. We need to use the function malloc to dynamically allocate locations for variables a and b. The full assignment is below. I am not too familiar with C and I don't know how to split the list into two arrays.
Write a program (Java, C) which the following 4 password breaking cases are implemented. The password file should contain 6-digit numbers only (from 000000 to 999999) and assume that the attacker knows that. MD5 pre-implemented open-source hash algorithm should be used. If applicable, For each case what Alice’s password is, what the salts are (if you use random text generator, you need to provide the range only). Test your program and make sure that you break the target passwords in every case. Add a wild guess for the time you break the target password(s) for every case. Case I: Trudy wants to determine Alice's password. Trudy does not use her dictionary 256/2 255 expected work Case II: Trudy wants to determine Alice's password. Trudy uses her dictionary If Alice's password is in the dictionary - 219 Else - 255 Total 1/4(219)+3/4 (255) ≈ 254.6 Case III: Trudy wants to determine any of the 1024 password in the file. Trudy does not use her dictionary If passwords were hashed…
In all programming assignments in this course, it is NOT allowed to use any libraryor package function to directly generate random numbers that follow PoissonDistribution, Exponential Distribution, or any other advanced distributions. ---Writing such random number generators is a main purpose of this assignment.The only exception that you are allowed to directly use is the ones that generaterandom numbers that follow a Uniform Distribution. E.g., rand() in C. A computing system is composed of two servers that are mirrors of each other (forredundancy, so if one fails, it can be restored from the other). Assume that each serverhas an expected MTBF of 500 hours and its continuous uptimes (the average of whichis MTBF) follow an Exponential Distribution. Furthermore, assume that when a serverfails, it takes exactly 10 hours to restore the data from the mirror. (a) Write a program that generates synthetic data showing the failure and restorationtimes for each server over 20 years. You…
In all programming assignments in this course, it is NOT allowed to use any libraryor package function to directly generate random numbers that follow PoissonDistribution, Exponential Distribution, or any other advanced distributions. ---Writing such random number generators is a main purpose of this assignment.The only exception that you are allowed to directly use is the ones that generaterandom numbers that follow a Uniform Distribution. E.g., rand() in C. A computing system is composed of two servers that are mirrors of each other (forredundancy, so if one fails, it can be restored from the other). Assume that each serverhas an expected MTBF of 500 hours and its continuous uptimes (the average of whichis MTBF) follow an Exponential Distribution. Furthermore, assume that when a serverfails, it takes exactly 10 hours to restore the data from the mirror. (a) Write a program that generates synthetic data showing the failure and restorationtimes for each server over 20 years. You…
Please help. How to solve this on Java language by using only Dynamic Programming? Thank you. We are given a set A of integers. Check whether we can partition A into three subsets with equal sums. It is important to note that all elements should be included in the equally divided subsets; no element should be left out, and none of the elements should be repeated in the subsets.For example: A={4,7,6,2,10,7,10,2} has such a partition: {4,2,10}, {7,7,2},{6,10}Input: A set, A, of integersOutput: if we can partition A into three subsets with equal sums, print subsets otherwise present a suitable message.
Develop a java program to define an Symbol table class so that each symbol is associated with a numeric value. The two main methods are set() and get(): void set(String sym, int value); int get(String sym); The set() method associates the int value with the symbol sym, while the get() method performs the complement of retrieving the int value previously associated Define appropriate exceptions so that clients of the Symbol table may respond to conditions appropriately. For example, when they retrieve the value of a nonexist clients can either stop execution and display an error message or use a default value of 0 Symbol Numeric Value
Write a separate C function to implement the following hash functions with a formal parameter key. The function should return the hash value. Write a main program to generate keys randomly for around 100 keys and see how well your functions give unique hash values to each key. --Division Method with an integer key --Multiplication Method with an integer key and a value of (sqrt(5)-1)/2 for A --Mid-Square Method with 7-digit integer key --Folding Method with a 4-digit integer key
Create a function that takes a grid of # and -, where each hash (#) represents amine and each dash (-) represents a mine-free spot.Return a grid, where each dash is replaced by a digit, indicating the number ofmines immediately adjacent to the spot i.e. (horizontally, vertically, anddiagonally).Example of an input:[ ["-", "-", "-", "#", "#"],["-", "#", "-", "-", "-"],["-", "-", "#", "-", "-"],["-", "#", "#", "-", "-"],["-", "-", "-", "-", "-"] ]Example of the expected output:[ ["1", "1", "2", "#", "#"],["1", "#", "3", "3", "2"],["2", "4", "#", "2", "0"],["1", "#", "#", "2", "0"],["1", "2", "2", "1", "0"] ]Here is a tip. When checking adjacent positions to a specific position in the grid,the following table might assist you in determining adjacent indexes:NW position =current_row - 1current_col - 1N position =current_row - 1current_colNE position =current_row - 1current_col + 1W position =current_rowcurrent_col - 1Current position =current_rowcurrent_colE position…
Let a and b denote object modules or static libraries in thecurrent directory, and let a→b denote that a depends on b, inthe sense that b defines a symbol that is referenced by a. Foreach of the following scenarios, show the minimal commandline (i.e., one with the least number of object file and libraryarguments) that will allow the static linker to resolve all symbolreferences.A. p.o → libx.aB. p.o → libx.a → liby.aC. p.o → libx.a → liby.a and liby.a → libx.a → p.o
Your task is to design automated solvers for the shift and Vigenere ciphers. You must use C as the under- lying programming language, in order to get prepared for the following labs. Each solver should be completely automated, i.e., upon reading a text ,l.e. containing the target ciphertext (given as command-line argument), it should print the encryption key and the decrypted plaintext without any user interaction. Test your code on the following ciphertexts, and answer these questions: 1. What is the key of the cipher? 2. What is the decrypted plaintext?Shift Cipher - Decrypt the following ciphertext:…
Please help me Josephus Problem is a theoretical problem related to a certain counting-out game. On thiscase, people are standing in a circle waiting to be executed. After a specified number ofpeople are skipped, the next person is executed. The procedure is repeated with theremaining people, starting with the next person, going in the same direction and skippingthe same number of people, until one person remains, and is freed.Arrange the numbers 1 , 2, 3 , ... consecutively (say, clockwise) in a circle. Now removenumber 2 and proceed clockwise by removing every other number, among those thatremain, until one number is left. (a) Let denote the final number which remains. Find formula for .(b) If there are 70 people, what is the safe number (the number that remains)?