Simple game 【概率期望】
来源:互联网 发布:java nio网络编程 编辑:程序博客网 时间:2024/04/30 20:05
Simple game
One day Misha and Andrew were playing a very simple game. First, each player chooses an integer in the range from 1 to n. Let’s assume that Misha chose number m, and Andrew chose number a.
Then, by using a random generator they choose a random integer c in the range between 1 and n (any integer from 1 to n is chosen with the same probability), after which the winner is the player, whose number was closer to c. The boys agreed that if m and a are located on the same distance from c, Misha wins.
Andrew wants to win very much, so he asks you to help him. You know the number selected by Misha, and number n. You need to determine which value of a Andrew must choose, so that the probability of his victory is the highest possible.
More formally, you need to find such integer a (1 ≤ a ≤ n), that the probability that is maximal, where c is the equiprobably chosen integer from 1 to n (inclusive).
Input
The first line contains two integers n and m (1 ≤ m ≤ n ≤ 109) — the range of numbers in the game, and the number selected by Misha respectively.
Output
Print a single number — such value a, that probability that Andrew wins is the highest. If there are multiple such values, print the minimum of them.
Example
Input
3 1
Output
2
Input
4 3
Output
2
Note
In the first sample test: Andrew wins if c is equal to 2 or 3. The probability that Andrew wins is 2 / 3. If Andrew chooses a = 3, the probability of winning will be 1 / 3. If a = 1, the probability of winning is 0.
In the second sample test: Andrew wins if c is equal to 1 and 2. The probability that Andrew wins is 1 / 2. For other choices of a the probability of winning is less.
思路; 感觉。。
代码
#include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>#include<math.h>#include<queue>#include<stack>#include<map>#include<vector>#define LL long long#define M#define inf 0x3f3f3f3f#define mod 100009using namespace std;int main(){ LL n,m,i,j; scanf("%lld%lld",&n,&m); LL anwser; if(n==1) printf("1"); // 刚开始忘了这,WA了次。特殊情况,以后要 关注 边界值。。 else { if(n&1) //分奇偶 { LL k=(n+1)/2; if(m>=k) anwser=m-1; else if(m<k) anwser=m+1; } else { LL l,r; l=n/2;r=l+1; if(m<=l) anwser=m+1; else if(m>=r) anwser=m-1; } printf("%lld",anwser); } return 0;}
- Simple game 【概率期望】
- CodeForces 570B Simple Game 概率
- Codeforces 570 B. Simple Game ( 概率 )
- ZOJ 3329 One Person Game(概率DP,求期望)
- ZOJ3329-One Person Game(概率DP求数学期望)
- zoj3329 One Person Game 概率dp求期望
- zoj 3329 One Person Game(概率dp,期望)
- ZOJ 3329 One Person Game 概率dp、求期望
- ZOJ 3329 One Person Game(概率dp求期望)
- 2318: Spoj4060 game with probability Problem|概率与期望
- ZOJ 3329 One Person Game(概率DP、求期望)
- zoj 3329 One Person Game (概率与期望DP)
- HDU 4254 A Famous Game(概率与期望)
- Codeforces 280 C. Game on Tree (概率与期望)
- ZOJ 3329 One Person Game(概率DP,求期望)
- 概率 期望
- 期望概率
- Codeforces 570B Simple Game 概率求解,简单数学思维
- python把函数作为参数
- 网络编程基础
- 414. Third Maximum Number (java)
- Floyd—Warshall算法
- 问题:Hibernate ,测试类中并没有在控制台打印出sql语句?
- Simple game 【概率期望】
- 菜鸟程序员的超神之路
- WebView:后退按钮的作用,替换成WebView里的查看历史页面
- 命令行编译源文件
- win7部分便笺的元数据已被损坏
- qt5.7.0creator打不开解决办法
- hiho 1496 : 寻找最大值 高维前缀最大&次大
- RBF神经网络
- HTTP请求