主頁 高登熱話 吃喝玩樂 科技消費 名人專訪 短片
現有會員可[按此]登入。未成為會員可[按此]註冊。
[公司模式 - 關]  [懷舊模式 - 開
[Youtube 預覽 - 關]  [大字型]  [小字型]

您現在聚腳在 學術台內。

將已解封的舊帳戶升級高級會員

我們上年12月曾解封部分只輕微觸犯版規或懷疑被駭的帳戶,但有會員反映一些於2009年前登記的舊帳戶在解封後未有自動升級為高級會員,現在我們已將該批帳戶升級,謝謝。
精選文章
DeerGamer
New App Android IOS
跳至第

發起人
想問下有冇python神人
173 個回應
做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面


d = [1, 2, 3]

for i in d:
if m % i == 0:
print(1)
else:
print(0)

類似咁呀


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒

我試下先


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒

我試下先

等等先
你裝input 用兩個list
之後未個list for loop range
check 下岩岩先
ie 係integer only and only two no. for first input list
岩曬既先出matrix
唔係既叫user再入
入完一行input就要check一次


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒

我試下先

等等先
你裝input 用兩個list
之後未個list for loop range
check 下岩岩先
ie 係integer only and only two no. for first input list
岩曬既先出matrix
唔係既叫user再入
入完一行input就要check一次

啱啱先發現原來Split已經會俾埋個list我[sosad] 搞到我仲棘咗係到半粒鐘


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒

我試下先

等等先
你裝input 用兩個list
之後未個list for loop range
check 下岩岩先
ie 係integer only and only two no. for first input list
岩曬既先出matrix
唔係既叫user再入
入完一行input就要check一次

啱啱先發現原來Split已經會俾埋個list我[sosad] 搞到我仲棘咗係到半粒鐘

你唔識咪每個step都print出黎睇下係咩囉...xx(


做到第三條未

第一條都搞唔掂:~(

第一條邊到唔明

而家有多過兩個Input啦,咁我咪split開變個list囉。咁call出嚟嘅時侯要點逐個call?
(a,divisor1,divisor2,divisor3)
要點寫先可以Call埋一行出
同埋之後Divide要點做?因為我月開始係唔知有幾多個divisor input,咁我要點寫下面

用for loop一個個call出黎...
上面打左, 但係D空格俾高登食晒

我試下先

等等先
你裝input 用兩個list
之後未個list for loop range
check 下岩岩先
ie 係integer only and only two no. for first input list
岩曬既先出matrix
唔係既叫user再入
入完一行input就要check一次

啱啱先發現原來Split已經會俾埋個list我[sosad] 搞到我仲棘咗係到半粒鐘

你唔識咪每個step都print出黎睇下係咩囉...xx(

呢個真[sosad] [sosad] [sosad]


Python 實有trace同 step forward嘅debug介面


樓主影第4條睇下


樓主影第4條睇下

In this question, you are going to implement an artificial intelligence (AI) vs. human version of Notakto. The AI will be the Player 1, i.e., the AI will always start. Here the AI means that the move of player 1 is determined by your program automatically. You should finish the previous question first before working on this one. All output / input requirements are identical to the previous question. The only difference is that you replace Player 1 with an AI, i.e., don't wait for user input and let your program decide the valid move.

In Notakto, Player 1 can force a win. It doesn't matter how Player 2 plays. If Player 1 plays optimally there should be a win for Player 1. In this task your AI must always win. Here is an example run (bold font represents user input).

A B C
0 1 2 0 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B0
A B C
0 1 2 X 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 2: B3
A B C
0 1 2 X 1 2 0 1 2
3 4 5 X 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B6
A C
0 1 2 0 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 2: C0
A C
0 1 2 X 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 1: C3
A C
0 1 2 X 1 2
3 4 5 X 4 5
6 7 8 6 7 8
Player 2: C6
A
0 1 2
3 4 5
6 7 8
Player 1: A0
A
X 1 2
3 4 5
6 7 8
Player 2: A4
A
X 1 2
3 X 5
6 7 8
Player 1: A7
A
X 1 2
3 X 5
6 X 8
Player 2: A8
Player 1 wins game
There will be no student site automatic marking for this question. Please perform your own testing and ensure that you never win against your AI. We suggest that you finish the previous question first and then copy over your code from there and only change the part where player 1 (your AI implementation) is moving.

We will mark your code by playing a number of games against an optimal AI. Your AI must win all games to get full marks for this question.

Important: Implementing an optimal AI that is able to always win does not require complex computation. Your AI must be very fast. We will use a time threshold of 1 second per move. You are allowed to discuss solution strategies for this question. But don't share any code.

You may use any functions/operators for this question.


樓主影第4條睇下

In this question, you are going to implement an artificial intelligence (AI) vs. human version of Notakto. The AI will be the Player 1, i.e., the AI will always start. Here the AI means that the move of player 1 is determined by your program automatically. You should finish the previous question first before working on this one. All output / input requirements are identical to the previous question. The only difference is that you replace Player 1 with an AI, i.e., don't wait for user input and let your program decide the valid move.

In Notakto, Player 1 can force a win. It doesn't matter how Player 2 plays. If Player 1 plays optimally there should be a win for Player 1. In this task your AI must always win. Here is an example run (bold font represents user input).

A B C
0 1 2 0 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B0
A B C
0 1 2 X 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 2: B3
A B C
0 1 2 X 1 2 0 1 2
3 4 5 X 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B6
A C
0 1 2 0 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 2: C0
A C
0 1 2 X 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 1: C3
A C
0 1 2 X 1 2
3 4 5 X 4 5
6 7 8 6 7 8
Player 2: C6
A
0 1 2
3 4 5
6 7 8
Player 1: A0
A
X 1 2
3 4 5
6 7 8
Player 2: A4
A
X 1 2
3 X 5
6 7 8
Player 1: A7
A
X 1 2
3 X 5
6 X 8
Player 2: A8
Player 1 wins game
There will be no student site automatic marking for this question. Please perform your own testing and ensure that you never win against your AI. We suggest that you finish the previous question first and then copy over your code from there and only change the part where player 1 (your AI implementation) is moving.

We will mark your code by playing a number of games against an optimal AI. Your AI must win all games to get full marks for this question.

Important: Implementing an optimal AI that is able to always win does not require complex computation. Your AI must be very fast. We will use a time threshold of 1 second per move. You are allowed to discuss solution strategies for this question. But don't share any code.

You may use any functions/operators for this question.

先手又真係必贏架喎


樓主影第4條睇下

In this question, you are going to implement an artificial intelligence (AI) vs. human version of Notakto. The AI will be the Player 1, i.e., the AI will always start. Here the AI means that the move of player 1 is determined by your program automatically. You should finish the previous question first before working on this one. All output / input requirements are identical to the previous question. The only difference is that you replace Player 1 with an AI, i.e., don't wait for user input and let your program decide the valid move.

In Notakto, Player 1 can force a win. It doesn't matter how Player 2 plays. If Player 1 plays optimally there should be a win for Player 1. In this task your AI must always win. Here is an example run (bold font represents user input).

A B C
0 1 2 0 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B0
A B C
0 1 2 X 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 2: B3
A B C
0 1 2 X 1 2 0 1 2
3 4 5 X 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B6
A C
0 1 2 0 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 2: C0
A C
0 1 2 X 1 2
3 4 5 3 4 5
6 7 8 6 7 8
Player 1: C3
A C
0 1 2 X 1 2
3 4 5 X 4 5
6 7 8 6 7 8
Player 2: C6
A
0 1 2
3 4 5
6 7 8
Player 1: A0
A
X 1 2
3 4 5
6 7 8
Player 2: A4
A
X 1 2
3 X 5
6 7 8
Player 1: A7
A
X 1 2
3 X 5
6 X 8
Player 2: A8
Player 1 wins game
There will be no student site automatic marking for this question. Please perform your own testing and ensure that you never win against your AI. We suggest that you finish the previous question first and then copy over your code from there and only change the part where player 1 (your AI implementation) is moving.

We will mark your code by playing a number of games against an optimal AI. Your AI must win all games to get full marks for this question.

Important: Implementing an optimal AI that is able to always win does not require complex computation. Your AI must be very fast. We will use a time threshold of 1 second per move. You are allowed to discuss solution strategies for this question. But don't share any code.

You may use any functions/operators for this question.

先手又真係必贏架喎

我連點分輸贏都睇唔到[sosad] [sosad] [sosad]


樓主影第4條睇下

In this question, you are going to implement an artificial intelligence (AI) vs. human version of Notakto. The AI will be the Player 1, i.e., the AI will always start. Here the AI means that the move of player 1 is determined by your program automatically. You should finish the previous question first before working on this one. All output / input requirements are identical to the previous question. The only difference is that you replace Player 1 with an AI, i.e., don't wait for user input and let your program decide the valid move.

In Notakto, Player 1 can force a win. It doesn't matter how Player 2 plays. If Player 1 plays optimally there should be a win for Player 1. In this task your AI must always win. Here is an example run (bold font represents user input).

A B C
0 1 2 0 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: B0
A B C
0 1 2 X 1 2 0 1 2
3 4 5 3 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 2: B3
A B C
0 1 2 X 1 2 0 1 2
3 4 5 X 4 5 3 4 5
6 7 8 6 7 8 6 7 8
Player 1: Player 1 wins game
There will be no student site automatic marking for this question. Please perform your own testing and ensure that you never win against your AI. We suggest that you finish the previous question first and then copy over your code from there and only change the part where player 1 (your AI implementation) is moving.

We will mark your code by playing a number of games against an optimal AI. Your AI must win all games to get full marks for this question.

Important: Implementing an optimal AI that is able to always win does not require complex computation. Your AI must be very fast. We will use a time threshold of 1 second per move. You are allowed to discuss solution strategies for this question. But don't share any code.

You may use any functions/operators for this question.

先手又真係必贏架喎

我連點分輸贏都睇唔到[sosad] [sosad] [sosad]

最後個個人連到直線就輸



Between Q3 Notakto.py


https://upload.hkgolden.media/comment/p3xczgd2.lacymbebh5r.ok53wt50two.gel.png
樓主打電話搵幫手啦[sosad]


https://upload.hkgolden.media/comment/p3xczgd2.lacymbebh5r.ok53wt50two.gel.png
樓主打電話搵幫手啦[sosad]

而家就係唔知點Mod:-(


點解講完又會話唔知[sosad] [sosad]
睇返上面咪有


點解講完又會話唔知[sosad] [sosad]
睇返上面咪有

我地仲緊張過樓主[sosad] [sosad] [sosad]

btw 第4條幾好玩 諗到點整但未寫


跳至第



  快速回覆 - 輸入以下項目

本討論區現只接受會員張貼文章,本站會員請先登入。非會員人仕,您可以按此加入為新會員,費用全免,並可享用其他會員服務。


上次光臨時間: 1/12/2020 5:00
今天貼文總數: 462 | 累積文章數目: 6,777,472

聯絡我們 | 服務條款 | 私隱政策 | 廣告查詢 | 職位空缺
Copyright © 2020 HKGolden.com. All Rights Reserved.