結果
問題 | No.1217 せしすせそ |
ユーザー |
![]() |
提出日時 | 2020-10-24 12:16:03 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,207 bytes |
コンパイル時間 | 2,565 ms |
コンパイル使用メモリ | 180,192 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-21 15:09:41 |
合計ジャッジ時間 | 3,217 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#define ll long long#define ld long double#define rep(i, n) for(ll i = 0; i < n; ++i)#define rep2(i, a, b) for(ll i = a; i <= b; ++i)#define rrep(i, a, b) for(ll i = a; i >= b; --i)#define pii pair<int, int>#define pll pair<ll, ll>#define fi first#define se second#define pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpii vector<pii>#define vpll vector<pll>#define all(a) a.begin(), a.end()#define rall(a) a.rbegin(), a.rend()#define endl '\n'using namespace std;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; }const int MOD=1000000007;//998244353const ll INF=1e18;const int inf=1e9;const double PI=acos(-1);int dx[8] = {1,0,-1,0,1,1,-1,-1};int dy[8] = {0,1,0,-1,-1,1,1,-1};const int MAX = 310000;template<int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};using mint = Fp<MOD>;signed main(){cin.tie(0);ios::sync_with_stdio(false);string s = "abcdefghijklmnopqrstuvwxyz";string t;cin >> t;rep(i,26){if(s[i] != t[i]){cout << s[i] << "to" << t[i] << endl;return 0;}}return 0;}