Find 7 Faster Than John Von Neumann
来源:互联网 发布:daz studio mac下载 编辑:程序博客网 时间:2024/06/09 19:20
描述:
It was said that when testing the first computer designed by von Neumann, people gave the following problem to both the legendary professor and the new computer: If the 4th digit of 2^n is 7, what is the smallest n? The machine and von Neumann began computing at the same moment, and von Neumann gave the answer first. Now you are challenged with a similar but more complicated problem: If the K-th digit of M^n is 7, what is the smallest n?
输入:
Each case is given in a line with 2 numbers: K and M (< 1,000).
输出:
For each test case, please output in a line the smallest n.
You can assume:
The answer always exist.
The answer is no more than 100.
样例输入:
3 2
4 2
4 3
样例输出:
15
21
11
题目大意:
给出k和m求出最小的n,使得m的n次方的第k位为7。
代码如下:
#include<stdio.h>#include<string.h>#define N 1005int n;int k,m;int asd[1005];void check(int q){while(asd[q]!=7) //判断第k位是否已经等于7 {for(int i=0;i<N;i++)//利用数组来存入大数一位一位的处理{asd[i]=asd[i]*m;}for(int i=0;i<N;i++){asd[i+1]=asd[i]/10+asd[i+1];//不断地将低位的数字除以10后加到高位去 asd[i]=asd[i]%10; }n++;}}int main(){while(scanf("%d %d",&k,&m)!=EOF){memset(asd,0,sizeof(asd));n=0;asd[0]=1;check(k-1);printf("%d\n",n); }return 0;}
- Find 7 Faster Than John Von Neumann
- zoj 3167 Find 7 Faster Than John Von Neumann
- zoj 3167 Find 7 Faster Than John Von Neumann
- ZOJ 3167 Find 7 Faster Than John Von Neumann
- ZOJ 3167 Find 7 Faster Than John Von Neumann
- zoj3167------------Find 7 Faster Than John Von Neumann 大数乘法
- ZOJ 3167 Find 7 Faster Than John Von Neumann
- zoj 3167 Find 7 Faster Than John Von Neumann
- 冯·诺依曼(John Von Neumann , 1903-1957
- 读《Jonathan von Neumann and EDVAC》
- cpu arch之risc, cisc ,von-neumann,harvard ,modified harvard
- stored-program Computer/von Neumann Architecture 冯诺依曼体系结构
- csdn faster than blogbus...
- Faster than C
- What is the difference between a von Neumann architecture and a Harvard architecture?
- StringBuilder faster than Sting add
- Why VMWare runs much FASTer than Bochs?
- What Makes Node.js Faster Than Java?
- 如何发挥人的长处
- Github简单分支操作——Git图形化客户端操作
- ⚔疯狂输出⚔数据的排序
- Makefile的嵌套调用
- FasterRCNN:提升网络的分类精度海康威视
- Find 7 Faster Than John Von Neumann
- 通过java往注册表里写入信息
- 指尖上行--移动前端开发进阶之路(读书笔记)----1.2页面调试
- myecplise 静态文件导入注意事项
- Retrofit网络请求数据的使用
- 空格替换
- Python && 机器学习基础
- pycharm格式化python代码快捷键Ctrl+Alt+L失效
- 解决faster-rcnn中训练时assert(boxes[:,2]>=boxes[:,0]).all()的问题