CODE FESTIVAL 2016 qual A

Submission #1229710

Source codeソースコード

#include <iostream>
#include <iomanip>
#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 <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#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 ll;

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

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

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

string s;
int n;
signed main() {
    cin >> s >> n;
    rep(i,0,s.length()) {
        if(i != s.length() - 1 && s[i] == 'a') continue;
        int nd = 'z' - s[i] + 1;
        if(nd <= n) {
            n -= nd;
            s[i] = 'a';
        }
        if(i == s.length() - 1) {
            int cur = s[i] - 'a';
            s[i] = 'a' + ((cur + n) % 26);
        }
    }
    cout << s << endl;
    return 0;
}

Submission

Task問題 C - 次のアルファベット / Next Letter
User nameユーザ名 Tsutajiro
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 400
Source lengthソースコード長 2190 Byte
File nameファイル名
Exec time実行時間 5 ms
Memory usageメモリ使用量 512 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt
All 400 / 400 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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 5 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 5 ms 512 KB
1_15.txt AC 5 ms 512 KB
1_16.txt AC 5 ms 512 KB
1_17.txt AC 5 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 5 ms 512 KB
1_23.txt AC 5 ms 512 KB