hdu 1063 Exponentiation (高精度小数乘法)
来源:互联网 发布:mac隐藏文件夹命令 编辑:程序博客网 时间:2024/05/01 13:07
//大数继续,额,要吐了。
Problem Description
Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.
This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
Input
The input will consist of a set of pairs of values for R and n. The R value will occupy columns 1 through 6, and the n value will be in columns 8 and 9.
Output
The output will consist of one line for each line of input giving the exact value of R^n. Leading zeros should be suppressed in the output. Insignificant trailing zeros must not be printed. Don't print the decimal point if the result is an integer.
Sample Input
95.123 120.4321 205.1234 156.7592 998.999 101.0100 12
Sample Output
548815620517731830194541.899025343415715973535967221869852721.0000000514855464107695612199451127676715483848176020072635120383542976301346240143992025569.92857370126648804114665499331870370751166629547672049395302429448126.76412102161816443020690903717327667290429072743629540498.1075960194566517745610440100011.126825030131969720661201
Source
East Central North America 1988
高精度数,模拟乘法,
*********************/
Code:
#include <iostream>#include <string.h>#include <stdio.h>using namespace std;#define N 1000struct Bint{ int num[N]; //数值存储 int p;//整数位数 int del;//小数位数 int len;// 总的数位长度};int Find(char a,char str[])// 找小数点的位置,实际返回的是整数部分的位数{ int i,len = strlen(str); for(i = 0;i<len;i++) if(str[i]==a) return i; return len;// 整数时直接返回 长度}void print(struct Bint s)// 输出函数{ int i; /* if(s.p=1&&s.num[s.len-1]==0) s.p-=1; */ for(i = s.p+s.del-1;i>=s.del;i--) printf("%d",s.num[i]); if(s.del>0){ printf("."); for(i = s.del-1;i>=0;i--) printf("%d",s.num[i]); } printf("\n");}void trans(Bint &a,char str[])// 将输入的字符串形式的数 转换为结构体{ memset(a.num,0,sizeof(a.num)); int len = strlen(str); a.p = Find('.',str); a.del = (len==a.p)?0:(len-a.p-1);// 如果包含小数点则小数位数为 数的长度-整数位数-1 int i=0,k = 0,pa= a.p,l = len-1; while(str[i++]=='0'&&i<=pa)// 去除前导0 小数点前面的 0 也不需要保存 a.p--; while(str[l--]=='0'&&l>=pa)// 去除 后导 0 a.del--; for(i = pa+a.del;i>pa;i--)// 小数位 赋值 a.num[k++] = str[i]-'0'; for(i = pa-1;i>=pa-a.p;i--) a.num[k++] = str[i]-'0'; a.len = k;}Bint mul(Bint a,Bint b)// 模拟乘法,值存到结构体中{ Bint m; memset(m.num,0,sizeof(m.num)); int i,j; for(i = 0;i<a.len;i++) { for(j = 0;j<b.len;j++) { m.num[i+j]+=a.num[i]*b.num[j]; } } m.del = a.del+b.del; m.len = a.len+b.len-1; for(i = 0;i<m.len;i++) if(m.num[i]>=10) { m.num[i+1] += m.num[i]/10; m.num[i]%=10; } if(m.num[m.len]>0&&m.num[m.len]<10) m.len+=1; else if(m.num[m.len]>10) { m.num[m.len+1]+=m.num[m.len]/10; m.num[m.len]%=10; m.len+=2; } m.p = m.len-m.del; return m;}int main(){ char str[N]; Bint a,s; int n,i; while(scanf("%s%d",str,&n)!=EOF) { trans(a,str); trans(s,str); for(i = 1;i<n;i++) s = mul(s,a); print(s); } return 0;}
0 0
- hdu 1063 Exponentiation (高精度小数乘法)
- poj 1001 uva 748 Exponentiation(高精度小数乘法)
- HDOJ 1063 Exponentiation(小数高精度)
- hdu1063 Exponentiation 高精度小数
- hdu 1063 Exponentiation(java+高精度)
- HDU 1063 Exponentiation (高精度)
- POJ1001 Exponentiation 高精度乘法
- POJ1001 Exponentiation,高精度乘法
- poj_1001 Exponentiation 高精度乘法
- hdu 1063 Exponentiation 大数乘法
- HDU 1063 Exponentiation(大数乘法)
- poj 1001 (Exponentiation) 高精度乘法
- UVA 748 Exponentiation 高精度乘法
- 【POJ】 1001-Exponentiation 【高精度乘法】
- POJ 1001 Exponentiation 高精度乘法
- poj 1001 Exponentiation 高精度乘法
- JAVA hdu 1063 Exponentiation(高精度)
- HDU 1063 Exponentiation(高精度求幂)
- vista win7 wlan native wifi rssi
- java类加载器
- Oracle 学习笔记 17 -- 异常处理(PL/SQL)
- 移动封80端口引起的思考及利用80端口穿透软件做网站服务
- ORACLE EXP/IMP的使用详解
- hdu 1063 Exponentiation (高精度小数乘法)
- Oracle Fusion Middleware 介绍
- 证明题
- set<int,greater<int>>
- 关于前几天金山网络笔试的一道题-2014年4月28号
- 获取Ubnutu超级用户权限
- java RandomAccessFile类文件基本操作
- ubuntu apt-get安装java相关
- 子类调用父类方法