codeforces 676B Pyramid of Glasses(模拟题)
来源:互联网 发布:java面试 http 编辑:程序博客网 时间:2024/05/08 18:44
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 isn. The top level consists of only 1 glass, that stands on 2 glasses on the second level (counting from the top), then3 glasses on the third level and so on.The bottom level consists ofn 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.
The only line of the input contains two integers n andt (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.
Print the single integer — the number of completely full glasses after t seconds.
3 5
4
4 8
6
In the first sample, the glasses full after 5 seconds are: the top glass, both glasses on the second level and the middle glass at the bottom level. Left and right glasses of the bottom level will be half-empty.
解题思路:直接模拟,设第一个杯子里面有体积为t的水,然后把多余的部分逐层下放~当时居然没想出来T^T
#include <iostream>using namespace std;double dp[11][11];int main(){ int n,t,ans=0; cin>>n>>t; int i,j; dp[0][0] = t; for(i=0;i<n;i++) { for(j=0;j<=i;j++) { if(dp[i][j]>1.0) { dp[i+1][j] += (dp[i][j]-1.0)/2; dp[i+1][j+1] += (dp[i][j]-1.0)/2; ans++; } } } cout << ans << endl; return 0;}
- codeforces 676B Pyramid of Glasses(模拟题)
- CodeForces 676 B. Pyramid of Glasses(模拟)
- codeforces 676B Pyramid of Glasses 递归
- 【CodeForces 676】B - Pyramid of Glasses
- CodeForces 676B Pyramid of Glasses(举杯斟酒)
- Codeforces Round #354 (Div. 2) B Pyramid of Glasses(模拟)
- Codeforces Round #354 (Div. 2) B. Pyramid of Glasses (模拟)
- Codeforces Round #354 (Div. 2) B. Pyramid of Glasses(模拟)
- Codeforces Round #354 (Div. 2)676B. Pyramid of Glasses
- Codeforces 354 B Pyramid of Glasses (dp)
- B. Pyramid of Glasses
- Codeforces Round #354 (Div. 2)B.Pyramid of Glasses(思维题)
- codeforce 676b Pyramid of Glasses
- 【Codeforces Round 354 (Div 2)B】【简单模拟】Pyramid of Glasses
- CodeForces 676B Pyramid of Glasses【杨辉三角倒鸡尾酒】
- 【Codeforces Round 354 (Div 2)B】【简单模拟】Pyramid of Glasses 漏斗漏水n层t秒灌满多少个
- Pyramid of Glasses 酒杯金字塔 [CF-676B]
- E - Pyramid of Glasses
- VMware ESXi自动化部署实践
- leetcode笔记—关于买股票
- 两款Python工具推荐
- 2015-360web一面js试题自我解答
- NSURLSession
- codeforces 676B Pyramid of Glasses(模拟题)
- CodeForces 587E Duff as a Queen (线段树+线性基)
- RabbitMq、ActiveMq、ZeroMq、kafka之间的比较 资料汇总
- 字符设备编译makefile
- windows编写web程序操作HDFS
- hdu1507(二分匹配)
- Objective-C 神在细节之中
- 网络知识
- HttpClient的Get请求