Submission #890682


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define PI       3.1415926535897932384626433832795028841971
#define INF      100000000
#define EPS      1e-10
#define MOD      1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

string str;
int n;

int main(){
    cin >> str >> n;
    rep(i,str.size()){
        while(str[i] != 'a'){
            if('z'-str[i]+1 <= n){
                n -= 'z'-str[i]+1;
                str[i] = 'a';
            }
            break;
        }
    }
    cout << str << endl;
}

Submission Info

Submission Time
Task C - Next Letter
User gasin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 586 Byte
Status WA
Exec Time 8 ms
Memory 764 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 2
AC × 11
WA × 16
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 8 ms 764 KB
0_01.txt WA 3 ms 256 KB
0_02.txt WA 3 ms 384 KB
1_00.txt WA 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt WA 3 ms 256 KB
1_04.txt WA 2 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 AC 6 ms 512 KB
1_09.txt AC 6 ms 512 KB
1_10.txt AC 6 ms 512 KB
1_11.txt AC 6 ms 512 KB
1_12.txt AC 6 ms 512 KB
1_13.txt AC 6 ms 512 KB
1_14.txt AC 6 ms 512 KB
1_15.txt AC 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