Deterministic Finite Automaton (DFA) can be used to check whether a number "num" is divisible by "k" or not. If the number is not divisible, remainder can also be obtained using DFA.
We consider the binary representation of 'num' and build a DFA with k states. The DFA has transition function for both 0 and 1. Once the DFA is built, we process ‘num’ over the DFA to get remainder.
Let us walk through an example. Suppose we want to check whether a given number 'num' is divisible by 3 or not. Any number can be written in the form: num = 3*a + b where 'a' is the quotient and 'b' is the remainder.
For 3, there can be 3 states in DFA, each corresponding to remainder 0, 1 and 2. And each state can have two transitions corresponding 0 and 1 (considering the binary representation of given 'num').
The transition function F(p, x) = q tells that on reading alphabet x, we move from state p to state q. Let us name the states as 0, 1 and 2. The initial state will always be 0. The final state indicates the remainder. If the final state is 0, the number is divisible.
In the above diagram, double circled state is final state.
1. When we are at state 0 and read 0, we remain at state 0.
2. When we are at state 0 and read 1, we move to state 1, why? The number so formed(1) in decimal gives remainder 1.
3. When we are at state 1 and read 0, we move to state 2, why? The number so formed(10) in decimal gives remainder 2.
4. When we are at state 1 and read 1, we move to state 0, why? The number so formed(11) in decimal gives remainder 0.
5. When we are at state 2 and read 0, we move to state 1, why? The number so formed(100) in decimal gives remainder 1.
6. When we are at state 2 and read 1, we remain at state 2, why? The number so formed(101) in decimal gives remainder 2.
The transition table looks like following:
state 0 1
_____________
0 0 1
1 2 0
2 1 2
Let us check whether 6 is divisible by 3?
Binary representation of 6 is 110
state = 0
1. state=0, we read 1, new state=1
2. state=1, we read 1, new state=0
3. state=0, we read 0, new state=0
Since the final state is 0, the number is divisible by 3.
Let us take another example number as 4
state=0
1. state=0, we read 1, new state=1
2. state=1, we read 0, new state=2
3. state=2, we read 0, new state=1
Since, the final state is not 0, the number is not divisible by 3. The remainder is 1.
Note that the final state gives the remainder.
We can extend the above solution for any value of k. For a value k, the states would be 0, 1, .... , k-1. How to calculate the transition if the decimal equivalent of the binary bits seen so far, crosses the range k? If we are at state p, we have read p (in decimal). Now we read 0, new read number becomes 2*p. If we read 1, new read number becomes 2*p+1. The new state can be obtained by subtracting k from these values (2p or 2p+1) where 0 <= p < k.
Based on the above approach, following is the working code:
C++
#include <bits/stdc++.h>
using namespace std;
// Function to build DFA for divisor k
void preprocess(int k, int Table[][2])
{
int trans0, trans1;
// The following loop calculates the
// two transitions for each state,
// starting from state 0
for (int state = 0; state < k; ++state)
{
// Calculate next state for bit 0
trans0 = state << 1;
Table[state][0] = (trans0 < k) ?
trans0 : trans0 - k;
// Calculate next state for bit 1
trans1 = (state << 1) + 1;
Table[state][1] = (trans1 < k) ?
trans1 : trans1 - k;
}
}
// A recursive utility function that
// takes a 'num' and DFA (transition
// table) as input and process 'num'
// bit by bit over DFA
void isDivisibleUtil(int num, int* state,
int Table[][2])
{
// process "num" bit by bit
// from MSB to LSB
if (num != 0)
{
isDivisibleUtil(num >> 1, state, Table);
*state = Table[*state][num & 1];
}
}
// The main function that divides 'num'
// by k and returns the remainder
int isDivisible (int num, int k)
{
// Allocate memory for transition table.
// The table will have k*2 entries
int (*Table)[2] = (int (*)[2])malloc(k*sizeof(*Table));
// Fill the transition table
preprocess(k, Table);
// Process ‘num’ over DFA and
// get the remainder
int state = 0;
isDivisibleUtil(num, &state, Table);
// Note that the final value
// of state is the remainder
return state;
}
// Driver Code
int main()
{
int num = 47; // Number to be divided
int k = 5; // Divisor
int remainder = isDivisible (num, k);
if (remainder == 0)
cout << "Divisible\n";
else
cout << "Not Divisible: Remainder is "
<< remainder;
return 0;
}
// This is code is contributed by rathbhupendra
#include <stdio.h>
#include <stdlib.h>
// Function to build DFA for divisor k
void preprocess(int k, int Table[][2])
{
int trans0, trans1;
// The following loop calculates the two transitions for each state,
// starting from state 0
for (int state=0; state<k; ++state)
{
// Calculate next state for bit 0
trans0 = state<<1;
Table[state][0] = (trans0 < k)? trans0: trans0-k;
// Calculate next state for bit 1
trans1 = (state<<1) + 1;
Table[state][1] = (trans1 < k)? trans1: trans1-k;
}
}
// A recursive utility function that takes a 'num' and DFA (transition
// table) as input and process 'num' bit by bit over DFA
void isDivisibleUtil(int num, int* state, int Table[][2])
{
// process "num" bit by bit from MSB to LSB
if (num != 0)
{
isDivisibleUtil(num>>1, state, Table);
*state = Table[*state][num&1];
}
}
// The main function that divides 'num' by k and returns the remainder
int isDivisible (int num, int k)
{
// Allocate memory for transition table. The table will have k*2 entries
int (*Table)[2] = (int (*)[2])malloc(k*sizeof(*Table));
// Fill the transition table
preprocess(k, Table);
// Process ‘num’ over DFA and get the remainder
int state = 0;
isDivisibleUtil(num, &state, Table);
// Note that the final value of state is the remainder
return state;
}
// Driver program to test above functions
int main()
{
int num = 47; // Number to be divided
int k = 5; // Divisor
int remainder = isDivisible (num, k);
if (remainder == 0)
printf("Divisible\n");
else
printf("Not Divisible: Remainder is %d\n", remainder);
return 0;
}
// Java program to implement the approach
import java.util.*;
class GFG {
// Function to build DFA for divisor k
static void preprocess(int k, int[][] Table)
{
int trans0, trans1;
// The following loop calculates the
// two transitions for each state,
// starting from state 0
for (int state = 0; state < k; ++state)
{
// Calculate next state for bit 0
trans0 = state << 1;
Table[state][0]
= (trans0 < k) ? trans0 : trans0 - k;
// Calculate next state for bit 1
trans1 = (state << 1) + 1;
Table[state][1]
= (trans1 < k) ? trans1 : trans1 - k;
}
}
// A recursive utility function that
// takes a 'num' and DFA (transition
// table) as input and process 'num'
// bit by bit over DFA
static int isDivisibleUtil(int num, int state,
int[][] Table)
{
// process "num" bit by bit
// from MSB to LSB
if (num != 0) {
state = isDivisibleUtil(num >> 1, state, Table);
state = Table[state][num & 1];
}
return state;
}
// The main function that divides 'num'
// by k and returns the remainder
static int isDivisible(int num, int k)
{
// Allocate memory for transition table.
// The table will have k*2 entries
int[][] Table = new int[k][2];
for (int i = 0; i < k; i++) {
Table[i][0] = 0;
Table[i][1] = 0;
}
// Fill the transition table
preprocess(k, Table);
// Process ‘num’ over DFA and
// get the remainder
int state = 0;
state = isDivisibleUtil(num, state, Table);
// Note that the final value
// of state is the remainder
return state;
}
// Driver Code
public static void main(String[] args)
{
int num = 47; // Number to be divided
int k = 5; // Divisor
int remainder = isDivisible(num, k);
if (remainder == 0)
System.out.println("Divisible");
else
System.out.println(
"Not Divisible: Remainder is " + remainder);
}
}
// This is code contributed by phasing17
# Python3 program to implement the approach
# Function to build DFA for divisor k
def preprocess(k, Table):
# The following loop calculates the
# two transitions for each state,
# starting from state 0
for state in range(k):
# Calculate next state for bit 0
trans0 = state << 1
if (trans0 < k):
Table[state][0] = trans0
else:
Table[state][0] = trans0 - k
# Calculate next state for bit 1
trans1 = (state << 1) + 1
if trans1 < k:
Table[state][1] = trans1
else:
Table[state][1] = trans1 - k
# A recursive utility function that
# takes a 'num' and DFA (transition
# table) as input and process 'num'
# bit by bit over DFA
def isDivisibleUtil(num, state, Table):
# process "num" bit by bit
# from MSB to LSB
if (num != 0):
state = isDivisibleUtil(num >> 1, state, Table)
state = Table[state][num & 1]
return state
# The main function that divides 'num'
# by k and returns the remainder
def isDivisible(num, k):
# Allocate memory for transition table.
# The table will have k*2 entries
Table = [None for i in range(k)]
for i in range(k):
Table[i] = [0, 0]
# Fill the transition table
preprocess(k, Table)
# Process ‘num’ over DFA and
# get the remainder
state = 0
state = isDivisibleUtil(num, state, Table)
# Note that the final value
# of state is the remainder
return state
# Driver Code
num = 47 # Number to be divided
k = 5 # Divisor
remainder = isDivisible(num, k)
if (remainder == 0):
print("Divisible")
else:
print("Not Divisible: Remainder is", remainder)
# This is code contributed by phasing17
// C# program to implement the approach
using System;
class GFG
{
// Function to build DFA for divisor k
static void preprocess(int k, int[, ] Table)
{
int trans0, trans1;
// The following loop calculates the
// two transitions for each state,
// starting from state 0
for (int state = 0; state < k; ++state) {
// Calculate next state for bit 0
trans0 = state << 1;
Table[state, 0]
= (trans0 < k) ? trans0 : trans0 - k;
// Calculate next state for bit 1
trans1 = (state << 1) + 1;
Table[state, 1]
= (trans1 < k) ? trans1 : trans1 - k;
}
}
// A recursive utility function that
// takes a 'num' and DFA (transition
// table) as input and process 'num'
// bit by bit over DFA
static int isDivisibleUtil(int num, int state,
int[, ] Table)
{
// process "num" bit by bit
// from MSB to LSB
if (num != 0) {
state = isDivisibleUtil(num >> 1, state, Table);
state = Table[state, num & 1];
}
return state;
}
// The main function that divides 'num'
// by k and returns the remainder
static int isDivisible(int num, int k)
{
// Allocate memory for transition table.
// The table will have k*2 entries
int[, ] Table = new int[k, 2];
for (int i = 0; i < k; i++) {
Table[i, 0] = 0;
Table[i, 1] = 0;
}
// Fill the transition table
preprocess(k, Table);
// Process ‘num’ over DFA and
// get the remainder
int state = 0;
state = isDivisibleUtil(num, state, Table);
// Note that the final value
// of state is the remainder
return state;
}
// Driver Code
public static void Main(string[] args)
{
int num = 47; // Number to be divided
int k = 5; // Divisor
int remainder = isDivisible(num, k);
if (remainder == 0)
Console.WriteLine("Divisible");
else
Console.WriteLine("Not Divisible: Remainder is "
+ remainder);
}
}
// This is code contributed by phasing17
// JavaScript program to implement the approach
// Function to build DFA for divisor k
function preprocess(k, Table)
{
let trans0, trans1;
// The following loop calculates the
// two transitions for each state,
// starting from state 0
for (let state = 0; state < k; ++state)
{
// Calculate next state for bit 0
trans0 = state << 1;
Table[state][0] = (trans0 < k) ?
trans0 : trans0 - k;
// Calculate next state for bit 1
trans1 = (state << 1) + 1;
Table[state][1] = (trans1 < k) ?
trans1 : trans1 - k;
}
}
// A recursive utility function that
// takes a 'num' and DFA (transition
// table) as input and process 'num'
// bit by bit over DFA
function isDivisibleUtil(num, state, Table)
{
// process "num" bit by bit
// from MSB to LSB
if (num != 0)
{
state = isDivisibleUtil(num >> 1, state, Table);
state = Table[state][num & 1];
}
return state;
}
// The main function that divides 'num'
// by k and returns the remainder
function isDivisible (num, k)
{
// Allocate memory for transition table.
// The table will have k*2 entries
Table = new Array(k);
for (let i = 0; i < k; i++)
Table[i] = [0, 0];
// Fill the transition table
preprocess(k, Table);
// Process ‘num’ over DFA and
// get the remainder
let state = 0;
state = isDivisibleUtil(num, state, Table);
// Note that the final value
// of state is the remainder
return state;
}
// Driver Code
let num = 47; // Number to be divided
let k = 5; // Divisor
let remainder = isDivisible (num, k);
if (remainder == 0)
console.log("Divisible");
else
console.log("Not Divisible: Remainder is " + remainder);
// This is code contributed by phasing17
Output:
Not Divisible: Remainder is 2
Time Complexity: O(k)
DFA based division can be useful if we have a binary stream as input and we want to check for divisibility of the decimal value of stream at any time.
Related Articles:
Check divisibility in a binary stream
Check if a stream is Multiple of 3
This article is compiled by Aashish Barnwal and reviewed by GeeksforGeeks team.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem