424-Integer InquiryOne of the first users of BIT's new supercomputer was Chip Diller.He extended his exploration of powers of3to go from0 to333and he explored taking various sums of those numbers.``This supercomputer is great,''remarked Chip.``I only wish Timothy were here to see these results.''(Chip moved to a new apartment,once one became available on the third floor of the Lemon Sky apartments on Third Street.)InputThe input will consist of at most100lines of text,each of which contains a single VeryLongInteger.Each VeryLongInteger will be100or fewer characters in length,and will only contain digits(no VeryLongInteger will be negative).The final input line will contain a single zero on a line by itself.OutputYour program should output the sum of the VeryLongIntegers given in the input.Sample Input123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890Sample Output37037036703703703670370370367010106–ProductThe ProblemThe problem is to multiply two integers X,Y.(0<=X,Y<10250)The InputThe input will consist of a set of pairs of lines.Each line in pair contains one multiplyer.The OutputFor each input pair of lines the output line should consist one integer the product.Sample Input12122222222222222222222222222Sample Output144444444444444444444444444465–OverflowWrite a program that reads an expression consisting of two non-negative integer and an operator.Determine if either integer or the result of the expression is too large to be represented as a``normal''signed integer(type integer if you are working Pascal,type int if you are working in C).InputAn unspecified number of lines.Each line will contain an integer,one of the two operators+or*,and another integer. OutputFor each line of input,print the input followed by0-3lines containing as many of these three messages as are appropriate: ``first number too big'',``second number too big'',``result too big''.Sample Input300+39999999999999999999999+11Sample Output300+39999999999999999999999+11first number too bigresult too big748-ExponentiationProblems involving the computation of exact values of very large magnitude and precision are common.For example,the computation of the national debt is a taxing experience for many computer systems.This problem requires that you write a program to compute the exact value of Rn where R is a real number(0.0<R< 99.999)and n is an integer such that.InputThe input will consist of a set of pairs of values for R and n.The R value will occupy columns1through6,and the n value will be in columns8and9.OutputThe output will consist of one line for each line of input giving the exact value of Rn.Leading zeros and insignificant trailing zeros should be suppressed in the output.Sample Input95.123120.4321205.1234156.7592998.999101.010012Sample Output548815620517731830194541.899025343415715973535967221869852721.00000005148554641076956121994511276767154838481760200726351203835429763013462401 43992025569.92857370126648804114665499331870370751166629547672049395302429448126.76412102161816443020690903717327667290429072743629540498.1075960194566517745610440100011.12682503013196972066120110494-If We Were a Child AgainInput:standard inputOutput:standard outputTime Limit:7seconds“Oooooooooooooooh!If I could do the easy mathematics like my school days!!I can guarantee,that I’d not make any mistake this time!!”Says a smart university student!!But his teacher even smarter–“Ok!I’d assign you such projects in your software lab.Don’t be so sad.”“Really!!”-the students feels happy.And he feels so happy that he cannot see the smile in his teacher’s face.The ProblemThe first project for the poor student was to make a calculator that can just perform the basic arithmetic operations.But like many other university students he doesn’t like to do any project by himself.He just wants to collect programs from here and there.As you are a friend of him,he asks you to write the program.But,you are also intelligent enough to tackle this kind of people.You agreed to write only the(integer)division and mod(%in C/C++)operations for him.InputInput is a sequence of lines.Each line will contain an input number.One or more spaces.A sign(division or mod).Again spaces.And another input number.Both the input numbers are non-negative integer.The first one may be arbitrarily long. The second number n will be in the range(0<n<231).OutputA line for each input,each containing an integer.See the sample input and output.Output should not contain any extra space.Sample Input110/10099%102147483647/2147483647 2147483646%2147483647 Sample Output1912147483646。