0526 CF#400A&G2n#B - Inna and Choose Options

摘要:

对给定的有序字符串分不同行排，看是否满足给给定特征。
原题目链接：CodeForces
- 400A

 Inna
and Choose Options

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 size a × b from
the cards he put on the table as follows: the first bcards form the first row of the table, the second b cards form the second row of the table and so on, the last b cards
form the last (number a) 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 numbers a and b to choose. Help her win the game: print to her all the possible ways
of numbers a, 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 the t tests on a separate line.
The description of each test is a string consisting of 12 characters, each character is either "X", or "O". The i-th
character of the string shows the character that is written on the i-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 pair a, b. Next,
print on this line the pairs in the format axb. Print the pairs in the order of increasing first parameter (a).
Separate the pairs in the line by whitespaces.

Example

Input

4
OXXXOXOOXOOX
OXOXOXOXOXOX
XXXXXXXXXXXX
OOOOOOOOOOOO

Output

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

来源： https://cn.vjudge.net/problem/description/41659?1495774616000

题目认识：
每次判定可以实际创建一个副本，也可以直接计算对应的下标来判断。
注意：

日期：
2017 05 26
代码：

#include <cstdio>

#include <algorithm>

#include <cmath>

#include <memory.h>

#include <iostream>

using namespace std;

#define MAX 12

int r[]={1,2,3,4,6,12};

int c[]={12,6,4,3,2,1};

bool ok[6];

char str[13];

bool useway(int way){

bool ts;

for(int j=0;j<c[way];j++){

ts=true;

for(int i=0;i<r[way];i++){

if( str[i*c[way]+j] != 'X'){ts=false;break;}

}

//  printf("\ncol:%d,ok:%d\n",j,ts?1:0);

if(ts){

return true;

}

}

return false;

}

int main(){

int t,cnt;

int ways=0;

scanf("%d\n",&t);

while(t--){

scanf("%s\n",str);

//printf("\n$%s\n",str);

memset(ok,false,6*sizeof(bool));

cnt=0;

for(int i=0;i<6;i++){

if(useway(i)){ok[i]=true;cnt++;}

}

if(cnt){

printf("%d",cnt);

for(int i=0;i<6;i++) if(ok[i]) printf(" %dx%d",r[i],c[i]);

}else printf("0");

putchar('\n');

}

return 0;

}