水題打卡

問題描述

這裡要考慮n==1和k==1的情況,特判一下就能全過了

ac程式碼:

import java.util.Scanner;

public class Main {

    Scanner sc = new Scanner(System.in);

    public void solution() {

        int n = sc.nextInt();
        if (n == 1) {   //n==1只有一個小朋友那贏的就是它
            System.out.println(1);
            return;
        }
        int count = n;
        int k = sc.nextInt();
        if (k == 1) {  //k==1每個小朋友一報數就淘汰,所以最後一個小朋友是最後留下來的小朋友將其編號輸出
            System.out.println(n);
            return;
        }

        int[] vis = new int[n];
        int preNum = 0;
        int thisNum = 0;
        while (count > 1) {
            for (int i = 0; i < n; i++) {
                if (vis[i] == 0) {
                    thisNum = preNum + 1;
                    if (thisNum % k == 0 || thisNum % 10 == k) {
                        vis[i] = 1;
                        count--;
                    }
                    preNum = thisNum;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            if (vis[i] == 0) {
                System.out.println(i + 1);
                break;
            }
        }
    }

    public static void main(String[] args) {
        Main main = new Main();
        main.solution();
    }
}