← 返回题目

题库练习 Nice table

← 上一题下一题 →

A12325 | $Nice table$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given an $n \times m$ table, consisting of characters «A», «G», «C», «T». Let's call a table nice, if every $2 \times 2$ square contains all four distinct characters. Your task is to find a nice table (also consisting of «A», «G», «C», «T»), that differs from the given table in the minimum number of characters.

输入格式

First line contains two positive integers $n$ and $m$ — number of rows and columns in the table you are given ( $2 \leq n, m, n \times m \leq 300\,000$ ). Then, $n$ lines describing the table follow. Each line contains exactly $m$ characters «A», «G», «C», «T».

输出格式

Output $n$ lines, $m$ characters each. This table must be nice and differ from the input table in the minimum number of characters.

输入输出样例

输入 #1

2 2
AG
CT

输出 #1

AG
CT

输入 #2

3 5
AGCAG
AGCAG
AGCAG

输出 #2

TGCAT
CATGC
TGCAT

C++ 编辑器

输入

输出