Submission #893551


Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long int ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int main() {
    string s; cin >> s;
    int k; cin >> k;

    int len = s.length();
    int i = 0;
    while(i != len) {
        int x = 'z' - s[i] + 1;
        if(k < x) i++;
        else {
            k -= x;
            s[i] = 'a';
            i++;
        }
    }
    s[i-1] = (char)(((int)s[i-1] + k) % 97 + 97);
    cout << s << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Next Letter
User tsutaj
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1638 Byte
Status WA
Exec Time 6 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 7
WA × 20
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 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 3 ms 256 KB
1_04.txt WA 3 ms 256 KB
1_05.txt WA 3 ms 256 KB
1_06.txt WA 6 ms 512 KB
1_07.txt WA 6 ms 512 KB
1_08.txt WA 6 ms 512 KB
1_09.txt WA 6 ms 512 KB
1_10.txt WA 6 ms 512 KB
1_11.txt WA 6 ms 512 KB
1_12.txt WA 6 ms 512 KB
1_13.txt WA 6 ms 512 KB
1_14.txt WA 6 ms 512 KB
1_15.txt WA 6 ms 512 KB
1_16.txt WA 6 ms 512 KB
1_17.txt WA 6 ms 512 KB
1_18.txt WA 6 ms 512 KB
1_19.txt WA 6 ms 512 KB
1_20.txt WA 6 ms 512 KB
1_21.txt WA 6 ms 512 KB
1_22.txt WA 6 ms 512 KB
1_23.txt WA 6 ms 512 KB