You are given a positive integer . You can perform the following operation on it atmost once :Choose a single digit from the number and change it to any digit you want from to .Your task is to generate the largest number such that and is a multiple of . If no such exists, print .Input FormatFirst line of input contains an integer , denoting the number of testcases lines of input follow- where each line contains a number .Constraints There are no leading zeroes in denotes the number of digits in the number .Please note that might not fit in the Long Long Int rangeOutput FormatFor each test case - print the value of if it exists; else print .Sample Input 0334999889Sample Output 084999-1Explanation 0In the test case, change the digit to to obtain the largest number possibleIn the test case, changing any digit in would lead to a lesser number so it's optimal to leave it as it is - as is already divisble by In the test case, it is impossible to generate a such that it is greater than or equal to and divisible by by changing atmost one digit of . Hence, we print .Sample Input 118292849184018401939169Sample Output 18792849184018401939169Explanation 1By changing the digit of to , we get the largest number possible which is divisible by .
Question
You are given a positive integer . You can perform the following operation on it atmost once :Choose a single digit from the number and change it to any digit you want from to .Your task is to generate the largest number such that and is a multiple of . If no such exists, print .Input FormatFirst line of input contains an integer , denoting the number of testcases lines of input follow- where each line contains a number .Constraints There are no leading zeroes in denotes the number of digits in the number .Please note that might not fit in the Long Long Int rangeOutput FormatFor each test case - print the value of if it exists; else print .Sample Input 0334999889Sample Output 084999-1Explanation 0In the test case, change the digit to to obtain the largest number possibleIn the test case, changing any digit in would lead to a lesser number so it's optimal to leave it as it is - as is already divisble by In the test case, it is impossible to generate a such that it is greater than or equal to and divisible by by changing atmost one digit of . Hence, we print .Sample Input 118292849184018401939169Sample Output 18792849184018401939169Explanation 1By changing the digit of to , we get the largest number possible which is divisible by .
Solution
The problem is asking to find the largest number that is divisible by 3 by changing at most one digit from the given number. If it's not possible, then print -1.
Here are the steps to solve this problem:
-
First, we need to check if the given number is already divisible by 3. If it is, then we don't need to change any digit and we can print the number as it is.
-
If the number is not divisible by 3, then we need to find a digit that we can change to make the number divisible by 3. We can do this by iterating over the digits of the number from left to right.
-
For each digit, we calculate the remainder of the number when divided by 3 after changing the digit to 9. If the remainder is 0, then we have found a digit that we can change to make the number divisible by 3.
-
We replace the digit with 9 and print the new number.
-
If we have iterated over all the digits and haven't found a digit that we can change to make the number divisible by 3, then we print -1.
This algorithm works because changing a digit to 9 will always result in the largest possible number. And checking the remainder when divided by 3 ensures that the new number is divisible by 3.
Similar Questions
ai is creating a program to find the maximum number from the given two integers using pointers.Help him with the task.Input format :The input consists of two space-separated integers.Output format :The output prints the maximum number.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ input integers ≤ 100Sample test cases :
Single File Programming QuestionProblem StatementPaul is working on a program to manipulate 4-digit numbers. Write a program for him toRemove the last digit.Print the resulting number.Add 1 to the resulting number.Print the result.Note: This question helps in implementing logic for company-specific questions.Input format :The input consists of an integer N, representing the 4-digit number.Output format :The output prints the modified numbers, separated by space.Refer to the sample output for formatting specifications.Code constraints :1000 ≤ N ≤ 9999Sample test cases :Input 1 :1000Output 1 :100 101Input 2 :5896Output 2 :589 590Input 3 :9999Output 3 :999 1000
Single File Programming QuestionProblem StatementYou are given a positive integer X. Write a simple program to find the second largest digit in the given number X.Example 1:Input: X = 9765Output: 7Explanation: The second largest digit in 9765 is 7.Example 2:Input: X = 11Output: -1Explanation: If there is no second-largest digit found in the given number, print -1.Note: This question was asked in the Wipro coding test.Input format :The input consists of a positive integer X.Output format :The output prints an integer, representing the second largest digit in the given number X.If there is no second largest digit, the output prints "-1".Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:500 ≤ X ≤ 106Sample test cases :Input 1 :99856Output 1 :8Input 2 :555Output 2 :-1Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.
Given an array of integers, find the largest number that can be constructed by concatenating all the elements of the given array.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines. The first line of each test case contains N - the size of the array and the second line contains N integers - the elements of the array.Output FormatFor each test case, print the largest number that can be constructed by concatenating all the elements of the given array, separated by a new line.Constraints1 <= T <= 10001 <= N <= 10000 <= ar[i] <= 1000ExampleInput3849 73 58 30 72 44 78 23469 9 57 60240 4Output78737258494430239696057440
Even SplitGiven a number N, check if you can split the number into 2 non-zero even parts.InputFirst line of input contains T - number of test cases. Its followed by T lines, each line contains a single integer N.OutputFor each test case, print "Yes" if you can split the number into 2 non-zero even parts, "No" otherwise, separated by new line.Constraints1 <= T <= 1050 <= N <= 1018ExampleInput281OutputYesNoExplanationTest Case 1You can split 8 as 4,4 or 6,2.Test Case 2You cannot split 1 into 2 even parts.
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.