ACM/ICPC 2012 天津 - HDU 4438 - 算概率
2012-11-24 22:16
357 查看
题解:简单算下概率即可
#include<cstdio> int main() { int x, y; double p, q; int t; scanf("%d",&t); while(t--) { scanf("%d %d %lf %lf", &x, &y, &p, &q); double tig = (x * p + y * p) * q + x * (1 - q); double wolf = (y * p + x * p) * (1 - q) + y * q; if(tig > wolf) printf("tiger %.4lf\n", tig); else printf("wolf %.4lf\n", wolf); } return 0; }
相关文章推荐
- hdu 4438 第37届ACM/ICPC 天津赛区现场赛H题
- ACM/ICPC 2012 天津 - HDU 4433 - DP(顺推)
- HDU 4405 Aeroplane chess (概率DP)——2012 ACM/ICPC Asia Regional Jinhua Online
- hdu 4276 The Ghost Blows Light(2012 ACM/ICPC Asia Regional Changchun Online )
- 2012 ACM/ICPC Asia Regional Changchun Online(hdu 4267 - 4277)线段树+dp+dfs+树形dp
- hdu 4465 Candy(2012 ACM-ICPC 成都现场赛)
- hdu 4472 Count (2012 ACM-ICPC 成都现场赛)
- HDU 4438 Hunters 概率期望 2012 Asia Tianjin Regional Contest
- 杭电 HDU 4282 A very hard mathematic problem 2012 ACM/ICPC 天津网赛
- hdu 4444 Walk【2012 ACM/ICPC 金华区域赛C题】
- hdu 4435 第37届ACM/ICPC天津现场赛E题
- HDU 5001 Walk 求从任意点出发任意走不经过某个点的概率 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- hdu 4432 第37届ACM/ICPC天津现场赛B题
- ACM/ICPC 2012 天津 A题 (模拟)
- HDU 4283 You Are the One 第37届ACM/ICPC 天津赛区网络赛 1006题 (DP)
- hdu 4288 Coder (2012 ACM/ICPC Asia Regional Chengdu Online)
- hdu 4293 Groups (2012 ACM/ICPC Asia Regional Chengdu Online)
- hdu 4762 Cut the Cake 概率(2013 ACM/ICPC Asia Regional Changchun Online 1004)
- hdu 4443 Lost 【2012 ACM/ICPC 金华区域赛B题】
- Hdu 4089 Activation (概率dp) - 2011 ACM-ICPC Beijing Regional Contest Problem I