Uva 10106 Product
2011-03-25 08:43
260 查看
WA了两次,只是因为没有考虑结果为0 的情况……呜呜~~~
#include<stdio.h> #include<string.h> char a[1000],b[1000]; int sum[1000]; int main(void) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); int i, j; while(scanf("%s%s",a,b) == 2) { memset(sum,0,sizeof(sum)); for(i =0,j= strlen(a)-1;i < j;i++,j--) { int temp = a[i];a[i] = a[j] ;a[j] = temp; } for(i =0,j= strlen(b)-1;i < j;i++,j--) { int temp = b[i];b[i] = b[j] ;b[j] = temp; } int count = 0; for(i = 0;i< strlen(a);i++) { count = 0; for(j = 0;j <strlen(b);j++) { int temp = (a[i]-48)*(b[j]-48) + count +sum[i+j]; sum[i+j] = temp%10; count = temp/10; } sum[i+j] = count; } for(i = 999;i>0;i--) if(sum[i]) break; for(j = i;j >= 0;j--) printf("%d",sum[j]); printf("/n"); } return 0; }
相关文章推荐
- UVA - 10106 Product 第二种解法
- uva 10106 Product
- UVA 10106 Product (高精度乘法)
- UVA 10106 Product (大数相乘)
- Uva 10106 - Product
- UVA 10106 Product 高精度乘法
- Product(uva10106)
- UVa OJ 10106-Product
- UVA - 10106 Product
- UVA - 10106 Product
- UVa - 10106 - Product
- UVA 10106-Product(大数乘法)
- UVA - 10106 Product
- uva 10106 Product(高精度乘法)
- UVa 10106 Product
- (高精度运算4.7.21)UVA 10106 Product(大数乘法)
- (高精度运算4.7.21)UVA 10106 Product(大数乘法)
- UVA 10106 - Product (大数相乘问题)
- uva-10106 - Product
- UVa-10106-Product