Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Author: Kanan Asgarli
- https://www.e-olymp.com/az/problems/265
- */
- #include <iostream>
- #include <algorithm>
- using namespace std;
- string num1, num2, ans;
- int q, k, sum;
- int main()
- {
- cin>>num1>>num2;
- reverse(num1.begin(), num1.end());
- reverse(num2.begin(), num2.end());
- if(num1.length() > num2.length())
- swap(num1, num2);
- for(int i = 0; i < num1.length(); i++){
- k = (int)(num1[i]-48) + (int)(num2[i]-48);
- sum = k + q;
- ans += (char)(sum%10+48);
- q = sum/10;
- }
- for(int i = num1.length(); i < num2.length(); i++){
- k = (int)(num2[i]-48);
- sum = k + q;
- ans += (char)(sum%10+48);
- q = sum/10;
- }
- if(q > 0)
- ans += (char)(q+48);
- reverse(ans.begin(), ans.end());
- cout<<ans<<endl;
- system("pause");
- return 0;
- }
Add Comment
Please, Sign In to add comment