首页 > ACM题库 > HDU-杭电 > hdu 4172 Octagons待解决[解题报告]C++
2015
05-23

hdu 4172 Octagons待解决[解题报告]C++

Octagons

问题描述 :

Below is a picture of an infinite hyperbolic tessellation of octagons. If we think of this as a graph of vertices (of degree three), then there exists an isomorphism of the graph which maps any vertex x onto any other vertex y. Every edge is given a label from the set {a,b,c} in such a way that every vertex has all three types of edges incident on it, and the labels alternate around each octagon. Part of this labeling is illustrated in the diagram.

Paper Route

So a path in this graph (starting from any vertex) can be specified by a sequence of edge labels. Your job is to write a program which, given a squence of labels such as "abcbcbcabcaccabb", returns "closed" if the path ends on the same vertex where it starts, and returns "open" otherwise.

输入:

The input will begin with a number Z ≤ 200 on a line by itself. This is followed by Z lines, each of which is a squence of length at least 1 and at most 40 of ‘a’s ‘b’s and ‘c’s.

输出:

The input will begin with a number Z ≤ 200 on a line by itself. This is followed by Z lines, each of which is a squence of length at least 1 and at most 40 of ‘a’s ‘b’s and ‘c’s.

样例输入:

2
abababab
abcbcbcbcba

样例输出:

closed
open