Codeforces 570B Simple Game

Simple Game

题目链接：

http://codeforces.com/problemset/problem/570/B

解题思路：

Lets find which variant is interesting. For Andrew is no need a variant wherein |a-m|>1 because we can increase probability of victory if we will be closer to m. Then we consider two variants,a=c-1 and a=c+1. Probability of victory will be (c-1)/n for first variant and (n-c+1)/n for second.

We need to choose better variant, also we must keep in mind case of n=1.

O(1)

比赛的时候忘了考虑n=1的情况，幸好被别人hack了，及时发现了这个问题。。。不然这题的分就全没了。。。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main(){
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        if(n == 1){
            printf("1\n");
            continue;
        }
        if(n-m > m-1)
            printf("%d\n",m+1);
        else
            printf("%d\n",m-1);
    }
    return 0;
}