• [E] Many Candies

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • There are N candies,but Picky tt Only like to eat M,help tt find out whether the N candies
    With M。(0 < n,m <=5000)
  • 输入
  • The input contains several test cases. Each test case starts with a line contains two numbers N and M,The second line contains N integers.
  • 输出
  • For each case,if you find M Output "yes", otherwise output "no";
  • 样例输入
  • 2 1
    1 1
    2 2
    1 1
  • 样例输出
  • yes
    no
  • 提示
  • 来源
  • 大胖
  • 操作

显示春菜