//by Bell /* #challenge from Chill Pill The russian peasant algorithm is an algorithm to do multiplications in a headache less fashion. https://m.wikihow.com/Multiply-Using-the-Russian-Peasant-Method Let's make a code to do multiplications using the russian peasant algorithm. Hint: bitwise shift operators(<< , >>) can be useful. Same with &1 even/odd biwise trick. oops too much info given. steps: 1-make a two columns table and put numbers in first row in each column, numbers that you want to multiply. 2-first column is doubled and second column is halved at every iteration. the second column number is always floored. each row contains the result of those iterations 3-keep iterating until the second column number is 1. 4-discard all the rows where the number in column 2 is even. 5-sum all other rows in column 1. the total is the result of the multiplication between the two original numbers. */ #include using namespace std; int main() { int i=-146, j=37, imult=0, isign=1, jsign=1; cout<<"Please, input two numbers"<>i>>j; cout<<"Result should be "<>31)-(-i>>31))? isign:-isign; i*=isign; jsign=(1 + (j>>31)-(-j>>31))? jsign:-jsign; j*=jsign; isign*=jsign; i=((j>>31)-(-j>>31))? i:0; j=((i>>31)-(-i>>31))? j:0; while(i>1){ //if(i%2!=0)imult+=j; //i/=2; //j*=2; //the next 3 lines can be substituted by the 3 previous ones if(i&1)imult+=j; i=i>>1; j=j<<1; }; imult+=j; cout<

RussianPeasantMultiplicationChallenge