1001. A+B Format (20)
2015-10-06 22:20
309 查看
Calculate a + b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).
Input
Each input file contains one test case. Each case contains a pair of integers a and b where -1000000 <= a, b <= 1000000. The numbers are separated by a space.
Output
For each test case, you should output the sum of a and b in one line. The sum must be written in the standard format.
Sample Input
-1000000 9
Sample Output
-999,991
解题思路:
1,转化为字符串处理。
2,转化为%3部分和整除3的部分
第二种思路:
1,转化为字符串,然后从末位开始计数,逢3,push一个’,’,然后反向字符串,判断若反向后的字符串首字符为’,’,则不输出即可。
Input
Each input file contains one test case. Each case contains a pair of integers a and b where -1000000 <= a, b <= 1000000. The numbers are separated by a space.
Output
For each test case, you should output the sum of a and b in one line. The sum must be written in the standard format.
Sample Input
-1000000 9
Sample Output
-999,991
解题思路:
1,转化为字符串处理。
2,转化为%3部分和整除3的部分
[code]#include <iostream> #include <string> using namespace std; int main(){ int a, b; cin >> a >> b; int sum = a + b; if (sum < 0){ cout << "-"; sum = -sum; } char buffer[10]; sprintf(buffer, "%d", sum); string s(buffer); int k = s.size() / 3; int k1 = s.size() % 3; for (int i = 0; i < k1; i++){ cout << s[i]; } if (k1 != 0){ for (int j = k1; j < s.size(); j++){ int n = j - k1; if (n % 3 == 0){ cout << ","; } cout << s[j]; } } else{ for (int j = 0; j < s.size(); j++){ int n = j ; if (n % 3 == 0){ if (j != 0) cout << ","; } cout << s[j]; } } }
第二种思路:
1,转化为字符串,然后从末位开始计数,逢3,push一个’,’,然后反向字符串,判断若反向后的字符串首字符为’,’,则不输出即可。
[code]#include <iostream> #include <string> using namespace std; int main(){ int a, b; cin >> a >> b; int sum = a + b; if (sum < 0){ cout << "-"; sum = -sum; } char buffer[10]; sprintf(buffer, "%d", sum); string s(buffer); //cout << s << endl; string temp_s; for (int i = s.size() - 1; i >= 0; i--){ temp_s.push_back(s[i]); int counter = s.size() - i; if (counter % 3 == 0){ temp_s.push_back(','); } } for (int i = 0,j = temp_s.size() - 1; i < j; i++, j--){ char c = temp_s[i]; temp_s[i] = temp_s[j]; temp_s[j] = c; } if (temp_s[0] != ','){ cout << temp_s[0]; } for (int i = 1; i < temp_s.size(); i++) cout << temp_s[i]; }
相关文章推荐
- 主题
- Halcon算子--区域特征
- Android Studio导入SlidingMenu类库的方法(其他类库应该也适用)
- 拓展欧几里德
- Star Schema完全参考手册读书笔记五
- leetcode20
- 使用NSURLConnection获取服务器端数据时数据未能随服务器端数据变化
- gradle 学习资料汇总
- 在diy的文件系统上创建文件的流程
- 在diy的文件系统上创建文件的流程
- LeetCode OJ:Count Primes(质数计数)
- 第6周-打印金字塔形的数字
- 转录组小知识点收集
- leetcode19
- 关于ActionBar
- 【解题报告】CF Round #320 (Div. 2)
- 作业不会写
- 相似图片搜索的原理(二)(转)
- adb命令查看报名和查看手机分辨率
- HTML页面跳转的5种方式