zoukankan      html  css  js  c++  java
  • Codeforces Round #354 (Div. 2) B. Pyramid of Glasses

    Pyramid of Glasses

    time limit:1 second
    memory limit :256 megabytes

    题目连接:

    http://www.codeforces.com/contest/676/problem/B

    Description

    Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is n. The top level consists of only 1 glass, that stands on 2 glasses on the second level (counting from the top), then 3 glasses on the third level and so on.The bottom level consists of n glasses.

    Vlad has seen in the movies many times how the champagne beautifully flows from top levels to bottom ones, filling all the glasses simultaneously. So he took a bottle and started to pour it in the glass located at the top of the pyramid.

    Each second, Vlad pours to the top glass the amount of champagne equal to the size of exactly one glass. If the glass is already full, but there is some champagne flowing in it, then it pours over the edge of the glass and is equally distributed over two glasses standing under. If the overflowed glass is at the bottom level, then the champagne pours on the table. For the purpose of this problem we consider that champagne is distributed among pyramid glasses immediately. Vlad is interested in the number of completely full glasses if he stops pouring champagne in t seconds.

    Pictures below illustrate the pyramid consisting of three levels.

    Input

    The only line of the input contains two integers n and t (1 ≤ n ≤ 10, 0 ≤ t ≤ 10 000) — the height of the pyramid and the number of seconds Vlad will be pouring champagne from the bottle.

    Output

    Print the single integer — the number of completely full glasses after t seconds.

    Sample Input

    3 5

    Sample Output

    4

    Hint

    题意

    有n层的杯子,然后每秒钟都会倒一杯水

    问你倒了t秒后,有几个杯子是满的

    题解

    模拟模拟,为了避免精度差,可以乘上1024。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    int a[15][15];
    int main()
    {
        int n,t,ans=0;
        scanf("%d %d",&n,&t);
        a[1][1]=t*(1<<10);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j]>=1024){
                    ans++;
                    a[i+1][j]+=(a[i][j]-1024)/2;
                    a[i+1][j+1]+=(a[i][j]-1024)/2;
                }
            }
        }
        printf("%d",ans);
        return 0;
    }
  • 相关阅读:
    Computer Networking: Computer networks and the Internet
    编译pqxx源码configure时遇到codecs.py LookupError的解决方法
    DBMS-存储和文件结构
    DBMS-关系数据库的设计:范式、函数依赖、分解算法、多值依赖
    WebPack填坑笔记
    VsCode常用快捷键
    用户 在地址栏输入网址 经历了那些
    正向代理和反向代理
    检测浏览器(BOM)以及地址栏网址的API
    js变量按照存储方式区分,有哪些类型,并表述其特点
  • 原文地址:https://www.cnblogs.com/wangdongkai/p/5531821.html
Copyright © 2011-2022 走看看