C++ Program for Largest K digit number divisible by X

C++ Program for Largest K digit number divisible by X

Last Updated : 05 Dec, 2018

Integers X and K are given. The task is to find highest K-digit number divisible by X. Examples:

Input : X = 30, K = 3
Output : 990
990 is the largest three digit 
number divisible by 30.

Input : X = 7, K = 2
Output : 98

An efficient solution is to use below formula.

ans = MAX - (MAX % X)
where MAX is the largest K digit 
number which is  999...K-times

The formula works on simple school method division. We remove remainder to get the largest divisible number.

CPP

// CPP code to find highest K-digit number divisible by X
#include <bits/stdc++.h>
using namespace std;

// Function to compute the result
int answer(int X, int K)
{
    // Computing MAX
    int MAX = pow(10, K) - 1;

    // returning ans
    return (MAX - (MAX % X));
}

// Driver
int main()
{
    // Number whose divisible is to be found
    int X = 30;

    // Max K-digit divisible is to be found
    int K = 3;

    cout << answer(X, K);
}

Output:

Please refer complete article on Largest K digit number divisible by X for more details!

C++ Program for Largest K digit number divisible by X

kartik

Improve

Article Tags :

Practice Tags :

Mathematical

Similar Reads

C++ Program for Smallest K digit number divisible by X

Integers X and K are given. The task is to find the smallest K-digit number divisible by X. Examples: Input : X = 83, K = 5 Output : 10043 10040 is the smallest 5 digit number that is multiple of 83. Input : X = 5, K = 2 Output : 10 An efficient solution would be : Compute MIN : smallest K-digit num

C++ Program to Rotate digits of a given number by K

Given two integers N and K, the task is to rotate the digits of N by K. If K is a positive integer, left rotate its digits. Otherwise, right rotate its digits. Examples: Input: N = 12345, K = 2Output: 34512Â Explanation:Â Left rotating N(= 12345) by K(= 2) modifies N to 34512.Â Therefore, the required

Check if the square of a number is divisible by K or not

Given two integers, X and K, the task is to find if X2 is divisible by K or not. Here, both K and X can lie in the range [1,1018]. Examples: Input: X = 6, K = 9 Output: YES Explanation: Since 62 is equal to 36, which is divisible by 9. Input: X = 7, K = 21 Output: NO Explanation: Since 72 is equal t

Sum of last digit of all integers from 1 to N divisible by M

Given two integer N and N. The task is to compute the sum of last digit of all integers from 1 to N that is divisible by M. Examples: Input: N = 12, M = 1 Output: 48 Number divisible by M = 1 from 1 to 12 is : {1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 0 + 1 + 2} = 48 Input: N = 100, M = 3 Output: 153 App

Check if a large number is divisible by a number which is a power of 2

Given a large number in the form of a string str and a number K, the task is to check if the number formed by string str is divisible by the K or not, where K is a power of 2. Examples: Input: str = "5426987513245621541524288", num = 64 Output: Yes Explanation: Since log2(64) = 6, so the number form

Largest and smallest digit of a number

Given a number N. The task is to find the largest and the smallest digit of the number.Examples : Input : N = 2346 Output : 6 2 6 is the largest digit and 2 is smallestInput : N = 5 Output : 5 5 Approach: An efficient approach is to find all digits in the given number and find the largest and the sm

Find number formed in K steps by reducing N by 1 if last digit is 0 else divide by 10

Given two integers N and K. Perform the following type of operations on N: if the last digit of N is non-zero, decrease the number by one.if the last digit of N is zero, divide the number by 10 (i.e. remove the last digit). The task is to print the result after K such operations. Examples: Input: N

Count of sub-strings that are divisible by K

Given an integer K and a numeric string str (all the characters are from the range ['0', '9']). The task is to count the number of sub-strings of str that are divisible by K. Examples: Input: str = "33445", K = 11 Output: 3 Sub-strings that are divisible by 11 are "33", "44" and "3344" Input: str =

C++ Program to Find Largest Element in an Array

In this article, we will learn to write a C++ program to find the largest element in the given array arr of size N. The element that is greater than all other elements is the largest element in the array. Recommended PracticeHelp a Thief!!!Try It! One of the most simplest and basic approaches to fin

How to store a very large number of more than 100 digits in C++

Given an integer N in form of string str consisting of more than 100 digits, the task is to store the value for performing an arithmetic operation and print the given integer.Examples: Input: str = "54326789013892014531903492543267890138920145319034925432678901389201" Output: 54326789013892014531903