IT討論區(83) 點解廢人可以做得比你少,人工比你多,公平咩

1001 回覆
4 Like 1 Dislike
2020-05-16 17:51:45
2020-05-16 17:54:06
悶死 日日對住個mon
2020-05-16 17:57:31
2020-05-16 18:16:47
Dev先最快樂 砌吓砌吓咗 楽しい
2020-05-16 18:22:43
2020-05-16 18:28:12
Dev完唔駛main 先快樂
2020-05-16 18:40:13
有冇巴打做過ibank data 嗰邊既野
想問下做ibank Data analysis 前景
2020-05-16 19:50:20
痴左線
2020-05-16 20:02:05
做曲狗又燒腦又要日日比人撚
長期對著個mon自閉
fg唔好哂時間做啦
2020-05-16 20:04:03
快樂砌曲 毒撚嘅朗癲
2020-05-16 21:05:45
2020-05-16 21:16:13
2020-05-16 22:58:34
2020-05-16 23:03:41
2020-05-16 23:36:13
做左幾年support狗
想向專少少發展
想知Oracle Database Administration Certified Professional 考完有冇用?
心思思想報systematics
本人淨係得個degree同uipath RPA既cert
唔知點開始好
2020-05-16 23:59:08
2020-05-17 00:22:33
2020-05-17 00:47:19
2020-05-17 00:57:42
2020-05-17 01:03:10
學左新既黑魔法覺得自己algo真係好差

The Fortran I compiler would expand each operator with a sequence of parentheses. In a simplified form of the algorithm, it would

replace + and – with ))+(( and ))-((, respectively;
replace * and / with )*( and )/(, respectively;
add (( at the beginning of each expression and after each left parenthesis in the original expression; and
add )) at the end of the expression and before each right parenthesis in the original expression.
Although not obvious, the algorithm was correct, and, in the words of Knuth, “The resulting formula is properly parenthesized, believe it or not.”
2020-05-17 08:46:24
Yes, you can generalize it to + - * / and ^.

+ -> )))+((( ditto for -
* -> ))*((
^ -> )^(

enclose the whole expression with ((( and )))

If you have n different precedence level, use one level of () for the operators with the highest precedence and add one () for each level going down.
2020-05-17 10:47:53
黑魔黎講
呢個真係大開眼介
http://suffe.cool/poker/evaluator.html
2020-05-17 11:02:34
2020-05-17 11:38:12
佢哋缺人又即請你 你先最有bargaining power
吹水台自選台熱 門最 新手機台時事台政事台World體育台娛樂台動漫台Apps台遊戲台影視台講故台健康台感情台家庭台潮流台美容台上班台財經台房屋台飲食台旅遊台學術台校園台汽車台音樂台創意台硬件台電器台攝影台玩具台寵物台軟件台活動台電訊台直播台站務台黑 洞