最少乘法次数 http://acm.nyist.net/JudgeOnline/problem.php?pid=46
2013-08-19 16:01
369 查看
最少乘法次数
时间限制:1000 ms | 内存限制:65535 KB难度:3
描述
给你一个非零整数,让你求这个数的n次方,每次相乘的结果可以在后面使用,求至少需要多少次乘。如24:2*2=22(第一次乘),22*22=24(第二次乘),所以最少共2次;
输入第一行m表示有m(1<=m<=100)组测试数据;
每一组测试数据有一整数n(0<n<=10000);输出输出每组测试数据所需次数s;样例输入
3 2 3 4
样例输出
1 2 2
#include<stdio.h> int main() { int n; scanf("%d",&n); while(n--) { int m,count=1; scanf("%d",&m); if(m<=2) count=m/2; else { while(m!=2) { if(m%2==0) { count++; m/=2; } else { count++; m-=1; } } } printf("%d\n",count); } return 0; }
其实就是判断奇偶数的问题,只不过2是一个界点。
相关文章推荐
- 数数http://acm.nyist.net/JudgeOnline/problem.php?pid=198
- nyoj_532_http://acm.nyist.net/JudgeOnline/problem.php?pid=532
- 独木舟上的旅行http://acm.nyist.net/JudgeOnline/problem.php?pid=71
- http://acm.nyist.net/JudgeOnline/problem.php?pid=128&前缀式计算
- 街区最短路径问题 http://acm.nyist.net/JudgeOnline/problem.php?pid=7
- 最小点覆盖集&&http://acm.nyist.net/JudgeOnline/problem.php?pid=237
- 导弹拦截&&http://acm.nyist.net/JudgeOnline/problem.php?pid=79
- 括号配对问题http://acm.nyist.net/JudgeOnline/problem.php?pid=2
- http://acm.nyist.net/JudgeOnline/problem.php?pid=90
- 快速查找素数 http://acm.nyist.net/JudgeOnline/problem.php?pid=187
- http://acm.nyist.net/JudgeOnline/problem.php?pid=115&&Dijkstra城市平叛
- http://acm.nyist.net/JudgeOnline/problem.php?pid=401&&简单的博弈论
- 中缀式变后缀式&&http://acm.nyist.net/JudgeOnline/problem.php?pid=467
- http://acm.nyist.net/JudgeOnline/problemrank.php?pid=525
- 奇怪的排序 http://acm.nyist.net/JudgeOnline/problem.php?pid=540
- http://acm.nyist.net/JudgeOnline/problem.php?pid=239
- http://acm.nyist.net/JudgeOnline/problem.php?pid=119&&Rmq
- http://acm.nyist.net/JudgeOnline/problem.php?pid=517
- hdu1016 (素数环)(深度优先搜索)另附:http://acm.nyist.net/JudgeOnline/problem.php?pid=488
- http://acm.nyist.net/JudgeOnline/problem.php?pid=510