1 solutions
-
0
C :
#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<string.h> #include<stdlib.h> struct QueueNode { int arr[15]; int front; int rear; int size; }; void initQueue(struct QueueNode* queue) { queue->front = queue->rear = 0; queue->size = 0; } int nextIndex(int index, int maxSize) { if (++index == maxSize) return 0; return index; } void push(struct QueueNode* q, int e) { if (q->size > 15) return; q->arr[q->rear] = e; q->rear = nextIndex(q->rear, 15); q->size++; } int pop(struct QueueNode* q) { if (q->size == 0) return -1; int tmp = q->arr[q->front]; q->front = nextIndex(q->front, 15); q->size--; return tmp; } int main() { int m; int n; scanf("%d %d", &n, &m); struct QueueNode q1; struct QueueNode q2; initQueue(&q1); initQueue(&q2); int tmp = m; for (int i = 0; i < n; i++) push(&q1, i + 1); while (q1.size > 1) { int move = m % n; if (move == 0) { for (int i = 0; i < n - 1; i++) { push(&q2, pop(&q1)); } pop(&q1); } else { for (int i = 0; i < move - 1; i++) { push(&q2, pop(&q1)); } pop(&q1); } while (q2.size != 0) { push(&q1, pop(&q2)); } n--; m *= tmp; } printf("%d", q1.arr[q1.front]); }C++ :
#include <iostream> #include <vector> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> people(n); // 存储同学的编号 for (int i = 0; i < n; ++i) { people[i] = i + 1; // 初始化同学编号 } int index = 0; // 当前报数的索引 for (int round = 0; round < n - 1; ++round) { int count = 1; // 计数器,初始值为 1 int step = 1; // 当前步数(m 的指数) // 计算当前出局的同学的步数 for (int j = 0; j < round + 1; ++j) { step *= m; // m^(round+1) } // 找到出局的同学索引 index = (index + step - 1) % people.size(); people.erase(people.begin() + index); // 出局 } // 输出最后剩下的同学的编号 cout << people[0] << endl; return 0; }Java :
import java.util.LinkedList; import java.util.Scanner; class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int m = scanner.nextInt(); LinkedList<Integer> queue = new LinkedList<>(); for (int i = 1; i <= n; i++) { queue.add(i); } int currentM = m; int index = 0; while (queue.size() > 1) { int step = (int) Math.pow(m, currentM - 1); index = (index + step - 1) % queue.size(); queue.remove(index); currentM++; } System.out.println(queue.get(0)); } }Python :
# coding=utf-8 n, m = map(int, input().strip().split()) students = list(range(1, n + 1)) index = 0 a=m while len(students) > 1: index = (index + a - 1) % len(students) students.pop(index) a = a*m print(students[0])
- 1
Information
- ID
- 345
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- (None)
- # Submissions
- 0
- Accepted
- 0
- Uploaded By