Joseph - POJ 1012 打表
来源:互联网 发布:安全联盟软件 编辑:程序博客网 时间:2024/05/22 00:12
Joseph
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47228 Accepted: 17791
Description
The Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the last remaining person, thus saving his life to give us the message about the incident. For example when n = 6 and m = 5 then the people will be executed in the order 5, 4, 6, 2, 3 and 1 will be saved.
Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.
Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.
Input
The input file consists of separate lines containing k. The last line in the input file contains 0. You can suppose that 0 < k < 14.
Output
The output file will consist of separate lines containing m corresponding to k in the input file.
Sample Input
340
Sample Output
530
题意:顺时针数,让第几个人出去,最后要留下前k个。
思路:打表。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;int main(){ int num[]={0,2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881}; int i,j,k; while(~scanf("%d",&k) && k>0) printf("%d\n",num[k]);}
打表代码如下:
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int r[14];bool solve(int k,int i){ int n=k*2,x=0; while(n>k) { x=(x+i-1)%n;if(x<k) return false; n--; } return true;}int main(){int i,j,k;for(k=1;k<14;k++) for(i=k+1;;i+=k+1) { if(solve(k,i)) { r[k]=i; break; } else if(solve(k,i+1)) { r[k]=i+1; break; } }for(i=1;i<=13;i++) printf("%d %d\n",i,r[i]);}
0 0
- Joseph - POJ 1012 打表
- poj 1012 小白算法练习 Joseph 约瑟夫环 打表
- UVA305 - Joseph(数论 + 打表)
- POJ 1012 Joseph
- POJ 1012 Joseph
- POJ 1012 Joseph
- POJ 1012 Joseph
- poj 1012 Joseph
- POJ 1012 Joseph
- poj 1012 Joseph
- 【POJ】1012 Joseph
- poj 1012 Joseph
- poj-1012 Joseph
- POJ 1012 Joseph
- poj 1012 Joseph
- Poj 1012 Joseph
- POJ - 1012 Joseph
- [POJ][1012]Joseph
- 苹果编程新纪元 之 Swift
- string public int LastIndexOf(string value, int startIndex, int count);
- ASM命令
- centos apache 基于域名的虚拟主机
- Struts2 登陆验证、国际化显示Demo
- Joseph - POJ 1012 打表
- 黑马程序员 Java基础_4 面向对象-抽象与封装
- 如何判断链表中是否有环
- Android命令行/c语言/java设置获取系统属性的方法
- error:MultiByteToWideChar cannot convert parameter 2 from 'char [10]' to 'unsigned short *'
- PL/SQL控制循环结构
- PLSQL程序控制结构
- 【Mac OS X开发】在NSAlert中添加NSTableView,双击NSTableView单元格用于确定选择的效果
- Maya Calendar - POJ 1008 时间转换