You are given two integers n and k. You ought to make a variety of n positive integers a1,a2,… ,a to such an extent that the total (a1+a2+⋯+an) is distinguishable by k and greatest component in an is least conceivable. What is the base conceivable most extreme component in a?

You are given two integers n and k. You ought to make a variety of n positive integers a1,a2,… ,a to such an extent that the total (a1+a2+⋯+an) is distinguishable by k and greatest component in an is least conceivable. What is the base conceivable most extreme component in a?

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

Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit, is there anything smarter we could do? (b) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.] (c) Gradient ascent search is prone to local optima just like hill climbing.…
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)?
Can you please help me with this problem because i am struggling with how to do this because I don't understand. I need help with question 2.7 part C but to answer question 2.7 part c you need question 2.6. But again i only need help with question 2.7. For the question of 2.7 part C, can you do it step by step using the pushdown automaton. Can you please show a vistual representation or drawings of the circles to help me understand it better. I only need help with questioin 2.7 part cquestion for 2.7 part C:2.7 Give informal English descriptions of PDAs for the languages in Exercise 2.6. question for 2.6 c. {w#x| w R is a substring of x for w, x ∈ {0,1} ∗ }
Please answer the following question in depth with full detail. Consider the 8-puzzle that we discussed in class. Suppose we define a new heuristic function h3 which is the average of h1 and h2, and another heuristic function h4 which is the sum of h1 and h2. That is, for every state s ∈ S: h3(s) =h1(s) + h2(s) 2 h4(s) =h1(s) + h2(s) where h1 and h2 are defined as “the number of misplaced tiles”, and “the sum of the distances of the tiles from their goal positions”, respectively. Are h3 and h4 admissible? If admissible, compare their dominance with respect to h1 and h2, if not, provide a counterexample, i.e. a puzzle configuration where dominance does not hold.
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…
This is for a Java Progrsm problem but If you could fully explain it to me then I should be okay to try to create this program based off your explaination. Thank you! Trigonometry is needed A pipe is to be carried around a right-angled corner of two intersecting corridors. Suppose that the widths of the two intersecting corridors are 5 feet and 8 feet. Your objective is to find the length of the lingest pipe, rounded to the nearest foot, that can be carried level around the right-angled corner. What I have to do is the following: Write a program that prompts the user to input the widths of both the hallways/ The program then outputs the length of the longest pipe, rounded to the nearest foot, that can be carried level around the right-angled cprner. Note that the length of the pipe os goven by l = AB + BC = 8 /SIN 0 (Omega) + 5 / cos 0(Omega), where 0 < > Omega < pi/ 2
Can you help me with this code because this is a little difficult for me:question that i need help with:The Lights Out puzzle consists of an m x n grid of lights, each of which has two states: on and off. The goal of the puzzle is to turn all the lights off, with the caveat that whenever a light is toggled, its neighbors above, below, to the left, and to the right will be toggled as well. If a light along the edge of the board is toggled, then fewer than four other lights will be affected, as the missing neighbors will beignored. In this section, you will investigate the behavior of Lights Out puzzles of various sizes by implementing a LightsOutPuzzle class task: A natural representation for this puzzle is a two-dimensional list of Boolean values, where True corresponds to the on state and False corresponds to the off state. In the LightsOutPuzzle class, write an initialization method __init__(self, board) that stores an input board of this form for future use. Also write a method…
We now consider two sound waves with different frequencies which have to the same amplitude. The wave functions of these waves are as follows: y1 (t) = A sin (2πf1t) y2 (t) = A sin (2πf2t) 1) Using any computer program, construct the wave dependency graph resultant y (t) from time t in the case when the frequencies of the two sound waves are many next to each other if the values are given: A = 1 m, f1 = 1000 Hz and f2 = 1050 Hz. Doing the corresponding numerical simulations show what happens with the increase of the difference between the frequencies of the two waves and vice versa.
Let l be a line in the x-yplane. If l is a vertical line, its equation is x = a for some real number a. Suppose l is not a vertical line and its slope is m. Then the equation of l is y = mx + b, where b is the y-intercept. If l passes through the point (x₀, y₀), the equation of l can be written as y - y₀ = m(x - x₀). If (x₁, y₁) and (x₂, y₂) are two points in the x-y plane and x₁ ≠ x₂, the slope of line passing through these points is m = (y₂ - y₁)/(x₂ - x₁). Instructions Write a program that prompts the user for two points in the x-y plane. Input should be entered in the following order: Input x₁ Input y₁ Input x₂
A tile of a monkey puzzle has four monkey halves that can be labelled as north(N), east (E), south (S), and west (W) half. In addition to the shape of the borderrectangle, these halves determine which edges can be placed next one other. There isalso another way to define how the tiles can be placed: Each tile corner (i.e. compassdirections NE, SE, SW, and NW) has a monkey quarter. If we abstract this quarter, forexample, with a letter, only the tiles with the same letter in their touching corners canbe adjacent. illustrates one valid solution for this quarter monkey puzzle.Are the two monkey puzzle representations equivalent in the sense that if we have apile of ‘half monkey’ tiles H, it is possible to define a pile of ‘quarter monkey’ tilesQ that gives exactly the same set of solutions for the puzzle (and vice versa)?
Create a curve that uses a quadratic parametric approach with three interpolated control points. The equations which describe the curve are: $$f_x(u) = c_0 u^2 + c_1 u + c_2 $$ and $$f_y(u) = c_3 u^2 + c_4 u + c_5 $$ where $u$ ranges from 0.0 to 1.0. The first control point $$p_0$$ is for $u=0$, the second $p_1$ for $u=0.5$, and the third for $p_2$ and at $u=1.0$. Modify the code to implement your solution. It is sufficient for this task to get the program working with three control points, but you are most welcome to attempt a solution that works on four or more. Code: import java.awt.Graphics2D; import java.awt.geom.Ellipse2D; import java.awt.geom.Path2D; import java.awt.geom.Point2D; import javax.swing.JFrame; import javax.swing.JTabbedPane; import javax.swing.SwingUtilities; public class DotToDotDemo implements Runnable { /** * DotToDotDemo - A demo which draws dots between points to form a curve. * Eric McCreath 2015, 2019 - GPL * Modified by Matthew Aitchison 2022. */ JFrame…
Determine if the following arguments are valid or invalid. Justify your answers through drawing Euler diagrams. All girls enjoy dancing. Carol is a girl. Therefore, Carol enjoys dancing. Some teachers are artists. Clemence is a teacher. Therefore, Clemence is a poet. All lions are animals. Some lions have manes. Therefore, some animals have manes. All parrots are birds. Some birds are colorful. Therefore, some parrots are colorful. All bleeps (B) are zams (Z). All foos (F) are mees (M). No bleep is a foo. Therefore, no zam is a mee.