You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.
Input
Input starts with an integer T (≤ 1000), denoting the number of test cases.
Each case starts with a line containing two integers: n (2 ≤ n < 231) and k (1 ≤ k ≤ 107).
Output
For each case, print the case number and the three leading digits (most significant) and three trailing digits (least significant). You can assume that the input is given such that nk contains at least six digits.
Sample Input
5
123456 1
123456 2
2 31
2 32
29 8751919
Sample Output
Case 1: 123 456
Case 2: 152 936
Case 3: 214 648
Case 4: 429 296
Case 5: 665 669
中文意思是输入两个数,M,N
求M的N次方的前三位数和最后3位数
用到了fmod函数
函数作用:fmod()函数:
头文件:#include<math.h>
C库函数。。。
fmod()用来对浮点数进行取模(求余),原型为:float fmod(float x)。
<

给定两个整数n和k,需要找到n的k次方的最高三位数和最低三位数。输入包含多个测试案例,每个案例给出n和k的值,保证结果至少有六位数。输出每个案例的编号及计算结果的前三位和后三位数字。
最低0.47元/天 解锁文章

被折叠的 条评论
为什么被折叠?



