Codeforces Round #234 (Div. 2) A. Inna and Choose Options
2014-07-17 07:27
405 查看
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 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
output
题目大意:将12张卡片排成12*1 或2*6 3*4 4*3 6*2 12*1的矩形 要求至少有一列全为X
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 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张卡片排成12*1 或2*6 3*4 4*3 6*2 12*1的矩形 要求至少有一列全为X
#include<iostream> #include<cstring> using namespace std; int main() { int n,i,j,k,b[6]; char a[105]; while(cin>>n) { while(n--) { int y=0,e=0,s=0,si=0,se=0,l=0; memset(b,0,sizeof b); cin>>a; for(i=0;i<12;i++) { if(a[i]=='X') b[0]=1; if(a[i]=='X'&&a[i+6]=='X') b[1]=1; if(a[i]=='X'&&a[i+4]=='X'&&a[i+8]=='X') b[2]=1; if(a[i]=='X'&&a[i+3]=='X'&&a[i+6]=='X'&&a[i+9]=='X') b[3]=1; if(a[i]=='X'&&a[i+2]=='X'&&a[i+4]=='X'&&a[i+6]=='X'&&a[i+8]=='X'&&a[i+10]=='X') b[4]=1; } int sum=0; for(i=0;i<12;i++) if(a[i]=='X') sum++; if(sum==12) b[5]=1; int cas=0; for(i=0;i<6;i++) if(b[i]) cas++; if(b[0]) { cout<<cas<<" "<<"1x12"; if(b[1]) cout<<" "<<"2x6"; if(b[2]) cout<<" "<<"3x4"; if(b[3]) cout<<" "<<"4x3"; if(b[4]) cout<<" "<<"6x2"; if(b[5]) cout<<" "<<"12x1"; cout<<endl; } else cout<<"0"<<endl; } } return 0; }
相关文章推荐
- Codeforces Round #234 (Div. 2) B. Inna and New Matrix of Candies
- Codeforces Round #220 (Div. 2)C题:Inna and Dima(记忆化搜索+DP)
- Codeforces Round #229 (Div. 2) A. Inna and Alarm Clock
- Codeforces Round #229 (Div. 2)A. Inna and Alarm Clock
- Codeforces Round #237 (Div. 2) A. Valera and X(模拟题)
- Codeforces Round #290 (Div. 2) - C. Fox And Names (拓扑排序)
- Codeforces Round #340 (Div. 2) E. XOR and Favorite Number 莫队算法
- C. Fox And Names(Codeforces Round #290 (Div. 2))
- Codeforces Round #285 (Div. 2) ---B. Misha and Changing Handles
- Codeforces Round #305 (Div. 2) D. Mike and Feet 单调栈
- Codeforces Round #430 (Div. 2) B. Gleb And Pizza
- Codeforces Round #430 (Div. 2) D. Vitya and Strange Lesson
- Codeforces Round #305 (Div. 2)A. Mike and Fax
- Codeforces Round #292 (Div. 2)D. Drazil and Tiles
- CodeForces Round 223 Div 2 C Sereja and Prefixes
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree dfs+set
- 【Codeforces Round 263 (Div 2)A】【水题 认真读题】Appleman and Easy Task 每个点的相邻o是否都为偶数
- 【2-SAT】【并查集】ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) D. The Door Problem
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) A map B贪心 C思路前缀
- Codeforces Round #294 (Div. 2) -- C. A and B and Team Training