Name: Addition Under Modulo DSA Problem
Uploaded: 2024-05-08T15:48:59Z
Duration: 4 min 35 s

Given three numbers A, B, and M. The task is to print the sum of A and B under modulo M.

Examples:

Input: a = 10, b = 20, m = 3
Output: 0
Explanation: (10 + 20) % 3 = 30 % 3 = 0

Input: a = 100, b = 13, m = 107
Output: 6

Approach: To solve the problem follow the below idea:

Add the two given numbers A and B and print their sum under modulo M.

Below is the implementation of the above approach:

C++

// C++ program for sum of two
// numbers modulo M
#include <bits/stdc++.h>
using namespace std;

// Function to return summation mod m
int sum(int a, int b, int m)
{
    // add two numbers
    int s = a + b;

    // do a mod with m
    s = s % m;

    return s;
}

// Driver Code
int main()
{
    int a = 20, b = 10, m = 3;

    // Function Call
    cout << sum(a, b, m);
    return 0;
}

Java

// JAVA program for addition of
// two numbers modulo m

import java.io.*;

class GFG {

    static int sum(int a, int b, int m)
    {
        // add two numbers
        int s = a + b;

        // do mod with m
        s = s % m;
        return s;
    }

    // Driver Code
    public static void main(String[] args)
    {
        int a = 10, b = 20, m = 3;

        // Function Call
        System.out.println("The sum = " + sum(a, b, m));
    }
}

Python

# Python program for addition of
# two numbers modulo m


def summ(a, b, m):

    # add two number
    s = a + b

    # do mod with m
    s = s % m
    return s


# Driver Code
if __name__ == '__main__':
    a = 20
    b = 10
    m = 3

# Function Call
print summ(a, b, m)

// C# program for addition of
// two numbers modulo m
using System;

class GFG {

    static int sum(int a, int b, int m)
    {

        // add two numbers
        int s = a + b;

        // do mod with m
        s = s % m;
        return s;
    }

    // Driver Code
    public static void Main()
    {
        int a = 10, b = 20, m = 3;

        // Function Call
        Console.Write("The sum = " + sum(a, b, m));
    }
}

// This code is contributed by
// Smitha Dinesh Semwal

PHP

<?php
// Php program for sum of two
// numbers modulo M

// Function to return summation mod m
function sum($a, $b, $m)
{
    // add two numbers
    $s = $a + $b;

    // do a mod with m
    $s = $s % $m;

    return $s;
}

// Driver Code
$a = 20;
$b = 10;
$m = 3;

// Function Call
echo (sum($a, $b, $m));

// This code is contributed
// by Shivi_Aggarwal 
?>

JavaScript

<script>


// Javascript program for sum of two
// numbers modulo M

// Function to return summation mod m
function sum( a,  b,  m)
{
    // add two numbers
    let s = a + b;

    // do a mod with m
    s = s % m;

    return s;
}

    // driver code 
    let a = 20, b = 10, m = 3;
  
    // Function Call
    document.write(sum(a, b, m));
    
    // This code is contributed by Jana_Sayantan.
</script>

Output

Time complexity: O(1)
Auxiliary Space: O(1)

Sum of two numbers modulo M

Explore