Submission #942322

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;



int main(void){
  string s;
  cin >> s;
  bool check_c = false;
  bool check_t = false;
  for (unsigned int i = 0; i < s.size(); i++)
    {
      if (s[i] == 'c')
	check_c = true;
      if (s[i] == 't' && check_c)
	check_t = true;
    }
  if (check_t)
    cout << "Yes"<<endl;
  else
    cout<<"No"<<endl;
  
}

Submission Info

Judge Result