• 1317: Square(DFS+剪枝)


    Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?
    The first line of input contains N, the number of test cases. Each test case begins with an integer 4 ≤ M ≤ 20, the number of sticks. M integers follow; each gives the length of a stick - an integer between 1 and 10,000.
    For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no".
    3
    4 1 1 1 1
    5 10 20 30 40 50
    8 1 7 2 6 4 4 3 5
    yes
    no
    yes
    想的太多,做的太少。
  • 相关阅读:
    HTTP以及TCP协议
    分布式理论
    JAVA基础面试题
    JAVA基础面试题
    vue 中百度富文本初始化内容加载失败(编辑操作某列数据时,富文本中内容偶尔会为空)
    CodeMirror的使用方法
    JSON格式化,JSON.stringify()的用法
    promise与await的用法
    服务器端node.js
    数组扁平化
  • 原文地址:https://www.cnblogs.com/pealicx/p/6115670.html
Copyright © 2020-2023  润新知