結果
問題 | No.18 うーさー暗号 |
ユーザー |
|
提出日時 | 2015-06-02 15:49:54 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 4,924 bytes |
コンパイル時間 | 699 ms |
コンパイル使用メモリ | 86,868 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-07 05:44:12 |
合計ジャッジ時間 | 1,212 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 13 |
ソースコード
// Header {{{// includes {{{#include <algorithm>#include <cassert>#include <cctype>#include <climits>#include <cmath>#include <complex>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>#include <iostream>#include <iterator>#include <limits>#include <list>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <string>#include <vector>// }}}using namespace std;// consts {{{static const int INF = 1e9;static const double PI = acos(-1.0);static const double EPS = 1e-10;// }}}// typedefs {{{typedef long long int LL;typedef unsigned long long int ULL;typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<LL> VLL;typedef vector<VLL> VVLL;typedef vector<ULL> VULL;typedef vector<VULL> VVULL;typedef vector<double> VD;typedef vector<VD> VVD;typedef vector<bool> VB;typedef vector<VB> VVB;typedef vector<char> VC;typedef vector<VC> VVC;typedef vector<string> VS;typedef vector<VS> VVS;typedef pair<int, int> PII;typedef complex<int> P;// }}}// macros & inline functions {{{// syntax sugars {{{#define FOR(i, b, e) for (int i = (b); i < (e); ++i)#define FORI(i, b, e) for (int i = (b); i <= (e); ++i)#define REP(i, n) FOR(i, 0, n)#define REPI(i, n) FORI(i, 0, n)#define OPOVER(_op, _type) inline bool operator _op (const _type &t) const// }}}// conversion {{{inline int toInt(string s) {int v; istringstream sin(s); sin >> v; return v;}template<class T> inline string toString(T x) {ostringstream sout; sout << x; return sout.str();}// }}}// array and STL {{{#define ARRSIZE(a) ( sizeof(a) / sizeof(a[0]) )#define F first#define S second#define MP(a, b) make_pair(a, b)#define PB(e) push_back(e)#define SORT(v) sort((v).begin(), (v).end())#define RSORT(v) sort((v).rbegin(), (v).rend())#define ALL(a) (a).begin(), (a).end()#define RALL(a) (a).rbegin(), (a).rend()#define EXIST(s, e) ((s).find(e) != (s).end())// }}}// for readable code {{{#define EVEN(n) (n % 2 == 0)#define ODD(n) (!EVEN(n))// }}}// debug {{{#define arrsz(a) ( sizeof(a) / sizeof(a[0]) )#define dprt(fmt, ...) if (opt_debug) { fprintf(stderr, fmt, ##__VA_ARGS__); }#define darr(a) if (opt_debug) { copy( (a), (a) + arrsz(a), ostream_iterator<int>(cerr, " ") ); cerr << endl; }#define darr_range(a, f, t) if (opt_debug) { copy( (a) + (f), (a) + (t), ostream_iterator<int>(cerr, " ") ); cerr << endl; }#define dvec(v) if (opt_debug) { copy( ALL(v), ostream_iterator<int>(cerr, " ") ); cerr << endl; }#define darr2(a) if (opt_debug) { FOR(__i, 0, (arrsz(a))){ darr( (a)[__i] ); } }#define WAIT() if (opt_debug) { string _wait_; cerr << "(hit return to continue)" << endl; getline(cin, _wait_); }#define dump(x) if (opt_debug) { cerr << " [L" << __LINE__ << "] " << #x << " = " << (x) << endl; }#define dumpl(x) if (opt_debug) { cerr << " [L" << __LINE__ << "] " << #x << endl << (x) << endl; }#define dumpf() if (opt_debug) { cerr << __PRETTY_FUNCTION__ << endl; }// ostreams {{{// complextemplate<typename T> ostream& operator<<(ostream& s, const complex<T>& d) {return s << "(" << d.real() << ", " << d.imag() << ")";}// pairtemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& d) {return s << "(" << d.first << ", " << d.second << ")";}// vectortemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d) {int len = d.size();REP(i, len) {s << d[i]; if (i < len - 1) s << "\t";}return s;}// 2 dimentional vectortemplate<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& d) {int len = d.size();REP(i, len) {s << d[i] << endl;}return s;}// maptemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {s << "{" << endl;for (auto itr = m.begin(); itr != m.end(); ++itr) {s << "\t" << (*itr).first << " : " << (*itr).second << endl;}s << "}" << endl;return s;}// }}}// }}}// }}}// string manipulation {{{inline VS split(string s, char delimiter) {VS v; string t; REP(i, s.length()) {if (s[i] == delimiter) v.PB(t), t = ""; else t += s[i];} v.PB(t); return v;}inline string join(VS s, string j) {string t; REP(i, s.size()) {t += s[i] + j;} return t;}// }}}// geometry {{{#define Y real()#define X imag()// }}}// 2 dimentional array {{{P dydx4[4] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1) };P dydx8[8] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1), P(-1, 1), P(1, 1), P(1, -1), P(-1, -1) };int g_height, g_width;bool in_field(P p) {return (0 <= p.Y && p.Y < g_height) && (0 <= p.X && p.X < g_width);}// }}}// }}}bool opt_debug = false;#define PRINT(s) cout << (s) << endlint main(int argc, char** argv) {cin.tie(0);ios::sync_with_stdio(false);string s;cin >> s;int n = s.length();REP(i, n) {s[i] -= ((i + 1) % 26);if (s[i] < 65) {s[i] += 26;}}cout << s << endl;return 0;}