10061 - How many zero's and how many digits ?
来源:互联网 发布:mac 备份照片图库 编辑:程序博客网 时间:2024/06/05 05:29
#include <stdio.h>#include <math.h>#define PI 3.14159265#define E 2.718281828459 int numofdigit(int n, int b){ double t; int i; t = 0.0; for(i = 2; i <= n; i++){ t += log10(i)/log10(b); } t += 1E-10; printf("%lf\n", t); return (int)t+1;}int numofzero(int n, int b, int prime[]){ int i, j, t, m, k, min, a[200], p[200], d[200]; t = b; for(i = 0; i < 200; i++){ a[i] = 0; d[i] = 0; } for(i = 0; i < 200 && t > 1; i++){ while(t % prime[i] == 0){ a[i]++; t /= prime[i]; } } k = 0; m = 0; for(j = 0; j < i; j++){ if(a[j] != 0){ p[k++] = prime[j]; a[m++] = a[j]; } } for(i = 2; i <= n; i++){ t = i; for(j = 0; j < m && t > 1; j++){ while(t % p[j] == 0){ d[j]++; t /= p[j]; } } } min = d[0]/a[0]; for(i = 1; i < m; i++){ t = d[i]/a[i]; if(min > t) min = t; } return min;}int main(){ int i, j; int n, b; int prime[1000]; for(i = 0; i < 1000; i++) prime[i] = 0; for(i = 2; i*i < 1000; i++){ if(prime[i] == 0){ for(j = i*i; j < 1000; j+= i) prime[j] = 1; } } j = 0; for(i = 2; i < 1000; i++){ if(prime[i] == 0) prime[j++] = i; } while(scanf("%d %d", &n, &b) != EOF){ printf("%d %d\n", numofzero(n, b, prime), numofdigit(n, b)); } return 0;}
0 0
- uva 10061 - How many zero's and how many digits ?
- uva 10061 - How many zero's and how many digits ?
- 10061 - How many zero's and how many digits ?
- UVa 10061 - How many zero's and how many digits ?
- UVA 10061 How many zero's and how many digits ?
- uva 10061 - How many zero's and how many digits ?
- 10061 - How many zero's and how many digits ?
- UVa 10061: How many zero's and how many digits?
- uva 10061 - How many zero's and how many digits
- uva 10061 How many zero's and how many digits ?
- 10061 - How many zero's and how many digits ?
- 10061 - How many zero's and how many digits ?
- uva 10061: How many zero's and how many digits?
- UVa 10061 - How many zero's and how many digits ?
- UVa 10061 - How many zero's and how many digits ?
- UVA 10061 How many zero's and how many digits ?
- UVA - 10061 How many zero's and how many digits ?
- 10061 - How many zero's and how many digits ?
- 黑马程序员---java学习笔记之java加强(一)
- nginx web缓存配置
- 深入继承 - 抽象类和接口
- 设计模式之-单例模式
- 被废弃的dispatch_get_current_queue
- 10061 - How many zero's and how many digits ?
- 你从一开始就不该来
- libevent源码分析--epoll中的几个函数 epoll_init epoll_add epoll_dispatch
- .net文件上传
- http://wireless.kernel.org/80211books/
- 静态链接库与动态链接库
- Tcl/Tk快速入门
- 点滴:Android SQLite3 更多【转】
- java实现 邮件抄送,密送,多个附件 发送