提出 #894874


ソースコード 拡げる

#include<iostream>
#include<string>
#include<map>
using namespace std;
int main(){
  map<int,char> m;
  m['a'] = 0;
  m['z'] = 1;
  m['y'] = 2;
  m['x'] = 3;
  m['w'] = 4;
  m['v'] = 5;
  m['u'] = 6;
  m['t'] = 7;
  m['s'] = 8;
  m['r'] = 9;
  m['q'] = 10;
  m['p'] = 11;
  m['o'] = 12;
  m['n'] = 13;
  m['m'] = 14;
  m['l'] = 15;
  m['k'] = 16;
  m['j'] = 17;
  m['i'] = 18;
  m['h'] = 19;
  m['g'] = 20;
  m['f'] = 21;
  m['e'] = 22;
  m['d'] = 23;
  m['c'] = 24;
  m['b'] = 25;
  string s;
  int n;
  cin >> s >> n;
  for(int i=0;i<s.size();i++){
    if(m[s[i]]<=n){
      n -= m[s[i]];
      s[i] = 'a';
    }
    if(n==0) break;
  }
  n %= 26;
  if(n>0){
    for(int i=0;i<n;i++){
      // cout << s[s.size()-1] << endl;
      if(s[s.size()-1]=='z') s[s.size()-1] = 'a';
      else if(s[s.size()-1]=='a') s[s.size()-1] = 'b';
      else if(s[s.size()-1]=='b') s[s.size()-1] = 'c';
      else if(s[s.size()-1]=='c') s[s.size()-1] = 'd';
      else if(s[s.size()-1]=='d') s[s.size()-1] = 'e';
      else if(s[s.size()-1]=='e') s[s.size()-1] = 'f';
      else if(s[s.size()-1]=='f') s[s.size()-1] = 'g';
      else if(s[s.size()-1]=='g') s[s.size()-1] = 'h';
      else if(s[s.size()-1]=='h') s[s.size()-1] = 'i';
      else if(s[s.size()-1]=='i') s[s.size()-1] = 'j';
      else if(s[s.size()-1]=='j') s[s.size()-1] = 'k';
      else if(s[s.size()-1]=='k') s[s.size()-1] = 'l';
      else if(s[s.size()-1]=='l') s[s.size()-1] = 'm';
      else if(s[s.size()-1]=='m') s[s.size()-1] = 'n';
      else if(s[s.size()-1]=='n') s[s.size()-1] = 'o';
      else if(s[s.size()-1]=='o') s[s.size()-1] = 'p';
      else if(s[s.size()-1]=='p') s[s.size()-1] = 'q';
      else if(s[s.size()-1]=='q') s[s.size()-1] = 'r';
      else if(s[s.size()-1]=='r') s[s.size()-1] = 's';
      else if(s[s.size()-1]=='s') s[s.size()-1] = 't';
      else if(s[s.size()-1]=='t') s[s.size()-1] = 'u';
      else if(s[s.size()-1]=='u') s[s.size()-1] = 'v';
      else if(s[s.size()-1]=='v') s[s.size()-1] = 'w';
      else if(s[s.size()-1]=='w') s[s.size()-1] = 'x';
      else if(s[s.size()-1]=='x') s[s.size()-1] = 'y';
      else if(s[s.size()-1]=='y') s[s.size()-1] = 'z';
    }
  }
  cout << s << endl;
  return 0;
}

提出情報

提出日時
問題 C - 次のアルファベット
ユーザ tukumodou
言語 C++14 (GCC 5.4.1)
得点 400
コード長 2272 Byte
結果 AC
実行時間 9 ms
メモリ 640 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 27
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
0_00.txt AC 3 ms 256 KiB
0_01.txt AC 3 ms 256 KiB
0_02.txt AC 3 ms 256 KiB
1_00.txt AC 3 ms 256 KiB
1_01.txt AC 2 ms 256 KiB
1_02.txt AC 3 ms 256 KiB
1_03.txt AC 3 ms 256 KiB
1_04.txt AC 3 ms 256 KiB
1_05.txt AC 3 ms 256 KiB
1_06.txt AC 8 ms 512 KiB
1_07.txt AC 7 ms 640 KiB
1_08.txt AC 7 ms 512 KiB
1_09.txt AC 6 ms 512 KiB
1_10.txt AC 6 ms 512 KiB
1_11.txt AC 7 ms 512 KiB
1_12.txt AC 6 ms 512 KiB
1_13.txt AC 6 ms 512 KiB
1_14.txt AC 9 ms 512 KiB
1_15.txt AC 9 ms 512 KiB
1_16.txt AC 9 ms 512 KiB
1_17.txt AC 9 ms 512 KiB
1_18.txt AC 9 ms 512 KiB
1_19.txt AC 9 ms 512 KiB
1_20.txt AC 9 ms 512 KiB
1_21.txt AC 9 ms 512 KiB
1_22.txt AC 9 ms 512 KiB
1_23.txt AC 9 ms 512 KiB