Answered: Input Format: The first line consists…

Input Format: The first line consists of two space separated integers N and K. The next line consists of N space separated integers denoting the elements of array A.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Related questions

Q: Please Help me with This Problem Language = C++ Take an array of name A of size 4 X 4. Take input…

A: Program Approach : Include necessary libraries. Define function read matrix for reading matrix from…

Q: Let A be an array of size n >= 6 containing integers from 1 to n - 5, inclusive, with excactly five…

A: Algorithm: An algorithm is essentially a series of steps used for a particular task to be completed.…

Q: Write a program that uses two identical arrays of eight randomly ordered integers. Itshould display…

A: Code: include <iostream> using namespace std; //array size #define ARRAY_SIZE 8 //function…

Q: Question 2: Given two arrays a and b, where both arrays consisting of n positive integers. It is…

A: ANSWER PLEASE SEE STEP NO 2

Q: Output: The inversion count is 5

A: The number of steps it will take to sort an array, or how far away it is from being sorted, is the…

Q: Given an array, returns a new array consisting of the longest run of consecutive nondecreasing…

A: Array is a data structure that store values of same data type in a contiguous form In java syntax of…

Q: Let F be the set of the first 1000 Fibnacci numbers and let P be the set of the first 1000 primes.…

A: TERMS: Fibonacci numbers: Let the fibonacci series starts with elements 1, 1 and hence the resultant…

Q: Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n elements. For…

A: Given: M(1)=0 M(2)=1 M(4)=4 Given expression: M(n)=2M(n/2)+n/2

Q: Given two arrays a and b, where both arrays consisting of n positive integers. It is allowed to swap…

A: Python Solution: R=lambda:map(int,input().split()) t,=R() for _…

Q: Given an unsorted array Arr of size N of positive integers. One number 'A' from set {1, 2, ...N} is…

A: Since the programming language is not mentioned so I have used the C++ programming language. Given:…

Q: Let A be an array of numbers. In the maximum sub-array problem, your goal is to determine the…

A: - We need to highlight the code for maximum sum in a sub-array.

Q: Let's call an array Nums[0.. 2n] plateau-valley if Nums[0] < Nums[1] 2 Nums[2] s Nums[3] 2...s…

A: Plateau-valley array is representing an array in the form of a wave. The first element in the array…

Q: Write a program / Pseudo code / Algorithm that inserts the following numbers into two Separate…

A: Sample Response: //C++ program to computes the median of two array with all adjacent elements,…

Q: Given a 2-d array swap rows r and r+1, in place. Use NumPy indexing to solve this problem. No for…

A: Required:

Q: Consider the Bubble Sort algorithm we developed in class. It works, but it may waste some activity.…

A: Bubble sort is a kind of sorting algorithm where the sorting is done on the basis of comparing…

Q: You're given an array of N integers, and a number K. The maximum K-product of the array is the…

A: Note : As the programming language is not given so i am answering it in python language. Given:…

Q: Suppose you are given an array whose first n – f(n) elements are sorted, but whose last f(n) are…

A: If we tend to use investigation kind, it might take O(n^2) time because the given vary is of size…

Q: 1. Given a circular array of integers, do the following operations stepwise: Value ] 25 ] a + 15 ]…

A: TO REMOVE AN ELEMENT FROM CIRCULAR ARRAY BY LEFT / RIGHT SHIFTING.

Q: Let's say that B is an array with a size of n > 6 that has integers from 1 to n-5, inclusive, in it.…

A: Introduction: Complexity of algorithms: There are various methods for calculating algorithm…

Q: Given an unsorted array of size n. Array elements are in the range from 1 to n. One number from set…

A: Input the values into array Count the numbers from 1 to n If occurred for 0 times, display it as…

Q: Given an array arr] of n integers, construct an output array prod[] such that prodfi] is equal to…

A: the following is the python code for the given question

Q: Suppose an array A contains 8 elements as follows: 77, 33, X, 11, 88, Y, 6, 15 Where: element X =…

Q: You're given an array of N integers, and a number K. The maximum K-product of the array is the…

A: Coded using Java.

Q: You are given an array A[1 : n] which includes the scores of n players in a game. They are ranked in…

A: the answer is given below:-

Q: Imagine that we want to keep track of friendships between n people. We can do this with an array of…

Q: Question 2: Given two arrays a and b, where both arrays consisting of n positive integers. It is…

A: Brute force algorithm is - 1. Sort both arrays in ascending order a.sort() b.sort() 2 Swap minimum…

Q: Given a sorted array of positive integers. Your task is to rearrange the array elements…

A: Ans: Code: import java.util.Arrays; public class Main { static void rearrange(int[] arr, int…

Q: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m…

A: Step 2 This question explains about :

Q: Consider the same code, copied here for reference, but clearly with an array that has no valid…

A: The above problem can be solved by step-by-step writing and considering the values of all variables.…

Q: Implement the following addArrays function which takes as input two linear arrays of the same…

A: The above question is solved in step 2 :-

Q: You are given an array A[1 : n] which includes the scores of n players in a game. You are…

A: the answer is given below:-

Q: uppose the elements of an array A containing positive integers, denote the weights in kilograms. And…

A: Answer: Code in Python: def splitArray(arr): #leftsum is to store sum of array from 0 to ith…

Q: c) Using a counting method or otherwise, show that the number of array accesses of the 3-sum…

A: Suppose there are a total of N elements in the array, so try to find the number of array access of…

Q: You are given an array J[1 : n] which includes the scores of n players in a game. You are…

A: Solution

Q: Write a program to read 2D array of type integer and create another 1D array where element in index…

A: Algorithm Start Input the values into array If the element is more than 70 and even include it in…

Q: Given an Array A consisting of N balls. All the balls are either 'Red' or 'Green'. You can pick 4…

A: It is defined as a programming language and a platform. Java is a high level, robust,…

Q: f(x) = 1/(1+25x?) This is a somewhat famous function in numerical analysis because it displays…

A: Here is the answer:- here n=10 and given f(x) value.

Q: You are given a one dimensional array that may contain both positive and negative integers, find the…

A: Given : Array taken input from user. To Find: Maximum subarray sum in the array. Solution- Use…

Q: Given a triplet of integers (X , Y , Z), such that X ≤ Y and Y ≥ Z, we define f(X , Y , Z) to be (X…

A: Required: Given a triplet of integers (X , Y , Z), such that X ≤ Y and Y ≥ Z, we define f(X , Y , Z)…

Q: iven 2D 273 367 293 0 150 680 654 358 681 593 65 465 647 151 432 612 765 54 492 502 412 265 665 51…

A: Algorithm: Start Implement construct2D() to read a 2d array Create a class TwoD with Attributes a…

Q: Question 2: Given two arrays a and b, where both arrays consisting of n positive integers. It is…

A: ANSWER:- SEE STEP NO 2

Q: Given an integer n and an array a of length n, your task is to apply the following mutation to a:…

A: We need to write a program to mutate an array as per the given condition. * Language used is C

Q: You are given an array A of n integers as input. Also, you are given two integers, I and r, and you…

A: Input/Output Explanation: First line will contain n, the number of elements of array. Second line…

Q: Given an integer array Arr of size N the task is to find the count of elements whose value is…

A: A program is asked in c++ language for counting the number whose value is greater than all of its…

Q: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m…

A: the answer is given below:-

Q: Given an array of integers, return a new array such that each element at index i of the new array is…

A: We can find the product of all values and then divide the product with current element As it is…

Q: ample, given A = {4, 3, 1, 6, 3, 7, 1}, one can move From A[O] to A[1] From A[1] to A[2], A[0] or…

A: there will be a edge between (i, i+1) and we can also travel from i to j if A[i] = A[j] and i!=j ,…

Question

You have been given an array A of size N and an integer K. This array consists of N integers ranging from 1 to 10^7. Each element in this array is said to have a Special Weight. The special weight of an element a[i] is a[i]%K.

You now need to sort this array in Non-Increasing order of the weight of each element, i.e the element with the highest weight should appear first, then the element with the second highest weight and so on. In case two elements have the same weight, the one with the lower value should appear in the output first.

Input Format:

The first line consists of two space separated integers N and K. The next line consists of N space separated integers denoting the elements of array A.

Output Format:

Print N space separated integers denoting the elements of the array in the order in which they are required.

Constraints:

1≤N≤10^5

1≤A[i]≤10^7

1≤K≤10^7

Note:

You need to print the value of each element and not their weight.

SAMPLE INPUT
5 2
1 2 3 4 5

SAMPLE OUTPUT

1 3 5 2 4

Write a JAVA 7 program for this

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n. For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1]. If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
Let A be an array of numbers. In the maximum sub-array problem, your goal is to determine the sub-array A[x . . . y] of consecutive terms for which the sum of the entries is as large as possible. For example, if A = [−2, −3, 4, −1, −2, 1, 5, −3], the maximum sub-array is [4, −1, 2, 1, 5], and the largest possible sum is S = 4 − 1 − 2 + 1 + 5 = 7. Suppose A = [1, 2, −4, 8, 16, −32, 64, 128, −256, 512, 1024, −2048]. Determine S, the largest possible sum of a sub-array of A.
You're given an array arr. Apply the following algorithm to it: find intervals of consecutive prime numbers and consecutive non-prime numbers; replace each such interval with the sum of numbers in it; if the resulting array is different from the initial one, return to step 1, otherwise return the result. Input A non-empty integer array such that: -10000 ≤ arr[i] ≤ 10000 1 ≤ arr.length ≤ 1000 Output An integer array. Examples For arr = [1, 2, 3, 5, 6, 4, 2, 3] the result should be [21, 5]: [1, 2, 3, 5, 6, 4, 2, 3] --> [(1), (2 + 3 + 5), (6 + 4), (2 + 3)] --> [1, 10, 10, 5] [1, 10, 10, 5] --> [(1 + 10 + 10), (5)] --> [21, 5] For arr = [-3, 4, 5, 2, 0, -10] the result should be [1, 7, -10]: [-3, 4, 5, 2, 0, -10] --> [(-3 + 4), (5 + 2), (0 + -10)] --> [1, 7, -10] Solve it in C# please
Given an array of integers arr, sort the array by performing a series of pancake flips. In one pancake flip we do the following steps: Choose an integer k where 1 <= k <= arr.length. Reverse the sub-array arr[0...k-1] (0-indexed). For example, if arr = [3,2,1,4] and we performed a pancake flip choosing k = 3, we reverse the sub-array [3,2,1], so arr = [1,2,3,4] after the pancake flip at k = 3. Print out the k-values corresponding to a sequence of pancake flips that sort arr. Example 1: Input: arr = [3,2,4,1] Output: 4, 2, 4, 3 Explanation: We perform 4 pancake flips, with k values 4, 2, 4, and 3. Starting state: arr = [3, 2, 4, 1]. After 1st flip (k = 4): arr = [1, 4, 2, 3] After 2nd flip (k = 2): arr = [4, 1, 2, 3] After 3rd flip (k = 4): arr = [3, 2, 1, 4] After 4th flip (k = 3): arr = [1, 2, 3, 4], which is sorted. Another potential solution is: Output = 3, 4, 2, 3, 1, 2, 1, 1 with a similar explanation. All potential solutions that solve the problem are…
Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.
You are given an array in which every number from 1 to N appears precisely once with the exception of one. How is the missing number to be located in O(N) time and 0(1) space? What if two numbers were absent?
Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Change the array nums such that the first k elements of nums contain the elements which are not equal to val. The remaining elements of nums are not important as well as the size of nums. Return k. Example 1: Input: nums = [3,2,2,3], val = 3 Output: 2, nums = [2,2,_,_] Explanation: Your function should return k = 2, with the first two elements of nums being 2. It does not matter what you leave beyond the returned k (hence they are underscores). Example 2: Input: nums = [0,1,2,2,3,0,4,2], val = 2 Output: 5, nums = [0,1,4,0,3,_,_,_] Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.…