Submission #7097005

---

Source Code Expand

#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>

#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(int i = s;i<=n;i++)
#define rep_r(i,s,n)for(int i = n-1;i>=s;i--)
#define rep_re(i,s,n)for(int i = n;i>=s;i--)
using namespace std;
typedef long long ll;
static const ll MOD = 1e9 + 7;
static const ll INF = 1e25;
static const ll MAX_N = 100001;
static const ll MAX_M = 100001;

ll c[100001];
int main() {
	string s; cin >> s;
	string t = s;
	ll k; cin >> k;
	rep(i, 0, s.size()) {
		c[i] = ('z' - 'a') - (s[i] - 'a') + 1;
	}
	rep(i, 0, s.size()) {
		if (s[i] != 'a' && k - c[i] >= 0) {
			k -= c[i];
			t[i] = 'a';
			c[i] = 0;
		}
	}

	if (k > 0) {
		t[s.size() - 1] += (char)(k % 26);
	}

	cout << t << endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp:19:23: warning: overflow in implicit constant conversion [-Woverflow]
 static const ll INF = 1e25;
                       ^

Judge Result