Advertisement
amine99

Untitled

Mar 6th, 2018
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.91 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define loop(i,b,e) for(auto i=b;i<=e;i++)
  5. #define reloop(i,e,b) for(auto i=e;i>=b;i--)
  6. #define all(x) x.begin(),x.end()
  7. #define ll long long
  8. #define pb push_back
  9. #define mp make_pair
  10. #define fi first
  11. #define se second
  12. #define pf printf
  13. #define sf scanf
  14.  
  15. string alph={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
  16.  
  17. bool CanU(string s) {
  18.    int j=0;
  19.    loop(i,0,25) {
  20.       if(s[i] > alph[j])
  21.          return false;
  22.       else j++;
  23.    }
  24.    return true;
  25. }
  26.  
  27. string tmp,s,a="abcdefghijklmnopqrstuvwxyz";
  28. int b;
  29.  
  30.  
  31. int main(){
  32.    cin >> s;
  33.    if(s.length() < 26) pf("-1");
  34.    else {
  35.       loop(i,0,s.length()-26) {
  36.          tmp = s.substr(i,26);
  37.          if(CanU(tmp)) {
  38.             s.replace(i,26,a);
  39.             cout << a;
  40.             return 0;
  41.          }
  42.       }
  43.       pf("-1");
  44.    }
  45. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement