【LA 3882 - And Then There Was One】 + 约瑟夫环变形
2017-04-29 18:27
459 查看
题意:n个人围成一圈,编号从1-n,规定第一个被杀掉的人编号为m,然后开始每数k个数,杀掉一个人,问最后剩余的人编号
思路 : a
= ( a[n - 1] + k ) % n,只不过第一个出去的人变成了m而已,last = (((last + m - k + 1) % n) + n) % n;
AC代码:
思路 : a
= ( a[n - 1] + k ) % n,只不过第一个出去的人变成了m而已,last = (((last + m - k + 1) % n) + n) % n;
AC代码:
#include<cstdio> int main() { int n,m,k; while(scanf("%d %d %d",&n,&k,&m) != EOF){ int last = 0; for(int i = 2; i <= n; i++) last = (last + k) % i; last = (((last + m - k + 1) % n) + n) % n; printf("%d\n",last); } return 0; }
相关文章推荐
- LA 3882 - And Then There Was One 【约瑟夫环变形】
- LA 3882 And Then There Was One——约瑟夫环
- UVALive - 3882 And Then There Was One (约瑟夫环变形)@
- 约瑟夫问题变形 And Then There was One, LA 3882 递推 动态规划
- 约瑟夫问题变形 And Then There was One, LA 3882 递推 动态规划
- LA 3882 And Then There Was One 约瑟夫变形 *
- LA 3882 And Then There Was One[约瑟夫问题的变形]
- uva live 3882 And Then There Was One 约瑟夫环
- UVA 1394 And Then There Was One(约瑟夫环变形)
- Poj 3517 And Then There Was One(约瑟夫环变形)
- LA 3882 - And Then There Was One(约瑟夫 递归)
- LA - 3882 - And Then There Was One(dp)
- LA 3882 - And Then There Was One(约瑟夫 递归)
- LA3882 And Then There Was One
- UVALive - 3882 And Then There Was One 约瑟夫的变形问题
- UVALive 3882 And Then There Was One 约瑟夫环问题
- UVALive 3882 And Then There Was One 约瑟夫环问题
- 【约瑟夫环变形】UVa 1394 - And Then There Was One
- POJ 3517 And Then There Was One (递推,约瑟夫问题变形)
- UVALive 3882 - And Then There Was One【约瑟夫问题】