【51nod1074】约瑟夫环

Description

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1074

---

Solution

约瑟夫问题模板。

我们设$f_i$表示$i$个人、报数报到$m$时的答案，那么有转移：
$f_i=(f_{i-1}+m-1)\mathrm{m}\mathrm{o}\mathrm{d}i+1$
(第一次将第$m$个删掉，视作将编号全部减$m$，变成$i-1$个人的问题)

我们发现很多取模是没有意义的，优化即可，时间复杂度$O(可过)$。

---

Code

/************************************************
 * Au: Hany01
 * Date: Sep 25th, 2018
 * Prob: 51nod1074
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define PB(a) push_back(a)
#define MP(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define ALL(a) a.begin(), a.end()
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline LL read() {
	static LL _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

int main()
{
#ifdef hany01
	freopen("51nod1074.in", "r", stdin);
	freopen("51nod1074.out", "w", stdout);
#endif

	for (LL n = read(), m = read(), cur = 1, ans = 1, xt; cur < n; ) {
		xt = (cur - ans) / m;
		if (cur + xt >= n) {
			printf("%lld\n", ans + m * (n - cur));
			return 0;
		}
		cur += xt, ans += m * xt;
		++ cur, ((ans += m - 1) %= cur) += 1;
		if (cur == n) { printf("%lld\n", ans); return 0; }
	}

	return 0;
}