Submission #1988526
Source Code Expand
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for(int i = (m);i < (n);i++)
#define REP(i,n) for(int i = 0; i < int(n); i++)
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define PAIR pair<int,int>
#define MP make_pair
#define VP vector<pair<int,int>>
#define VS vector<string>
#define QUE queue<int>
#define DEQ deque<int>
#define PQUE priority_queue<int> //5,5,4,3,3,2,...
#define REPQUE priority_queue<int, vector<int>, greater<int>> //1,1,2,3,4,4,5,...
#define SUM(obj) accumulate((obj).begin(), (obj).end(), 0)
#define SORT(obj) sort((obj).begin(), (obj).end()) // 1,2,3,4,5...
#define RESORT(obj) sort((obj).begin(), (obj).end(), greater<int>()) // 5,4,3,2,1...
#define UB(obj,n) upper_bound((obj).begin(), (obj).end(), n) //itr > n
#define LB(obj,n) lower_bound((obj).begin(), (obj).end(), n) //itr>= n
const ll MOD = (ll)1e9 + 7;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool flag = false;
if ((A[A.size() - 1] == B[0])&&(B[B.size() - 1] == C[0])) flag = true;
string S = (flag) ? "YES" : "NO";
cout << S << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Shiritori |
User |
ningenMe |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1539 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example0, example1, example2, example3 |
All |
ansno0, ansno1, ansno2, ansno3, ansno4, ansyes0, ansyes1, ansyes2, ansyes3, ansyes4, example0, example1, example2, example3 |
Case Name |
Status |
Exec Time |
Memory |
ansno0 |
AC |
1 ms |
256 KB |
ansno1 |
AC |
1 ms |
256 KB |
ansno2 |
AC |
1 ms |
256 KB |
ansno3 |
AC |
1 ms |
256 KB |
ansno4 |
AC |
1 ms |
256 KB |
ansyes0 |
AC |
1 ms |
256 KB |
ansyes1 |
AC |
1 ms |
256 KB |
ansyes2 |
AC |
1 ms |
256 KB |
ansyes3 |
AC |
1 ms |
256 KB |
ansyes4 |
AC |
1 ms |
256 KB |
example0 |
AC |
1 ms |
256 KB |
example1 |
AC |
1 ms |
256 KB |
example2 |
AC |
1 ms |
256 KB |
example3 |
AC |
1 ms |
256 KB |