找出问题所在 [英] find out the problem

问题描述

大家好。在不使用任何

条件语句和任何关系运算符的情况下找出两个数字中最大的数字。

Hi to all. find out the biggest among two numbers without using any
conditional statements and any relational operators.

推荐答案

sabarish写道：

sabarish wrote:

大家好。在不使用任何
条件语句和任何关系运算符的情况下找出两个数字中最大的一个。

Hi to all. find out the biggest among two numbers without using any
conditional statements and any relational operators.

这是不可能完成的，甚至不能使用非便携式

trickery。原因很简单：没有这样的东西

作为最大的东西。只有两个数字。形容词的最高形式意味着三个或更多的选择。


如果你写的是更大的话答案可能与

不同 - 但这会让问题听起来好像家庭作业，我们不能拥有，我们可以吗？


-
Er ********* @ sun .com

This cannot be done, not even by using non-portable
trickery. The reason is simple: there is no such thing
as the "biggest" of just two numbers. The superlative
form of an adjective implies three or more alternatives.

Had you written "bigger" the answer might have been
different -- but that would have made the question sound
like homework, and we can''t have that, can we?

--
Er*********@sun.com

Eric Sosman< er ********* @ sun.com>写道：

Eric Sosman <er*********@sun.com> wrote:

sabarish写道：

sabarish wrote:

大家好。在不使用任何
条件语句和任何关系运算符的情况下找出两个数字中最大的一个。

Hi to all. find out the biggest among two numbers without using any
conditional statements and any relational operators.

即使使用非便携式的技巧也无法做到这一点。 。原因很简单：没有像最大那样的东西。只有两个数字。形容词的最高形式意味着三个或更多的选择。

This cannot be done, not even by using non-portable
trickery. The reason is simple: there is no such thing
as the "biggest" of just two numbers. The superlative
form of an adjective implies three or more alternatives.

不，他们不是。检查OED。您所描述的只是习惯性的

某些圈子，但不是唯一正确的用法。


Richard

No, they don''t. Check the OED. What you describe is merely customary in
some circles, but not the only correct usage.

Richard

sabarish写道：

sabarish wrote:

大家好。在不使用任何
条件语句和任何关系运算符的情况下找出两个数字中最大的数字。

Hi to all. find out the biggest among two numbers without using any
conditional statements and any relational operators.

那么，您有多少个开放的NNTP代理可以访问？


-

+ ------------------------- + - ------------------- + ----------------------------- +

| Kenneth J. Brody | www.hvcomputer.com | |

| kenbrody / at\spamcop.net | www.fptech.com | #include< std_disclaimer.h> |

+ ------------------------- + -------------- ------ + ----------------------------- +

不要给我发电子邮件：< mailto：Th ************* @ gmail.com>

So, how many open NNTP proxies do you have access to?

--
+-------------------------+--------------------+-----------------------------+
| Kenneth J. Brody | www.hvcomputer.com | |
| kenbrody/at\spamcop.net | www.fptech.com | #include <std_disclaimer.h> |
+-------------------------+--------------------+-----------------------------+
Don''t e-mail me at: <mailto:Th*************@gmail.com>

这篇关于找出问题所在的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！