1282 - Leading and Trailing
来源:互联网 发布:linux下装oracle 11g 编辑:程序博客网 时间:2024/06/06 04:03
1282 - Leading and Trailing
Description
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
#include<stdio.h>#include<math.h>#define ll __int64#include<algorithm>using namespace std;ll QuackMod(ll a,ll b,ll mod) { ll ans;if(!b)return 1;ans=QuackMod(a*a%mod,b/2,mod);if(b&1)ans=ans*a%mod;return ans;}int main() {int t;scanf("%d",&t);for(int j=1; j<=t; j++) {ll n,k;scanf("%I64d%I64d",&n,&k);int strat=(int)pow(10.0,2.0+fmod(k*log10(n*1.0),1.0));int end=(int)QuackMod(n,k,1000);printf("Case %d: %d %03d\n",j,strat,end);}return 0;}
- 1282 - Leading and Trailing
- lightOJ 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- lightoj 1282 Leading and Trailing
- Lightoj 1282 (Leading and Trailing)
- 【Lightoj 1282 Leading and Trailing】
- LightOJ 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- lightoj 1282 Leading and Trailing
- LightOJ 1282 Leading and Trailing
- 【Light oj】1282 - Leading and Trailing
- lightoj 1282 - Leading and Trailing 【数学】
- LightOJ - 1282 Leading and Trailing 对数转换
- E - Leading and Trailing Light oj 1282
- Light-oj 1282 - Leading and Trailing
- android AndroidManifenst.xml中supportsRtl的用法
- CentOS下面定时删除N天前的文件
- 生于忧患而死于安乐:程序员如何走出自己的安逸环境
- qtreewidgetitem选中背景颜色解决
- 理解JavaScript中的作用域和上下文
- 1282 - Leading and Trailing
- HTTP协议头
- [树链剖分 线段树] BZOJ 4127 Abs
- iOS 时间 相关知识
- 多线程还是多进程的选择及区别
- BZOJ3640 JC的小苹果
- leetcode_c++:树:Unique Binary Search Trees(096)
- [瓶颈生成树] BZOJ 2429 [HAOI2006]聪明的猴子
- 深入理解PHP7之zval