Olinfo/indexing.cpp at main · Nataso08/Olinfo · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
// NOTE: it is recommended to use this even if you don't understand the following code.

#include <fstream>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main() {
    // uncomment the two following lines if you want to read/write from files
    // ifstream cin("input.txt");
    // ofstream cout("output.txt");

    string A;
    cin >> A;

    string B;
    cin >> B;

    string C = "";


    // INSERT YOUR CODE HERE

    if (A.size() < B.size()) {
        if (B.substr(0, A.size()) == A) {
            if (B[A.size()] == 'a' && B.size() <= A.size() +1) {
                C = "-1";
            } else {
                C = A;
                C.push_back('a');
            }
        } else {
        	for (long long i=0; i<A.size(); i++) {
	        	if (i < B.size()) {
	        		if (A[i] < B[i]-1) {
		                C.push_back(A[i]+1);
		                break;
		            } else if (A[i] < B[i]) {
		            	C.push_back(A[i]);
		            	if (A.size() > i+1) {
	                        if (B.size() > i+1) {
	                            if (A[i] == B[i]-1) {
	                                C[i] = B[i];
	                            }
	                        } else {
	                            for (long long j=i+1; j<A.size(); j++) {
	                                if (A[j] < 'z') {
	                                    C.push_back(A[j]+1);
	                                    break;
	                                } else {
	                                    C.push_back('z');
	                                }
	                            }
	                            if (C == A) {
	                                C.push_back('a');
	                            }
	                        }
						} else {
		                	C.push_back('a');
						}
		            	break;
		            } else {
		                C.push_back(A[i]);
		            }
				}
      		}
		}
    } else {
        for (long long i=0; i<A.size(); i++) {
        	if (i < B.size()) {
        		if (A[i] < B[i]-1) {
	                C.push_back(A[i]+1);
	                break;
	            } else if (A[i] < B[i]) {
	            	C.push_back(A[i]);
	            	if (A.size() > i+1) {
                        if (B.size() > i+1) {
                            if (A[i] == B[i]-1) {
                                C[i] = B[i];
                            }
                        } else {
                            for (long long j=i+1; j<A.size(); j++) {
                                if (A[j] < 'z') {
                                    C.push_back(A[j]+1);
                                    break;
                                } else {
                                    C.push_back('z');
                                }
                            }
                            if (C == A) {
                                C.push_back('a');
                            }
                        }
					} else {
	                	C.push_back('a');
					}
	            	break;
	            } else {
	                C.push_back(A[i]);
	            }
			}
        }
    }


    cout << C << endl;

    return 0;
}