Submission #5438710


Source Code Expand

#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(X))
#define all(X) (X).begin(), (X).end()
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

void solve(std::string s, long long K) {
  ll kTmp = K;
  ll ss = s.size();
  vector<char> ans(ss);

  rep(i, ss) {
    char c = s[i];

    // aに出来るか
    if (c != 'a' && 'z' + 1 - c <= kTmp) {
      kTmp -= 'z' + 1 - c;
      ans[i] = 'a';
    } else {
      ans[i] = c;
    }

    if (kTmp <= 0) {
      break;
    }
  }

  if (kTmp > 0) {
    ans[ss - 1] = 'a' + (ans[ss - 1] - 'a' + kTmp) % 26;
  }

  rep(i, ss) { cout << ans[i]; }
  cout << endl;
}

int main() {
  std::string s;
  std::cin >> s;
  long long K;
  scanf("%lld", &K);
  solve(s, K);
  return 0;
}

Submission Info

Submission Time
Task C - Next Letter
User righttoleft1134
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1457 Byte
Status WA
Exec Time 7 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:70:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &K);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 19
WA × 8
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 7 ms 640 KB
1_07.txt AC 7 ms 640 KB
1_08.txt WA 7 ms 640 KB
1_09.txt WA 7 ms 640 KB
1_10.txt WA 7 ms 640 KB
1_11.txt WA 7 ms 640 KB
1_12.txt WA 7 ms 640 KB
1_13.txt WA 7 ms 640 KB
1_14.txt WA 7 ms 640 KB
1_15.txt WA 7 ms 640 KB
1_16.txt AC 7 ms 640 KB
1_17.txt AC 7 ms 640 KB
1_18.txt AC 7 ms 640 KB
1_19.txt AC 7 ms 640 KB
1_20.txt AC 7 ms 640 KB
1_21.txt AC 7 ms 640 KB
1_22.txt AC 7 ms 640 KB
1_23.txt AC 7 ms 640 KB