【模拟】NCPC 2014 D Dice Game
来源:互联网 发布:网络教育和函授毕业证 编辑:程序博客网 时间:2024/05/21 11:30
题目链接:
http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1790
题目大意:
两个人,每个人有两个骰子,每个骰子可以等概率取[a,b],问哪个人两个骰子期望和更大。
题目思路:
【模拟】
签到水题。单个骰子的期望E=0.5*(b+a)。所以只需要求和比大小就行。
////by coolxxx//#include<bits/stdc++.h>#include<iostream>#include<algorithm>#include<string>#include<iomanip>#include<map>#include<stack>#include<queue>#include<set>#include<bitset>#include<memory.h>#include<time.h>#include<stdio.h>#include<stdlib.h>#include<string.h>//#include<stdbool.h>#include<math.h>#define min(a,b) ((a)<(b)?(a):(b))#define max(a,b) ((a)>(b)?(a):(b))#define abs(a) ((a)>0?(a):(-(a)))#define lowbit(a) (a&(-a))#define sqr(a) ((a)*(a))#define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))#define mem(a,b) memset(a,b,sizeof(a))#define eps (1e-8)#define J 10#define mod 1000000007#define MAX 0x7f7f7f7f#define PI 3.14159265358979323#define N 104using namespace std;typedef long long LL;int cas,cass;int n,m,lll,ans;int a,b,c,d;int main(){#ifndef ONLINE_JUDGE//freopen("1.txt","r",stdin);//freopen("2.txt","w",stdout);#endifint i,j,k;//for(scanf("%d",&cass);cass;cass--)//for(scanf("%d",&cas),cass=1;cass<=cas;cass++)//while(~scanf("%s",s+1))while(~scanf("%d",&n)){scanf("%d%d%d",&m,&cas,&cass);scanf("%d%d%d%d",&a,&b,&c,&d);ans=n+m+cas+cass;lll=a+b+c+d;if(ans==lll)puts("Tie");else if(ans<lll)puts("Emma");else puts("Gunnar");}return 0;}/*////*/
0 0
- 【模拟】NCPC 2014 D Dice Game
- 2016 NCPC Game Rank(模拟)
- NCPC 2016 Game Rank(纯模拟)
- Gym-100502D Dice Game
- 【模拟】NCPC 2014 E ceremony
- 【模拟】NCPC 2014 K Train passengers
- 2017 JUST Programming Contest 3.0 D. Dice Game
- SOJ.Dice Game
- Sicily 13907. Dice Game
- CSU1577: Dice Game
- csu 1577: Dice Game
- ACTF Dice Game Writeup
- Game of Dice Gym
- Game of Dice GYM101532E
- D - Throwing Dice
- 【高精度】NCPC 2014 C catalansqure
- NCPC 2014 H clock pictures
- HDU 3959 Board Game Dice
- 【年终总结】——盛开
- git常用功能总结
- 段描述符高速缓冲寄存器
- source命令
- 关于Android的.so文件你所需要知道的
- 【模拟】NCPC 2014 D Dice Game
- Android 中利用WebViewJavascriptBridge 实现js和java的交互
- B树、B-树、B+树、B*树
- Directed Roads (dfs 组合数学 图论)
- 【Android】Android Studio 2上利用NDK进行OpenCV 3.1开发
- iOS常用多媒体播放
- 把GPIO 通过sysfs导出到 用户空间
- SAP 标准教材
- HDU 1561 The more, The Better (树形DP)