Codeforces Round #354 (Div. 2) B. Pyramid of Glasses
2016-05-26 17:00
316 查看
Pyramid of Glasses
time limit:1 secondmemory limit :256 megabytes
题目连接:
http://www.codeforces.com/contest/676/problem/BDescription
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 5Sample Output
4Hint
题意
有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; }
相关文章推荐
- 简单的方法 实现下拉框多选
- 30、Arrays工具类
- 著名的开源监控“五大郎”
- Android 6.0权限模型
- 指向常量的指针和常量指针
- 星号版的平行四边形
- 计算机网络笔记
- Android 通知栏Notification的整合 全面学习 (一个DEMO让你完全了解它)
- java追加写入Excel之新建工作薄
- Java网络编程精解之ServerSocket用法详解一
- iOS textfield实现一行的数字限制,超出进行弹框
- iOS9适配 之 关于info.plist 第三方登录 添加URL Schemes白名单
- 入门必看----------------------正则表达式
- 相机跟随和鼠标滚轮控制缩放
- PCI9054的DMA传输过程
- 打开快速开机时,动画播放不完整
- 在处理大文件时使用yield
- JS实现table表格数据排序功能(可支持动态数据+分页效果)
- 持续更新前端兼容坑
- poj 2828 Buy Tickets 线段树