Submission #1161044


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  int n;
  string s;
  cin >> s >> n;

  REP(i, s.size()) {
    if(s[i] != 'a' && 'z' - s[i] + 1 <= n) {
      n -= 'z' - s[i] + 1;
      s[i] = 'a';
    }
    //cout << n << endl;
  }

  if(n > 0) s[s.size()-1] += n%26;

  cout << s << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Next Letter
User ferin_tech
Language C++14 (GCC 5.4.1)
Score 400
Code Size 750 Byte
Status AC
Exec Time 5 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 27
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 4 ms 512 KB
1_07.txt AC 5 ms 512 KB
1_08.txt AC 5 ms 512 KB
1_09.txt AC 4 ms 512 KB
1_10.txt AC 5 ms 512 KB
1_11.txt AC 4 ms 512 KB
1_12.txt AC 4 ms 512 KB
1_13.txt AC 4 ms 512 KB
1_14.txt AC 4 ms 512 KB
1_15.txt AC 5 ms 512 KB
1_16.txt AC 5 ms 512 KB
1_17.txt AC 5 ms 512 KB
1_18.txt AC 4 ms 512 KB
1_19.txt AC 5 ms 512 KB
1_20.txt AC 4 ms 512 KB
1_21.txt AC 5 ms 512 KB
1_22.txt AC 4 ms 512 KB
1_23.txt AC 4 ms 512 KB