且构网

分享程序员开发的那些事...
且构网 - 分享程序员编程开发的那些事

移动一根棍子-简单的拼图可以帮助

更新时间:2022-04-17 15:06:06

我们告诉过您,这里的工作方式并非如此.这是您的作业,应该继续进行.

这是询问者的期望:
1. 先尝试您要做什么!您可能会发现它并不难.
2.制定看起来像问题/无法解决的问题.

试试看,告诉他们是否遇到问题.
成员将很乐意为您提供帮助.



尝试从这里开始,执行以下步骤:
1.将A,B和R定义为一个或多个数字的序列,但不超过9个数字.
2.定义一个可以是四个运算符之一的"X":`+-*/".
3.将"n"定义为代表要移动的摇杆数量的自然数.
4.要求输入基于1、2&的信息. 3.
5.重复4,直到看到"EOF"(不带引号).

继续.
We told you that it does not work like this here. This is your assignment and you should work on it.

Here is what is expected of enquirers:
1. TRY first what you want to do! You may find that it''s not that hard.
2. Formulate what was done by you that looks like an issue/not working.

Try them and tell if you face issues.
Members will be more than happy to help like this.



Try, start from here, steps:
1. Define A , B , and R as sequences of one or more digits, but no more than nine digits.
2. Define an ''X'' that can be one of the four operators: `+ - * /''.
3. Define ''n'' as a natural number representing the number of sticks to move.
4. Ask for input based on 1, 2 & 3.
5. Repeat 4 until you see "EOF" (without the quotes.)

Move on.