A. Inna and Choose Options
2014-03-08 21:25
597 查看
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 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 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个只含有O、X的字符,拆成 a x b ,若至少存在一列全为X的,则输出个数,并输出a x b
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 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个只含有O、X的字符,拆成 a x b ,若至少存在一列全为X的,则输出个数,并输出a x b
#include <iostream> #include <stdio.h> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; char s[15]; char st[15][15]; bool judge(int a,int b) { for(int i=0;i<a;i++) { for(int j=0;j<b;j++) { st[i][j]=s[i*b+j]; } } for(int i=0;i<b;i++) { int j; for(j=0;j<a;j++) { if(st[j][i]!='X') break; } if(j==a) return true; } return false; } int main() { int n,ans; while(scanf("%d",&n)!=EOF) { while(n--) { scanf("%s",s); ans=0; if(judge(1,12)) ans++; if(judge(2,6)) ans++; if(judge(3,4)) ans++; if(judge(4,3)) ans++; if(judge(6,2)) ans++; if(judge(12,1)) ans++; cout<<ans; if(judge(1,12))cout<<" 1x12"; if(judge(2,6)) cout<<" 2x6"; if(judge(3,4)) cout<<" 3x4"; if(judge(4,3)) cout<<" 4x3"; if(judge(6,2)) cout<<" 6x2"; if(judge(12,1)) cout<<" 12x1"; cout<<endl; } } return 0; }
相关文章推荐
- linux安全体系的文件权限管理
- Puppet基础篇4-安装、配置并使用Puppet 推荐
- codeforces round #234B(DIV2) A Inna and Choose Options
- Tips for Unix/Linux
- corosync与pacemaker实现nfs作为共享存储的Mysql高可用!
- Linux常用命令
- 中文版 OPC UA 规范 1
- 解决VS2012新建MVC3等项目时,收到加载程序集“NuGet.VisualStudio.Interop…”的错误
- 使用Heartbeat V1和V2 实现nfs作为共享存储的高可用
- opencv 关于 cvCalcHist的含义(1)
- linux根目录
- file结构体
- 在Mac OS X中配置Apache+php
- 嵌入式Linux和WinCE应用线程时间片分析比较
- Windows Phone – 裁剪图片 (Crop Image)
- Tomcat源码阅读之StandardService与MapperListener分析
- 使用MyEclipse和Tomcat部署web项目
- javaWEB _Tomcat的安装和配置
- 使用Heartbeat V1实现nfs作为共享存储的高可用
- Shell多行注释