結果
問題 | No.1217 せしすせそ |
ユーザー |
|
提出日時 | 2020-09-04 21:23:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 40 ms / 2,000 ms |
コード長 | 3,648 bytes |
コンパイル時間 | 2,984 ms |
コンパイル使用メモリ | 221,896 KB |
最終ジャッジ日時 | 2025-01-14 04:52:01 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
#define LOCAL#ifdef LOCAL#define _GLIBCXX_DEBUG#endif#include <bits/stdc++.h>using namespace std;#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)#define ll long long#define ld long double#define pb push_back#define eb emplace_back#define All(x) x.begin(), x.end()#define Range(x, i, j) x.begin() + i, x.begin() + j#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) // dist between two elements// #define M_PI 3.14159265358979323846 // CF#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)#define Find(set, element) set.find(element) != set.end()#define Decimal(x) cout << fixed << setprecision(10) << x << endl; // 小数点を10桁まで表示#define endl "\n"#define Case(x) printf("Case #%d: ", x); // gcjtypedef pair<int, int> PI;typedef pair<ll, ll> PLL;typedef vector<int> vi;typedef vector<vector<int>> vvi;typedef vector<vector<vector<int>>> vvvi;typedef vector<ll> vl;typedef vector<vector<ll>> vvl;typedef vector<vector<vector<ll>>> vvvl;typedef vector<PI> vpi;typedef vector<vector<PI>> vvpi;typedef vector<PLL> vpl;typedef vector<vector<PLL>> vvpl;typedef vector<char> vch;typedef vector<vector<char>> vvch;constexpr ll LINF = 1001002003004005006ll;constexpr int INF = 1001001001;constexpr int n_max = 2e5+10;template<class T>inline bool chmax(T &a, T b) { if(a<b) { a=b; return true; } return false; };template<class T>inline bool chmin(T &a, T b) { if(a>b) { a=b; return true; } return false; };template<class T, class U>T POW(T x, U n) {T ret=1; while (n>0) {if (n&1) {ret*=x;} x*=x; n>>=1;} return ret;};// debugtemplate <typename A, typename B>string to_string(pair<A, B> p);string to_string(const string &s) {return '"' + s + '"';};string to_string(const char c) {return to_string((string) &c);};string to_string(bool b) {return (b ? "true" : "false");};template <size_t N>string to_string(bitset<N> v){string res = "";for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);return res;};template <typename A>string to_string(A v) {bool first = true;string res = "{";for(const auto &x : v) {if(!first) res += ", ";first = false; res += to_string(x);}res += "}";return res;};template <typename A, typename B>string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}void debug_out() {cerr << endl;};template<typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); };#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 71#endifvoid print() { cout << endl; }template <class Head, class... Tail>void print(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(tail) != 0) cout << " ";print(forward<Tail>(tail)...);};template <class T>void print(vector<T> &vec) {for (auto& a : vec) {cout << a;if (&a != &vec.back()) cout << " ";}cout << endl;};template <class T>void print(vector<vector<T>> &df) {for (auto& vec : df) {print(vec);}};int main() {ios::sync_with_stdio(false);cin.tie(0);vch S(26);rep(i, 0, 26) cin >> S[i];rep(i, 0, 26) {char c = S[i];char c_ = (char)i+'a';if (c != c_){cout << c_ << "to" << c << endl;}}return 0;};