zoukankan      html  css  js  c++  java
  • B. Simple Game( Codeforces Round #316 (Div. 2) 简单题)

    B. Simple Game
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    Sample test(s)
    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.




    求选哪个点使得|c-a| < |c-m|的概率最高



    点击打开链接




    #include<iostream>
    #include<algorithm>
    #include<stdio.h>
    #include<string.h>
    #include<stdlib.h>
    #include<math.h>
    #include<queue>
    #include<stack>
    #include<vector>
    #include<map>
    
    using namespace std;
    
    int n,m;
    
    int main()
    {
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            if(n == 1)
            {
                printf("1
    ");
            }
            else if(2*m<=n)
            {
                printf("%d
    ",m+1);
            }
            else
            {
                printf("%d
    ",m-1);
            }
        }
        return 0;
    }


  • 相关阅读:
    第二次Java作业2
    5月29日打卡
    5月24号打卡
    5月22日打卡
    窗口的切换
    第三次作业
    第五次实训作业
    第二次Java作业
    无法解析的外部符号之_cvLoadImage,_cvCreateMat,_cvReleaseImage之类
    无法解析的外部符号"void_cdecl caffe::caffe_gpu_dot<double>(int,double........)"
  • 原文地址:https://www.cnblogs.com/zsychanpin/p/7234159.html
Copyright © 2011-2022 走看看