破解保险箱AI (CI翻译)
Right now you are to solve a very, very simple problem — to crack the safe. Four positive integers stand one by one on a circle protecting the safe. You know that to unlock this striking safe you have to make all four numbers equal to one. Operations are as follows: you may choose two adjacent numbers and increase both by one; you may choose two adjacent even numbers and divide both by two. Nothing else. Crack the safe!
Input
输入格式
AI (CI翻译)The single line of the input contains four space-separated integer positive numbers not greater than $10^{9}$ each — four numbers on the circle in consecutive order.
输入仅一行，包含四个以空格分隔的正整数，每个数均不超过 $10^{9}$，它们按照圆上的连续顺序给出。AI (CI翻译)
Output
输出格式
AI (CI翻译)The output should contain "-1" (quotes for clarity) if the safe is secure, that is it's impossible to crack it. Otherwise, output should contain the sequence of operations (one operations per line) leading to unlocking the safe. You don't have to minimize the number of operations, but it should not exceed 1000. To make things clear, assume numbers stand on positions 1 through 4. Each operation is encoded by two symbols. If the following operation is dividing then first symbol is '/'; otherwise it's '+' (addition). The second symbol is the position of the first number in pair in consecutive order. (see samples for clarification).
如果保险箱是安全的，也就是说无法破解，应输出 "-1"（引号仅为说明）。否则，应输出一系列操作（每行一个操作），使四个数最终变为 1。不要求操作次数最少，但操作次数不得超过 1000 次。为便于说明，假设四个数所在的位置编号为 1 至 4。每个操作由两个符号组成：如果是除法操作，第一个符号为 '/'；否则为 '+'（加法操作）。第二个符号表示这对相邻数字中第一个数字的位置编号（按顺序排列）。（具体格式请参见样例。）AI (CI翻译)
If there are several solutions, output any of them.
如果有多个解，输出任意一个即可。AI (CI翻译)
样例
1 1 1 1
1 2 4 2
/2
/3
3 3 1 1
+1
/1
/1
2 1 2 4
/3
/4
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（gpt-6.1-sol），如有出入请以原文为准。