946C - String Transformation - CodeForces Solution


greedy strings *1300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define mod 1000000007
#define double long double
#define INT_MIN -1000000000000000
#define INT_MAX 1e18


void solve()
{
    // Write your code here 
    string s;
    getline(cin,s);
    char c = 'a';
    for(int i=0;i<s.size();i++)
    {
        if(s[i]<=c)
        {
            s[i]=c;
            c+=1;
        }
        if(c>'z')
            break;
    }
    if(c>'z')
    {
        cout<<s<<endl;
        return;
    }
    cout<<-1<<endl;
}
signed main()
{
    int t=1;
    //cin>>t;

    while(t--)
    {
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards
897A - Scarborough Fair
1433B - Yet Another Bookshelf