Submission #3247535
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cmath> #include <cstdio> #include <functional> #include <numeric> #include <stack> #include <queue> #include <map> #include <set> #include <utility> #include <sstream> #include <complex> #include <fstream> #include <bitset> #include <time.h> #include <tuple> #include <iomanip> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef vector<ll> V; typedef complex<double> Point; #define PI acos(-1.0) #define EPS 1e-10 const ll INF = 1e12; const ll MOD = 1e9 + 7; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,N) for(int i=0;i<(N);i++) #define ALL(s) (s).begin(),(s).end() #define EQ(a,b) (abs((a)-(b))<EPS) #define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) ) #define fi first #define se second #define N_SIZE (1LL << 20) #define NIL -1 ll sq(ll num) { return num*num; } ll mod_pow(ll x, ll n) { if (n == 0)return 1; if (n == 1)return x%MOD; ll res = sq(mod_pow(x, n / 2)); res %= MOD; if (n % 2 == 1) { res *= x; res %= MOD; } return res; } ll mod_add(ll a, ll b) { return (a + b) % MOD; } ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; } ll mod_mul(ll a, ll b) { return a*b % MOD; } string s; ll k; int main(){ cin >> s >> k; rep(i,s.size()){ ll cnt = ('z'-s[i]+1) % 26; // cout << k <<" " << cnt << endl; if(cnt <= k){ s[i] = 'a'; k -= cnt; } } if(k != 0)s[s.size()-1] += k % 26; cout << s << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | jimmy |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1597 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 5 ms | 512 KB |
1_07.txt | AC | 5 ms | 512 KB |
1_08.txt | AC | 4 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 | 4 ms | 512 KB |
1_16.txt | AC | 4 ms | 512 KB |
1_17.txt | AC | 4 ms | 512 KB |
1_18.txt | AC | 5 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 |