Dose This True ????????????
-
So Dose It True ????????????? i write this code to find this formula when the number is too big result = pow( base , power ) % mod long MODLD( long base , long power , long mod ) { long result = base ; long i = power ; if( i % 2 != 0 ) { i-- ; } for( ; i > 1 ; ) { result = ( result * result ) % mod ; // cout<
-
So Dose It True ????????????? i write this code to find this formula when the number is too big result = pow( base , power ) % mod long MODLD( long base , long power , long mod ) { long result = base ; long i = power ; if( i % 2 != 0 ) { i-- ; } for( ; i > 1 ; ) { result = ( result * result ) % mod ; // cout<
What is the problem? We Believe in Excellence www.aqueelmirza.cjb.net
-
So Dose It True ????????????? i write this code to find this formula when the number is too big result = pow( base , power ) % mod long MODLD( long base , long power , long mod ) { long result = base ; long i = power ; if( i % 2 != 0 ) { i-- ; } for( ; i > 1 ; ) { result = ( result * result ) % mod ; // cout<
Stephen has proved something to your question yesterday ...
Maxwell Chen