Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6454 |

@blackshadows | 6380 |

@mb1973 | 5710 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3709 |

@mantu_singh | 3556 |

@marius_valentin_dragoi | 3523 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1285 |

@gurshehzadsingh | 1052 |

@pritsahkar2000 | 812 |

@satyamchhatrala | 802 |

@nithinreddy3210 | 801 |

@iib2019024 | 745 |

@mohanreddy8847 | 704 |

@iamchaitanyahegde | 662 |

@workit | 646 |

@shafeeq3543 | 645 |

@AkashLahoty | 642 |

Complete Leaderboard |

Given two integers numbers N and K, the Geek wants you to find f(f(..........f(N))) K times, where f(x) = x XOR (x%10).

**Note:** XOR represents bitwise xor operation

**Input: **

1. The first line of the input contains a single integer* * **T** denoting the number of test cases. The description of **T** test cases follows.

2. The first line of each test case contains two integers** N **and **K.**

**Output:** For each test case, print** **the answer

**Constraints:**

1. 1 <= T <= 10

2. 1 <= N <= 10^{5}

3. 1 <= K <= 10^{9}

**Example:
Input:**

2

17 1

66 3

**Output:**

22

74

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Geek and Function |V

...