Submission #1989629
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) using namespace std; typedef pair<int, int> P; const int mod = 1000000007; const int INF = 1e12; signed main(){ ios::sync_with_stdio(false); cin.tie(0); string s[3]; rep(i, 0, 3) cin >> s[i]; if(s[0][s[0].size() - 1] == s[1][0] && s[1][s[1].size() - 1] == s[2][0]) cout << "YES" << endl; else cout << "NO" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Shiritori |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 639 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 |