Codeforces 400 A. Inna and Choose Options
来源:互联网 发布:电视猫云os优化版 编辑:程序博客网 时间:2024/05/16 16:02
A. Inna and Choose Options
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 b cards 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.
Sample Input
4
OXXXOXOOXOOX
OXOXOXOXOXOX
XXXXXXXXXXXX
OOOOOOOOOOOO
3 1x12 2x6 4x3
4 1x12 2x6 3x4 6x2
6 1x12 2x6 3x4 4x3 6x2 12x1
0
/*题目大意 给定一个长度为12的字符串包含两种字符'o'和'x',问将这个字符串转换为长宽分别为多少的矩阵会让矩阵的某一列都为'x',输出数量和所有可能的长宽.*/
/*模拟即可*/
#include <algorithm>#include <iostream>#include <numeric>#include <cstring>#include <iomanip>#include <string>#include <vector>#include <cstdio>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <map>#include <set>#define LL long long#define pr pair<int,int>#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define Pair pair<int,int>const int INF = 0x3f3f3f3f;using namespace std;char arr[15];bool cal(int x,int y){ for(int i=0;i<y;i++){ bool f = true; for(int j=i;j<12;j+=y){ if(arr[j] == 'O'){ f = false; break; } } if(f) return true; } return false;}int main(){ int t; scanf("%d",&t); while(t-- && scanf("%s",arr)){ queue<pr>Q; for(int i=1;i<=12;i++) for(int j=1;j<=12;j++) if(i * j == 12 && cal(i,j)) Q.push(make_pair(i,j)); printf("%d",Q.size()); while(!Q.empty()){ printf(" %dx%d",Q.front().first,Q.front().second);Q.pop(); } printf("\n"); } return 0;}
- codeforces 400A - Inna and Choose Options
- Codeforces 400A Inna and Choose Options
- CodeForces 400A Inna and Choose Options
- Codeforces 400A Inna and Choose Options
- CodeForces 400A Inna and Choose Options
- CodeForces 400A Inna and Choose Options
- Codeforces 400 A. Inna and Choose Options
- Codeforces 400A Inna and Choose Options(暴力)
- CodeForces 400A(Inna and Choose Options)
- Codeforces 400A Inna and Choose Options 【水题】
- CF 400A - Inna and Choose Options
- Codeforence 400 A. Inna and Choose Options
- codeforces Inna and Choose Options
- A. Inna and Choose Options
- A. Inna and Choose Options
- A - Inna and Choose Options
- Codeforces Round #234 (Div. 2) :A. Inna and Choose Options
- Codeforces Round #234 (Div. 2) A. Inna and Choose Options
- log4j.properties配置详解与实例-全部测试通过
- 洛谷OJ P1196 银河英雄传说(带权并查集)
- 数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历
- INFORMATICA学习之路-02-配置问题1-配置客户端报错没有权限
- 用studio生成签名文件
- Codeforces 400 A. Inna and Choose Options
- 《深入理解Linux内核3rd》学习笔记——进程切换(上):相关知识
- Struts常见异常解答:There is no Action mapped for namespace / and action name . - [unknown location]
- 数据库索引
- 机器学习实战-Logistic回归
- 怎么样修改SCHEDULE的repeat_interval
- 9. Palindrome Number
- 读写锁rwlock
- JAVA学习总结之方法重写