zoukankan      html  css  js  c++  java
  • 1114. Boxes

    1114. Boxes

    Time limit: 0.6 second
    Memory limit: 64 MB
    N boxes are lined up in a sequence (1 ≤ N ≤ 20). You have A red balls and B blue balls (0 ≤ A ≤ 15, 0 ≤ B ≤ 15). The red balls (and the blue ones) are exactly the same. You can place the balls in the boxes. It is allowed to put in a box, balls of the two kinds, or only from one kind. You can also leave some of the boxes empty. It's not necessary to place all the balls in the boxes. Write a program, which finds the number of different ways to place the balls in the boxes in the described way.

    Input

    Input contains one line with three integers N, A and B separated by space.

    Output

    The result of your program must be an integer written on the only line of output.

    Sample

    inputoutput
    2 1 1
    9
    Problem Source: First competition for selecting the Bulgarian IOI team.
    油!油!you@
  • 相关阅读:
    电脑常用快捷键
    k8s node 系统参数调整
    docker 制作镜像并上传
    php服务部署安装
    安装 Kuboard v2
    keepalive配置
    elasticsearch的segment详解
    grafana模板
    jenkins启动
    kubernetes 中文文档
  • 原文地址:https://www.cnblogs.com/zzuli2sjy/p/5479332.html
Copyright © 2011-2022 走看看