re [HNCTF 2022 WEEK3]Help_Me! 复现

64位exe，无壳，逻辑倒是很简单

使输入的课对应的序号相加小于等于200，乘积最大，就这么个小东西，我写了好久，最开始想递归爆破吧，应该是编程能力太差了，写了好几次都不行，想到原来稍微学了一点的整数规划，cvxpy救大命了

import numpy as np
import cvxpy as cp
import sys  # 导入sys模块
sys.setrecursionlimit(1000000000)  # 将默认的递归深度修改为3000
enc=[26, 59, 30, 19, 66, 85, 94, 8, 3, 44, 5, 1, 41, 82, 76, 1, 12, 81, 73, 32, 40, 71, 34, 82, 23, 1, 88, 12, 57, 10, 68, 5, 33, 37, 69, 98, 24, 26, 83, 16, 26]
add=[ 71, 34, 82, 23, 1,  88, 12, 57, 10, 68, 5, 33, 37, 69, 98, 24, 26, 83, 16, 26]
add1=[26, 59, 30, 19, 66, 85, 94, 8,   3, 44, 5, 1,  41, 82, 76, 1,  12, 81, 73, 32]
add=np.array(add)
def doo():
    index=np.array(add)
    mul_value=np.array(add1)
    x=cp.Variable(20,integer=True)
    obj=cp.Maximize(x@mul_value)
    cons=[cp.sum(x@index)<=200,x>=0,x<=1]
    prob=cp.Problem(obj,cons)
    prob.solve(solver='GLPK_MI')
    print(prob.solve())
    print(x.value)
doo()

解出的结果是[0. 1. 0. 0. 1. 0. 1. 0. 0. 0. 1. 0. 1. 1. 0. 0. 0. 0. 1. 1.]，也就是1 4 6 10 12 13 18 19 

直接输进去