第 41 名解决方案

感谢主办者和参与者举办这次竞赛。我很高兴获得银牌并成为大师。

我的解决方案如下。

・提示词 (Prompt)

我强调了自我怀疑。这可能会让 AI 反复思考并得出正确答案。在排行榜 (LB) 上，输入三次 "Be skeptical of your answers." 是最有效的。

code = """Below is a math problem you are to solve (Non-negative integer answer):
\"{}\"
To accomplish this, first determine a sympy-based approach for solving the problem by listing each step to take and what functions need to be called in each step. Be clear so even an idiot can follow your instructions, and remember, your final answer should be Non-negative integer, not an algebraic expression!
Be skeptical of your answers.
Be skeptical of your answers.
Be skeptical of your answers.
Write the entire script covering all the steps (use comments and document it well) and print the result. After solving the problem, output the final Non-negative integer answer within \\boxed{}.

Approach:"""

cot = """Below is a math problem you are to solve (Non-negative integer answer!):
\"{}\"
Be skeptical of your answers.
Be skeptical of your answers.
Be skeptical of your answers.
Analyze this problem and think step by step to come to a solution with programs. After solving the problem, output the final Non-negative integer answer within \\boxed{}.\n\n"""

promplt_options = [code,cot]

・温度 (Temperature)

温度设置为 0.7 以提高稳定性。

・时间管理 (Time management)

一些公开的方案可能会超过时间限制。所以确保它们可以在时间限制内解决。还添加了一个名为 "time_for_difficult" 的变量，为困难问题分配更多时间。

time_for_difficult = 9000

solve_time_standard = max(300,int((32200 - consumed_time)/(51 - problem_count)))
solve_time = solve_time_standard
if problem_count <= 45 and time_for_difficult >= 1 and consumed_time < 29200:
    solve_time += min(600,time_for_difficult)    
time_for_difficult -= 200

for jj in tqdm(range(n_repetitions)):
    best, best_count = best_stats.get(i,(-1,-1))
    problem_time = time.time()-PROBLEM_START_TIME

    if problem_time >= 720 and best_count >= 4:
        time_for_difficult -= problem_time - solve_time_standard
        return best_stats[0][0]
    if problem_time >= 900 and best_count >= 2:
        time_for_difficult -= problem_time - solve_time_standard
        return best_stats[0][0]