Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <cmath>
- #include <string>
- #include <sstream>
- using namespace std;
- int get_int(vector<int> x){
- int cur = 0;
- for(int i = x.size() - 1; i >= 0; i--)
- cur = cur * 10 + x[i];
- return cur;
- }
- int main()
- {
- freopen("output.txt", "w", stdout);
- int a, b;
- for(int aa = 1; aa <= 99; aa++){
- for(int bb = 1; bb <= 99; bb++){
- a = aa; b = bb;
- int ans1;
- if (a % 10 == 0 && b % 10 == 0)
- ans1 = a + b;
- else if (a < 10 && b < 10)
- ans1 = a+b;
- else if (a < 10 || b < 10)
- {
- if (a < 10 && a>(b/10))
- {
- int multi = a;
- int num = 0;
- num = b % 10;
- a = b / 10;
- b = multi * 10 + num;
- }
- else if(b<10 && b>(a/10))
- {
- int num = 0;
- int multi = b;
- num = a % 10;
- b = a / 10;
- a = b * 10 + num;
- }
- //cout << a << " " << b << endl;
- ans1 = a + b;
- }
- else if(a/10==b/10)
- {
- if(a<b)
- {
- int la=0, fa=0, lb=0, fb = 0;
- la = a % 10;
- fa = a / 10;
- lb = b % 10;
- fb = b / 10;
- a=lb*10+la;
- b=fb*10+fa;
- ans1 = a+b;
- }
- else if(b<a)
- {
- int la=0, fa=0, lb=0, fb = 0;
- la = a % 10;
- fa = a / 10;
- lb = b % 10;
- fb = b / 10;
- b=la*10+lb;
- a=fa*10+fb;
- // cout<<a<<" "<<b<<"\n";
- ans1 = a+b;
- }
- else
- {
- // cout<<a<<" "<<b<<"\n";
- ans1 = a+b;
- }
- }
- else
- {
- int la=0, fa=0, lb=0, fb = 0;
- la = a % 10;
- fa = a / 10;
- lb = b % 10;
- fb = b / 10;
- if (fa < lb)
- swap(fa, lb);
- else if (fb < la)
- swap(fb, la);
- int ansa = fa * 10 + la;
- int ansb = fb * 10 + lb;
- ans1 = ansa + ansb;
- }
- a = aa; b = bb;
- int maxi = a + b;
- vector<int> av;
- while(a != 0){
- av.push_back(a % 10);
- a /= 10;
- }
- vector<int> bv;
- while(b != 0){
- bv.push_back(b % 10);
- b /= 10;
- }
- for(int i = 0; i < av.size(); i++){
- for(int j = 0; j < bv.size(); j++){
- swap(av[i], bv[j]);
- maxi = max(maxi, get_int(av) + get_int(bv));
- swap(av[i], bv[j]);
- }
- }
- a = aa; b = bb;
- if(maxi != ans1)
- printf("( %d %d ) %d %d\n", a, b, ans1, maxi);
- }
- }
- }
Add Comment
Please, Sign In to add comment