FINDING MODULO INVERSE USING FERMAT LITTLE THEOREM

-

 


Comments

Post a Comment

Popular posts from this blog

CODECHEF CONTEST WRITEUP (RANGEASSIGN DIV 4)

-
 Logic =>      We can have atmost 2 distinct numbers if we have 1 distinct number then whole array is same or arr[0] == arr[n-1] [1,1,1,1] = [1,1,1,1] = [1] [1,2,3,1] = [1,1,1,1] = [1] If we have 2 distinct number then whole array then array will be divided into two parts =>  [1,2,3,1,5,6,8,5] = [1,1,1,1,5,5,5,5] = [1,5]     Conditions => if a[0] == a[n-1] then yes else  for(int i = 1 ; i < n ; i++){ if(arr[0] == arr[i] & arr[i+1] == arr[n-1] then YES then NO CODE =  # include < stdio.h > # include < stdlib.h > int main ( void ) {         int t ;     scanf (" %d ", & t );         while ( t -- ){                 int n ;         scanf (" %d ", & n );                 int arr [ n ];         for ( int i = 0 ; i < n ; i ++ ){ ...
Read more

How functions work in low level ?

-
Image
  BY USING PROCESSOR REGISTERS     Arguments that we pass to functions and results given by functions are nothing but parameters and the exchange of these data is called parameter passing. Parameter passing can be done by processor registers, processor stack, or by using memory stack.     What we will do is we will use registers 2,3,4,5 for parameter passing and data manipulation, but this is good when we require fewer parameters but when the number of parameters increases we cant use processor registers as these registers are limited.   BY USING PROCESSOR STACK     The address of the start of the array and the number of elements in the array are pushed in the stack and adding function is called when adding a function called this function computes the sum and places the result on the stack.          As the subroutine uses 4 registers it needs to save the content of these 4 registers somewhere so it pushes the content of al...
Read more