phytn的专栏

Description Problems 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

描述 I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. A,B must be positive. 输入The first line of the input contains an integer T(1<=T<=20

Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.

Description The Problem   The 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 d

描述 现在给你两个数 n 和 p ，让你求出 p 的开 n 次方。 输入每组数据包含两个数n和p。当n和p都为0时表示输入结束。(1输出对于每个输出对用输出开方后的结果k（结果小于10^9）。样例输入 2 16 3 27 7 4357186184021382204544 0 0 样例输出 4 3 1234 #include #include int

Description The problem is to multiply two integers X, Y. (0 Input The input will consist of a set of pairs of lines. Each line in pair contains one multiplyer. Output For

描述 我们都知道如何计算一个数的阶乘，可是，如果这个数很大呢，我们该如何去计算它并输出它？ 输入输入一个整数m(0输出输出m的阶乘，并在输出结束之后输入一个换行符样例输入 50 样例输出 30414093201713378043612608166064768844377641568960512000000000000 #include using n

Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin

描述 给你两个很大的数，你能不能判断出他们两个数的大小呢？ 比如123456789123456789要大于-123456 输入每组测试数据占一行，输入两个不超过1000位的10进制整数a,b 数据保证输入的a,b没有前缀的0。 如果输入0 0表示输入结束。测试数据组数不超过10组 输出如果a>b则输出“a>b”，如果a 样例输入 11111111111111