結果

問題 No.1217 せしすせそ
ユーザー tonakai
提出日時 2020-09-04 21:22:05
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 1,538 bytes
コンパイル時間 1,974 ms
コンパイル使用メモリ 193,340 KB
最終ジャッジ日時 2025-01-14 04:48:49
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:2:14: warning: ‘x’ may be used uninitialized [-Wmaybe-uninitialized]
    2 | #define endl "\n"
      |              ^~~~
main.cpp:54:29: note: in expansion of macro ‘endl’
   54 |   cout << y << "to" << x << endl;
      |                             ^~~~
main.cpp:44:8: note: ‘x’ was declared here
   44 |   char x,y;
      |        ^
main.cpp:2:14: warning: ‘y’ may be used uninitialized [-Wmaybe-uninitialized]
    2 | #define endl "\n"
      |              ^~~~
main.cpp:54:29: note: in expansion of macro ‘endl’
   54 |   cout << y << "to" << x << endl;
      |                             ^~~~
main.cpp:44:10: note: ‘y’ was declared here
   44 |   char x,y;
      |          ^

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
//const ll mod=998244353;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
//int2147483647 ≒ 2×10^9
//long long9223372036854775807 ≒ 9×10^18
//''+=32;
// cout << fixed << setprecision (20); 2
//2×10^8
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
char x,y;
string t="abcdefghijklmnopqrstuvwxyz";
rep(i,26){
if(s[i]!=t[i]){
x=s[i];
y=t[i];
}
}
cout << y << "to" << x << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0