Submission #37158291

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <limits>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <bitset>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <functional>
#include <stack>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <cassert>
#include <cstdlib>
using namespace std;

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF = (1<<30)-1;
const int MOD = 1e9+7;
const ll LINF = (1ll<<62)-1;

#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n"

int main(){
    string s; cin >> s;
    if(s.size() != 8){
        COUT("No");
    }
    else{
        bool flag = true;
        if(!(65<=s[0] && s[0]<=90)){
            flag = false;
        }
        if(!(65<=s[7] && s[7]<=90)){
            flag = false;
        }
        bool finish = false;
        for(int i=100000;i<=999999;i++){
            if(s.substr(1,6) == to_string(i)){
                finish = true;
                break;
            }
        }
        if(finish == false){
            flag = false;
        }
        if(flag == true)COUT("Yes");
        else COUT("No");
    }
}

Submission Info

Judge Result