yuesefu

最新推荐文章于 2021-12-16 21:44:22 发布

原创最新推荐文章于 2021-12-16 21:44:22 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

约瑟夫问题

#include <stdio.h>
#include <stdlib.h>


int main(int argc, char *argv[])
{
int n, m;
int *p = 0;
while(scanf("%d%d", &n, &m) && m && n)
{
int j, k, c;
p = (int *)realloc(p, n * sizeof(int));
for(j = 0; j < n; ++j)
{
p[j] = j + 1;
}
p[n - 1] =0;

c = 0;
for(j = 0; j < n - 1; ++j)
{
for(k = 0; k < m - 1; ++k)
{
c = p[c];
}
p[c] = p[p[c]];
}
printf("%d\n", c);
}
    system("PAUSE");
  return 0;
}