pku2156.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <memory.h>
#define SIZE 20010
int N, M, K, J;
int v[SIZE];

void Solve()
{
	int i, pos, NN;
	pos = 1;
	N++;
	NN = N;
	for (i = 0; i < K; i++)
	{
		pos = (pos + M - 2) % N + 1;
		v[i] = pos;
		N--;
	}
	for (i = K - 2; i >= 0; i--)
		if (v[i] <= pos)
			pos++;
	printf("%d ", pos);
	pos = 1;
	for (i = 1, N = NN; ; i++)
	{
		pos = (pos + M - 2) % N + 1;
		if (pos == J)
			break;
		if (pos < J)
			J--;
		N--;
	}
	printf("%d\n", i);
}

int main()
{
	while (EOF != scanf("%d %d %d %d", &N, &M, &K, &J))
		Solve();
}