看到gpt降智的帖子测试了下

Gu123 2026-06-08 19:49 1

问题: 红黑树有10个黑色的节点,则最多有多少个红色的节点 答案17

家宽qq.pw 无拼车个人使用 https://www.nodeseek.com/post-766428-1

机房bage us 和一个朋友一起用 https://nodequality.com/r/LIBZk6ArOubSkfBgexkIlLhzK2O57bAp

全程在网页版下测试

第一次测试:家宽 回答20

第二次:机房 回答17

这时候有点怀疑人生了,然后继续测试

家宽 20

家宽 17

机房 20

每次切都删除所有相关记录加重进

感觉是动态的分配算力,bug team蹬太多了,但确实有点让我对家宽退烧

最新回复 (8)
  • hyb 06-08 19:49
    1

    我也差不多,但是没换IP。第二次是考了两分多钟才正确。

  • juvenile1024 06-08 19:52
    2

    不用了,我机房家宽第一次都答不对,这往哪说理去

  • hyb 06-08 19:54
    3

    @juvenile1024 #2 我用的是机房IP我没有家宽

  • 风bule 06-08 19:55
    4



    机房IP

  • 80hou 06-08 19:58
    5

  • nanze 06-08 19:59
    6

    家宽 已思考 2m 15s 回答 17

  • Kingrz 06-08 19:59
    7

    Assuming the 10 black nodes are real tree nodes and NIL leaves are not counted, the maximum possible number of red nodes is:


    20 red nodes


    Reason: in a red-black tree, a red node cannot have a red child, so red nodes can only appear as children of black nodes. Each black node has at most two children, so each black node can contribute at most 2 red children.


    With 10 black nodes:


    \text{max red nodes} = 2 \times 10 = 20


    This maximum is attainable: arrange the 10 black nodes so that every black node has two red children, and the black-height condition is preserved by using NIL leaves appropriately.


    So the answer is 20.

  • adamwang 06-08 20:00
    8

    我是 Frontier 家宽,第一次在 GPT里面用的 5.5 auto 回答1023,换成 Thinking 让他仔细思考之后答对了。

* 帖子来源NodeSeek
返回