Submission #3774197
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define NDEBUG #include <cassert> typedef long long ll; typedef long double Double; typedef unsigned long long ull; typedef pair<int,int> ii; typedef pair<ll,ll> llll; typedef pair<double,double> dd; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<ii> vii; typedef vector<vector<ii>> vvii; typedef vector<ll> vll; typedef vector<string> vs; typedef vector<double> vd; typedef vector<long double> vD; #define sz(a) int((a).size()) #define pb push_back #define FOR(var,from,to) for(int var=(from);var<=(to);++var) #define rep(var,n) for(int var=0;var<(n);++var) #define rep1(var,n) for(int var=1;var<=(n);++var) #define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj) #define ALL(c) (c).begin(),(c).end() #define RALL(c) (c).rbegin(),(c).rend() #define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i) #define found(s,e) ((s).find(e)!=(s).end()) #define mset(arr,val) memset(arr,val,sizeof(arr)) #define mid(x,y) ((x)+((y)-(x))/2) #define IN(x,a,b) ((a)<=(x)&&(x)<=(b)) #define cons make_pair void solve(string& s, int K) { int L = s.size(); rep(i,L) { int ch = (int)(s[i] - 'a'); int mov = (26 - ch) % 26; if (mov <= K) { K -= mov; ch = 0; } else { ; } putchar('a'+ch); } } int main() { string s; cin >> s; int K; cin >> s; solve(s,K); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | naoya_t |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1548 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
0_01.txt | WA | 1 ms | 256 KB |
0_02.txt | WA | 1 ms | 256 KB |
1_00.txt | WA | 1 ms | 256 KB |
1_01.txt | WA | 1 ms | 256 KB |
1_02.txt | WA | 1 ms | 256 KB |
1_03.txt | WA | 1 ms | 256 KB |
1_04.txt | WA | 1 ms | 256 KB |
1_05.txt | WA | 1 ms | 256 KB |
1_06.txt | WA | 4 ms | 512 KB |
1_07.txt | WA | 4 ms | 512 KB |
1_08.txt | WA | 4 ms | 512 KB |
1_09.txt | WA | 4 ms | 512 KB |
1_10.txt | WA | 4 ms | 512 KB |
1_11.txt | WA | 4 ms | 512 KB |
1_12.txt | WA | 4 ms | 512 KB |
1_13.txt | WA | 4 ms | 512 KB |
1_14.txt | WA | 4 ms | 512 KB |
1_15.txt | WA | 4 ms | 512 KB |
1_16.txt | WA | 4 ms | 512 KB |
1_17.txt | WA | 4 ms | 512 KB |
1_18.txt | WA | 4 ms | 512 KB |
1_19.txt | WA | 4 ms | 512 KB |
1_20.txt | WA | 4 ms | 512 KB |
1_21.txt | WA | 4 ms | 512 KB |
1_22.txt | WA | 4 ms | 512 KB |
1_23.txt | WA | 4 ms | 512 KB |