Snippets Collections
import java.io.*;
import java.util.*;

class Solution
{
    
  public int modInverse(int a, int m)
    {
        for(int i=1; i<m; i++){
            if(a*i%m == 1)
                return i;
        }
        return -1;
    }
}

class Main {
	public static void main (String[] args) {
	    
	    //taking input using Scanner class
		Scanner sc=new Scanner(System.in);
		
		//taking testcases
		int T=sc.nextInt();
		
		while(T-->0)
		{
		    Solution  obj=new Solution ();
		    int a,m;
		      
            //taking input a and m
		    a=sc.nextInt();
		    m=sc.nextInt();
		  
            //calling function modInverse()
		    System.out.println(obj.modInverse(a,m));
		}
		
	}
}
star

Sun Feb 06 2022 02:13:52 GMT+0000 (Coordinated Universal Time) https://practice.geeksforgeeks.org/problems/modular-multiplicative-inverse-1587115620/1/?track=DSASP-Mathematics&batchId=190

#java #mathematics #gfg #geeksforgeeks #modularmultiplicativeinverse

Save snippets that work with our extensions

Available in the Chrome Web Store Get Firefox Add-on Get VS Code extension