uva 1394 - And Then There Was One(约瑟夫环)
2014-02-17 17:06
369 查看
题目链接:uva 1394 - And Then There Was One
题目大意:给出n,k和m,表示有n个人围成一个圈,从第m个人开始(m也要去掉),每次走k步删除掉,问最后剩下人的序号。
解题思路:约瑟夫环的小变形,套公式dp[i] = (dp[i-1] + k)%i。
#include <stdio.h>
int main () {
int n, k, m;
while (scanf("%d%d%d", &n, &k, &m) == 3 && n + k + m) {
int ans = 0;
for (int i = 2; i < n; i++)
ans = (ans + k) % i;
printf("%d\n", (ans + m) % n + 1);
}
return 0;
}
题目大意:给出n,k和m,表示有n个人围成一个圈,从第m个人开始(m也要去掉),每次走k步删除掉,问最后剩下人的序号。
解题思路:约瑟夫环的小变形,套公式dp[i] = (dp[i-1] + k)%i。
#include <stdio.h>
int main () {
int n, k, m;
while (scanf("%d%d%d", &n, &k, &m) == 3 && n + k + m) {
int ans = 0;
for (int i = 2; i < n; i++)
ans = (ans + k) % i;
printf("%d\n", (ans + m) % n + 1);
}
return 0;
}
相关文章推荐
- 【约瑟夫环变形】UVa 1394 - And Then There Was One
- UVA 1394 And Then There Was One(约瑟夫环变形)
- UVa:1394 And Then There Was One
- UVa 1394: And Then There Was One
- UVA - 1394 And Then There Was One
- UVA1394 And Then There Was One
- uva live 3882 And Then There Was One 约瑟夫环
- UVALive - 3882 And Then There Was One (约瑟夫环变形)@
- uva 1394 - And Then There Was One
- UVALive 3882 And Then There Was One 约瑟夫环问题
- UVA 1394/POJ 3517 And Then There Was One
- UVa 1394: And Then There Was One
- UVALive 3882 And Then There Was One 约瑟夫环问题
- UVA 1394 POJ 3517 And Then There Was One (双向循环链表和递推)
- UVA 1394 And Then There Was One / Gym 101415A And Then There Was One / UVAlive 3882 And Then There Was One / POJ 3517 And Then There Was One / Aizu 1275 And Then There Was One (动态规划,思维题)
- UVA 1394 And Then There Was One
- UVa1394 - And Then There Was One
- UVa 1394 - And Then There Was One(约瑟夫数论)
- 【LA 3882 - And Then There Was One】 + 约瑟夫环变形
- UVa 3882 And Then There Was One(stl+有技巧的模拟||数学方法+约瑟夫问题)