Single File Programming QuestionProblem StatementLily is working on a program to find perfect numbers within a user-defined range. Create a program for her that helps find and display all the perfect numbers within a user-defined range a and b.A perfect number is a number for which the sum of its proper divisors (excluding the number itself) equals the number itselfAsk Lily for the starting and ending values (both inclusive) of the range and display the perfect numbers found.Note: This question helps in clearing technical coding tests for service-based companies.Input format :The input consists of two space-separated integers a and b, representing the starting and ending range, respectively.Output format :The output prints the perfect numbers present in the given range, separated by a space.If there are no perfect numbers present, the output prints "No perfect numbers".Refer to the sample output for formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:5 ≤ a < b ≤ 105Sample test cases :Input 1 :6 28Output 1 :6 28Input 2 :10 100000Output 2 :28 496 8128Input 3 :50 60Output 3 :No perfect numbers

Lily is working on a program to find perfect numbers within a user-defined range. Create a program for her that helps find and display all the perfect numbers within a user-defined range a and b.A perfect number is a number for which the sum of its proper divisors (excluding the number itself) equals the number itselfAsk Lily for the starting and ending values (both inclusive) of the range and display the perfect numbers found.Note: This question helps in clearing technical coding tests for service-based companies.Input format :The input consists of two space-separated integers a and b, representing the starting and ending range, respectively.Output format :The output prints the perfect numbers present in the given range, separated by a space.If there are no perfect numbers present, the output prints "No perfect numbers".Refer to the sample output for formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:5 ≤ a < b ≤ 105

Single File Programming QuestionProblem StatementBob is fascinated by Unitary Perfect Numbers and wants to create a program to check whether a given number is a Unitary Perfect Number or not. A Unitary Perfect Number is a positive integer where the sum of its proper divisors (excluding itself) equals the number itself.Help Bob by creating a program that takes a number as input and determines if it is a Unitary Perfect Number using pointers and a function named isUnitary.Example 1Input: 60Output:60 is a unitary perfect number.Explanation: The number 60 is a unitary perfect number, because 1, 3, 4, 5, 12, 15, and 20 are its proper unitary divisors, and 1 + 3 + 4 + 5 + 12 + 15 + 20 = 60.Example 2Input: 18 Output:18 is not a unitary perfect number.Explanation: The number 18 is not a unitary perfect number, because 1, 2, 3, 6, and 9 are its proper unitary divisors, and 1 + 2 + 3 + 6 + 9 = 21, which is not equal to 18. Input format :The input consists of an integer N, representing the number to be checked.Output format :If N is a Unitary Perfect Number, print "[N] is a unitary perfect number."Otherwise, print "[N] is not a unitary perfect number."Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ N ≤ 100Sample test cases :Input 1 :60Output 1 :60 is a unitary perfect number.Input 2 :18Output 2 :18 is not a unitary perfect number.Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.Marks : 10Negative Marks : 0WhitelistSet 1:isUnitarySet 2:*&

Write a program to check the given number is perfect or not ?

Input format :The input consists of a single line:The line contains an integer denoting n.The input will be read from the STDIN by the candidate.Output format :Print’1’ if n is a perfect number, else print the sum of the proper divisors of n.The output will be matched to the candidate’s output printed on STDOUT

Single File Programming QuestionProblem StatementOlivia is a curious mind exploring the world of digits. Create a simple program to assist Olivia in understanding the addition of the last two digits of a given number. Prompt Olivia to input an integer n, calculate, and display the sum of the last two digits.Input format :The input consists of an integer n.Output format :The output displays the sum of the last two digits of the input integer.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:10 ≤ n ≤ 105Sample test cases :Input 1 :10Output 1 :1Input 2 :231Output 2 :4Input 3 :7896Output 3 :15Input 4 :100000Output 4 :0Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.