Submission #73290667

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <cctype>
#include <chrono>
#include <numeric>
#include <cmath>
#include <climits>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int> >;
using vs = vector<string>;
using vvc = vector<vector<char> >;
using pii = pair<int, int>;
using vpii = vector<pii>;
#define el '\n'
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define lrep(i, n) for(ll i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define lrep2(i, s, n) for(ll i = (long long)(s); i < (long long)(n); i++)
#define rrep(i, n) for(int i =(int)(n)-1; i >= 0; i--)
#define lrrep(i, n) for(ll i =(long long)(n)-1; i >= 0; i--)
#define rrep2(i, b, n) for(int i =(int)(n); i > (int)(b); i--)
#define erep(i, n) for(int i = 0; i <= (int)(n); i++)
#define lerep(i, n) for(ll i = 0; i <= (long long)(n); i++)
#define erep2(i, s, n) for(int i = (int)(s); i <= (int)(n); i++)
#define lerep2(i, s, n) for(ll i = (ll)(s); i <= (ll)(n); i++)
#define vin(array, size) rep(i, (int)(size))cin >> array[i]
#define vvin(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cin >> array[i][j]
#define vout(array, size) rep(i, (int)(size))cout << array[i] << el
#define vvout(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cout << array[i][j] << " \n"[j == size2-1]
#define pb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define spa << " " <<
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init; // printf()を使うときは消す.
const int inf = INT_MAX;
const ll INF = LLONG_MAX;

int main() {
   string s;
  cin >> s;
  if(s[0] == s[s.size()-1]) Yes;
  else No;

    return 0;
}

Submission Info

Judge Result