Leading and Trailing LightOJ
来源:互联网 发布:淘宝可以货到付款吗? 编辑:程序博客网 时间:2024/05/19 06:50
题意
You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of
求
分析
1 最低三位,快速幂取模
2 最高三位 任取一个数 n ,有
,y 为t的小数部分 ,x 是n的位数,因为 n =
参考代码
int qpow(int n,int k,int m)//快速幂{ int ans = 1; LL nn = n; nn %= m; while(k>0) { if(k&1) ans =ans * nn % m; nn = nn * nn % m; k>>=1; } return ans;}int main(void){ std::ios::sync_with_stdio(false); int T; cin>>T; int kase = 0; // cout<<fmod(10.1,10); while(T--) { int n,k; cin>>n>>k; double tmp = (double)k*log10(1.0*n); tmp = fmod(tmp,1); tmp = pow(10,tmp); while(tmp<100) tmp *= 10; int ans1 = (int) tmp; int ans2 = qpow(n,k,1000); //cout<<"Case "<<++kase<<": "<<ans1<<" "<<ans2<<endl; printf("Case %d: %d %03d\n",++kase,ans1,ans2); } return 0;}
阅读全文
0 0
- lightoj Leading and Trailing
- Leading and Trailing LightOJ
- Leading and Trailing LightOJ
- Leading and Trailing LightOJ
- Leading and Trailing LightOJ
- 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
- lightoj 1282 - Leading and Trailing 【数学】
- JAVA引用类型强制类型转换
- java对象引用
- 单链表的归并排序:时间复杂度O(nlogn),空间复杂度O(1)
- 挑战nbc (noip2016)膜你赛Day1提高组
- java实现中缀转后缀,后缀计算值
- Leading and Trailing LightOJ
- 数组 forEach() 与map()的区别
- 解决:org.hibernate.exception.ConstraintViolationException: could not execute statement
- 自主移动机器人--简介
- MySQL left join优化
- 使用javascript 获取 data- 自定义属性
- spring-cloud-feign之spring-cloud-1.3.4(Dalston.SR3)-boot(1.5.6) 学习笔记
- Django学习(四)(视图与网址进阶)
- 比特币基础概念入门 1