Submission #3259767

---

Source Code Expand

#include <bits/stdc++.h>
#define rep( i, n ) for( int ( i ) = 0; ( i ) < ( n ); ( i )++ )
#define repr( i, n ) for( int ( i ) = ( n ); ( i ) >= 0; ( i )-- )
#define FOR( i, m, n ) for( int ( i ) = ( m ); ( i ) < ( n ); ( i )++ )
#define all( x ) ( x ).begin(), ( x ).end()
typedef long long lint;
using namespace std;

int main( void ){
	
	int n;
	string str[100];
	char last;
	char mae;
	mae = '0';
	
	cin >> n;
	
	rep(i,n){
		cin >> str[i];
	}
	
	last = str[0][str[0].size()-1];
	
	FOR( i, 1, n){
		
		if( last != str[i][0] ){
			cout << "No" << endl;
			return 0;
		}
		
		rep( j, n ){
			if( str[i] == str[j] and i != j ){
			cout << "No" << endl;
			return 0;
			}
		
		}
		
		last = str[i][str[i].size()-1];
		
	}
	
	cout << "Yes" << endl;
	
	return 0;
}

Submission Info

Judge Result