ABC string - MarisaOJ: Marisa Online Judge

Print all strings of length

n

$n$ consisting of three characters

A

$A$ ,

B

$B$ , and

C

$C$ , where no two adjacent characters are the same. For example, the string

A B B C

$ABBC$ is not valid because it contains two adjacent

B

$B$ characters. ### Input - One line containing an integer

n

$n$ . ### Output - Print all valid strings satisfying the condition. The order of printing can be arbitrary. ### Constraints -

1 \leq n \leq 10

$1 \le n \le 10$ . ### Sample Input:

2

$2$

Output:

A B B A B C C B A C C A

$AB BA BC CB AC CA$

Backtracking
	Binary string
	ABC string
	Subset sum
	Subset
	Permutations
	Group division
	Knight's tour
	N-queens problem
	Maximum path
	Knapsack
	Build array
	Sudoku
	Minesweeper
	Travelling Salesman Problem
	Word search

Topic

Complete Search

Rating

800

Solution (1)

Solution