Submission #3784616

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std ;

typedef long long ll ;
#define rep (i , n ) for ( int i =0; i < n ; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;

/*
__attribute__((constructor))
void initial()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);
}
*/

int main()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);

	string s;
	int k;
	
	cin >> s >> k;
	int len = s.size();
	int a[len];

	//cout << "te" << endl;
	for (int i = 0; i < len; i++)
	{
		if (s[i] == 'a')
		{
			a[i] = 0;
		}
		else
		{
			a[i] = 'z' - s[i] + 1;
		}
		//cout << a[i] << endl;
	}

	
	int remain = k;
	//cout << "tesdfa" << endl;
	for (int i = 0; i < len; i++)
	{
		if ( remain >= a[i] && (a[i] != 0) )
		{
			remain = remain - a[i];
			a[i] = 0;
		}
		//cout << a[i] << "; remain = " << remain << endl;
	}

	if (remain > 0)
	{
		remain = remain % 26;
		if (a[len-1] - remain < 0)
		{
			a[len - 1] = a[len-1] - remain + 26;
		}
		else
		{
			a[len-1] = a[len-1] - remain;
		}
		
	}

	for (int i = 0; i < len; i++)
	{
		if (a[i] == 0)
		{
			cout << "a";
		}
		else
		{
			cout << char('z' - a[i] + 1);
		}
	}

	cout << endl;

	
	return 0;
}

Submission Info

Judge Result