Problem Description
Suppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word MI, and transform it to get a new word. In each step, we can use one of the following transformation rules:
1. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
2. Replace any III with a U. For example: MUIIIU to MUUU.
3. Remove any UU. For example: MUUU to MU.
Using these three rules is it possible to change MI into a given string in a finite number of steps?
Input
First line, number of strings, n.
Following n lines, each line contains a nonempty string which consists only of letters 'M', 'I' and 'U'.
Total length of all strings <= 106.
Output
n lines, each line is 'Yes' or 'No'.
Sample Input
2
MI
MU
Sample Output
Yes
No
https://www.cnblogs.com/kuangbin/category/311577.html
答案内容至少10个字符
2 shunfurh shunfurh 于 2017.10.29 10:08 提问
Test for Rikka
matrixlineseachasit
Problem Description
As we know, Rikka is poor at math. At the test, Rikka finds that she cannot even do a single problem. There is one of the insane problems:
Given an integer K, she needs to come up with an n×n 01 matrix A and an integer m which meet B1,n=K, where B=Am.
It is too difficult for Rikka. Can you help her?
Input
The first line of the input is a single integer T (T=40), indicating the number of testcases.
Each of the next T lines contains one integer K (0≤K≤1018).
Output
For each testcase, the first line contains two space-separated integers n,m (1≤n,m≤30).
In each of following n lines print n characters (0 or 1) - the matrix A you find.
Sample Input
1
4
Sample Output
2 4
11
01
同问0 |浏览7| 收藏0 |分享
||||||
000:0
我要回答
猜你喜欢换一换
matrix类c#实现
matrix analysis 2nd edition
matrix cook book