zoukankan      html  css  js  c++  java
  • 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
    想的太多,做的太少。
  • 相关阅读:
    CSS揭秘三(形状)
    CSS揭秘(二背景与边框)
    js数组去重
    Iterator
    ES6数据结构set
    JS浏览器对象(BOM)
    JS 数据类型转换
    js的cookie,localStorage,sessionStorage
    (html+css)云道首页
    蓝桥杯-基础练习 01字串-C语言-5层循环法
  • 原文地址:https://www.cnblogs.com/pealicx/p/6115670.html
Copyright © 2011-2022 走看看