UVA10035
来源:互联网 发布:剑三藏剑成女捏脸数据 编辑:程序博客网 时间:2024/06/05 15:36
注意输出进位次数超过1是要加s
小学生算术
#include <cstdio>#include <cstring>#include <iostream>using namespace std;char str1[12],str2[12];int num1[12],num2[12];int main(){ int a,b; while(~scanf("%d%d",&a,&b),(a || b)){ sprintf(str1,"%d",a); sprintf(str2,"%d",b); memset(num1,0,sizeof(num1)); memset(num2,0,sizeof(num2)); int sum = 0,count = 0; int l1 = strlen(str1),l2 = strlen(str2); for(int i = l1 - 1;i >= 0;i--){ num1[count++] = str1[i] - '0'; } count = 0; for(int i = l2 - 1;i >= 0;i--) num2[count++] = str2[i] - '0'; for(int i = 0;i < 12;i++){ num1[i] += num2[i]; if(num1[i] >= 10){ num1[i + 1] += 1; num1[i] -= 10; sum++; } } if(!sum)printf("No carry operation.\n"); else if(sum == 1)printf("%d carry operation.\n",sum); else printf("%d carry operations.\n",sum); } return 0;}
#include <cstdio>#include <cstring>#include <iostream>using namespace std;char str1[20],str2[20];int num1[20],num2[20];int main(){ while(cin>>str1>>str2){ memset(num1,0,sizeof(num1)); memset(num2,0,sizeof(num2)); int sum = 0,count = 0; int l1 = strlen(str1),l2 = strlen(str2); if(l1 == 1 && l2 == 1 && str1[0] == '0' && str2[0] == '0'){break;} for(int i = l1 - 1;i >= 0;i--){ num1[count++] = str1[i] - '0'; } count = 0; for(int i = l2 - 1;i >= 0;i--){ num2[count++] = str2[i] - '0'; } for(int i = 0;i < 19;i++){ num1[i] += num2[i]; if(num1[i] >= 10){ num1[i + 1] += num1[i] / 10; num1[i] %= 10; sum++; } } if(!sum)printf("No carry operation.\n"); else if(sum == 1) printf("%d carry operation.\n",sum); else printf("%d carry operations.\n",sum); } return 0;
0 0
- UVA10035
- uva10035 Primary Arithmetic
- POJ2562 UVA10035 ZOJ1874 Primary Arithmetic【进制+进位】
- spring mvc框架下controller中如何读取properties文件内容
- uva----10905
- Android应用卸载器
- 九度OJ 1084: 整数拆分
- CSS入门之文本样式用法(文本对齐,首行缩进,文本竖排,文字方向)
- UVA10035
- uva----10474
- Ubuntu的简单环境配置
- Cracking the coding interview--Q1.7
- PHP 和 AJAX XML 实例
- Hibernate的事件机制
- 除了花生壳,还有每步、nat123端口映射等不少可以选择的
- 浏览器版本识别(备忘)
- HDU:1394 Minimum Inversion Number