Submission #1987873
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++) #define REP(i,n) FOR(i,0,n) #define RER(i,n) FOR(i,0,(n+1)) #define pb push_back #define mp(a,b) make_pair((a),(b)) #define mset(m,v) memset(m,v,sizeof(m)) using namespace std; typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef vector<ll> vl; typedef pair<ll,ll> pll; typedef vector<pair<ll, ll> > vpll; typedef vector<string> vs; typedef long double ld; const double EPS = 1e-10; const int INF = 1e+9; const double PI = acos(-1); auto main() -> int { string a, b, c; cin >> a >> b >> c; if ( a[a.length() - 1] == b[0] && b[b.length() - 1] == c[0] ) { cout << "YES" << endl; } else { cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shiritori |
User | kagemiku |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 878 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 |