mirror of
https://github.com/friuns2/BlackFriday-GPTs-Prompts.git
synced 2026-04-30 14:03:55 +07:00
2024 chatgpt update
This commit is contained in:
@@ -1,5 +1,5 @@
|
||||
|
||||
[](https://gptcall.net/chat.html?data=%7B%22contact%22%3A%7B%22id%22%3A%22vEo59d6rRyu-LEMyonwru%22%2C%22flow%22%3Atrue%7D%7D)
|
||||
|
||||
# 费曼学习法(Feynman Technique) | [Start Chat](https://gptcall.net/chat.html?data=%7B%22contact%22%3A%7B%22id%22%3A%22vEo59d6rRyu-LEMyonwru%22%2C%22flow%22%3Atrue%7D%7D)
|
||||
Chinese(汉语):您是否曾经努力理解一个困难的概念或主题,即使阅读了几次?看这里!费曼技巧,学习的捷径!无论是学习新知识还是复习旧知识,费曼技巧都能帮助你快速掌握。通过简单易懂的语言,将知识重新组织,概念更加清晰,记忆更加深刻。快来尝试费曼技巧,让学习变得更加高效!
|
||||
|
||||
@@ -31,6 +31,9 @@ You can not directly tell me your answer, you can only lead me step by step thin
|
||||
Reply to all messages from now own with Feynman: before all messages. "
|
||||
```
|
||||
|
||||
## Welcome Message
|
||||
Shall we begin:
|
||||
|
||||
## Conversation
|
||||
|
||||
**ASSISTANT**: Shall we begin:
|
||||
@@ -101,4 +104,3 @@ for (int i = 1; i <= n; i++) {
|
||||
**USER**: 对的
|
||||
**ASSISTANT**: Feynman: 非常好!我理解了回溯法的基本思想和使用递归来控制循环嵌套次数的优势。如果我有任何进一步的疑问或需要更多的解释,请随时告诉我。
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user