codeforces round #234 div.2 A

codeforces round #234 div.2 A

A. Inna and Choose Options

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

There always is something to choose from! And now, instead of "Noughts and Crosses", Inna choose a very unusual upgrade of this game. The rules of the game are given below:

There is one person playing the game. Before the beginning of the game he puts 12 cards in a row on the table. Each card contains a character: "X" or "O". Then the player chooses
two positive integers a and
b (a·b = 12), after that he makes a table of sizea × b from the cards he put on the table as follows: the firstb
cards form the first row of the table, the secondb cards form the second row of the table and so on, the lastb cards form the last (numbera)
row of the table. The player wins if some column of the table contain characters "X" on all cards. Otherwise, the player loses.

Inna has already put 12 cards on the table in a row. But unfortunately, she doesn't know what numbersa andb to choose. Help her win the game: print to her all the possible ways
of numbersa, b that she can choose and win.

Input
The first line of the input contains integer t(1 ≤ t ≤ 100). This value shows the number of sets of test data in the input. Next follows the description of each of thet
tests on a separate line.

The description of each test is a string consisting of 12 characters, each character is either "X", or "O". Thei-th character of the string
shows the character that is written on thei-th card from the start.

Output
For each test, print the answer to the test on a single line. The first number in the line must represent the number of distinct ways to choose the paira, b. Next, print on this line the pairs in the formataxb.
Print the pairs in the order of increasing first parameter (a). Separate the pairs in the line by whitespaces.

Sample test(s)

Input

4
OXXXOXOOXOOX
OXOXOXOXOXOX
XXXXXXXXXXXX
OOOOOOOOOOOO

Output

3 1x12 2x6 4x3
4 1x12 2x6 3x4 6x2
6 1x12 2x6 3x4 4x3 6x2 12x1
0

简单模拟

大概意思就是给你12个纸牌（纸牌上只有两种符号‘X’或者'O’）排成一行 然后让你把它有序（就是给你时候的顺序 分为a行每行b个 即 a * b = 12）的分为a*b的矩阵 然后再形成的矩阵中如果出现有一列都是‘X’ 那么这个分割方法就有效 记录下来

最后输出有多少种有效方法 并且按照a的升序输出a*b

解法 就按照常规的模拟 写就好

a数组用来标记行序数（对每种进行判断）或者说分割方法

b数组用来记录对应行序数是否可行

真tm要哭了 写这个题的时候脑子一直发热 就循环下标志的问题一直错 然后接着就晕蛋了  两个小时死磕这个题结果啥都没做出来 最后洗个脸回来重写直接ac

真的在写代码前要构思好啊！！！！

ac代码

http://paste.ubuntu.com/7039992/