HDU - 1846 巴士博弈

版权声明:博主的博客不值钱随便转载但要注明出处 https://blog.csdn.net/easylovecsdn/article/details/85219197

从某博主的博客里看到的博弈论题目列表,感谢博主:https://blog.csdn.net/qq_33184171/article/details/50790076

博弈问题


巴士博弈
HDU1846<-点击此处进入链接

威尔夫博弈
HDU1527<-点击此处进入链接

斐波那契博弈
HDU2516<-点击此处进入链接

尼姆博弈
HDUXXX<-点击此处进入链接

公平组合博弈
HDUxxxx<-点击此处进入链接

Code(java)

import java.util.*;
public class Main {
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            
            int m, n;
            m = in.nextInt();
            n = in.nextInt();

            if (m % (n + 1) == 0) System.out.println("second");
            else System.out.println("first");

        }
    }
}

猜你喜欢

转载自blog.csdn.net/easylovecsdn/article/details/85219197
今日推荐