Submission #2075789


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;

int main(){
    map<char,int> alf;
    for(int i=0;i<26;i++){
        alf[(char)('a'+i)]=(26-i)%26;
    }
    string s;
    cin >> s;
    LL K;
    cin >> K;
    for(int i=0;i<s.length();i++){
        if(alf[s[i]]<=K){
            K-=alf[s[i]];
            s[i]='a';
        }
        if(i==s.length()-1){
            K%=26;
            int t=((int)s[i]+K-'a')%26;
            s[i]=(char)('a'+t);
        }
    }
    cout << s << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Next Letter
User Yukly
Language C++14 (GCC 5.4.1)
Score 400
Code Size 597 Byte
Status AC
Exec Time 8 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 6 ms 512 KB
1_07.txt AC 7 ms 512 KB
1_08.txt AC 7 ms 512 KB
1_09.txt AC 7 ms 512 KB
1_10.txt AC 7 ms 512 KB
1_11.txt AC 7 ms 512 KB
1_12.txt AC 7 ms 512 KB
1_13.txt AC 7 ms 512 KB
1_14.txt AC 8 ms 512 KB
1_15.txt AC 8 ms 512 KB
1_16.txt AC 8 ms 512 KB
1_17.txt AC 8 ms 512 KB
1_18.txt AC 8 ms 512 KB
1_19.txt AC 8 ms 512 KB
1_20.txt AC 7 ms 512 KB
1_21.txt AC 8 ms 512 KB
1_22.txt AC 8 ms 512 KB
1_23.txt AC 8 ms 512 KB