Code With RkVirus

 Source Code given below:- import random # this programme finds a number based on binary search logic guessNum = random.randint(0, 100) print("Try to guess the numbers! : ") chances = 10 for i in range(1, chances+1):     num = int(input())     if num > guessNum:         if num > guessNum + 10:             print("Your number is too large!")         else:             print("Your number is large.")     elif num < guessNum:         if num < guessNum - 10:             print("your number is too small!")         else:             print("your number is small.")     else:         print("^-^ ^-^ ^-^ ^-^ ^-^ ^-^\nCongratulations!! You won.\n^-^ ^-^ ^-^ ^-^ ^-^ ^-^")         break if i == 10:     ...

 Source Code given below:- from datetime import datetime try:     # function to return time     def tstamp():         time = str(datetime.now())         return time # taking dicision for input or display     todo = input("Input or Display ? : ")     ## user input block ##     if todo.lower() == "input":         name = input("Enter Your name : ")         with open(name+".txt", "a") as f:  # creating file with user name             eord = input("Choose \"1\" for Exercise and \"2\" for Diet : ") # eord - exer. or diet ,asking for type             # of input !!!!!!!!!//             f.write(tstamp()+"  ")  # writting time stamp with input             if eord == "1":                 f.wri...

Source Code given below:  #include <stdio.h> int reverse(int n); int main() {     int num;     printf("Enter your number : ");     scanf("%d",&num);     int res = reverse(num);     printf("Reverse of your number : %d\n", res);     return 0; } // method to reverse a number int reverse(int n) {     int rev = 0;     int ldigit;     while(n != 0)     {         ldigit = n % 10;         rev = rev*10 + ldigit;         n = n / 10;     }     return rev; }

The Power Function Source Code given below : #include <stdio.h> // prototype for power function int power(int b, int n); int main() {     int base, pow;     printf("Enter a number and its power : \n");     scanf("%d %d",&base, &pow);     int res = power(base, pow);     printf("%d raised to power %d is %d\n",base, pow, res);     return 0; } // power function using recursion int power(int b, int p) {     if(p == 0)  // base case         return 1;     else         return b*power(b,p-1);  // recursive block }