uva 440 Eeny Meeny Moo(约瑟夫环)
来源:互联网 发布:json post get 编辑:程序博客网 时间:2024/05/16 17:31
Eeny Meeny Moo
Surely you have made the experience that when too many people use the Internet simultaneously, the net becomes very, very slow.
To put an end to this problem, the University of Ulm has developed a contingency scheme for times of peak load to cut off net access for some cities of the country in a systematic, totally fair manner. Germany's cities were enumerated randomly from 1 to n. Freiburg was number 1, Ulm was number 2, Karlsruhe was number 3, and so on in a purely random order.
Then a number m would be picked at random, and Internet access would first be cut off in city 1 (clearly the fairest starting point) and then in every mth city after that, wrapping around to 1 after n, and ignoring cities already cut off. For example, if n=17 and m=5, net access would be cut off to the cities in the order [1,6,11,16,5,12,2,9,17,10,4,15,14,3,8,13,7]. The problem is that it is clearly fairest to cut off Ulm last (after all, this is where the best programmers come from), so for a given n, the random number m needs to be carefully chosen so that city 2 is the last city selected.
Your job is to write a program that will read in a number of cities n and then determine the smallest integer m that will ensure that Ulm can surf the net while the rest of the country is cut off.
Input Specification
The input file will contain one or more lines, each line containing one integer n with , representing the number of cities in the country.
Input is terminated by a value of zero (0) for n.
Output Specification
For each line of the input, print one line containing the integer m fulfilling the requirement specified above.
Sample Input
34567891011120
Sample Output
252431123816题目大意:约瑟夫环问题,不懂可以查一下,输出剩下的最后一个人的序号。
解题思路:通过模拟去计算。
#include<iostream>using namespace std;int end(int i,int n){int sum,j,k;int num[150]={0};num[0]=1;for(j=1,sum=0,k=0;sum<n-2;j++){if(j>=n)j%=n;if(num[j]==0)k++;if(k==i&&num[j]==0){num[j]=1;sum++;k=0;}if(num[1])return 1;}return 0;}int main(){int n;while(cin>>n,n){if(n<3) continue;for(int i=2;;i++){if(end(i,n))continue;cout<<i<<endl;break;}}return 0;}
- uva 440 Eeny Meeny Moo(约瑟夫环)
- Eeny Meeny Moo(约瑟夫环)
- Uva 440 - Eeny Meeny Moo
- UVa 440 - Eeny Meeny Moo
- UVA, 440 Eeny Meeny Moo
- poj 2244 Eeny Meeny Moo 约瑟夫环
- Poj 2244 Eeny Meeny Moo (约瑟夫环)
- uva440 - Eeny Meeny Moo约瑟夫环
- poj 2244 Eeny Meeny Moo 约瑟夫环
- poj 2244 Eeny Meeny Moo【约瑟夫环】
- bnuoj 1007Eeny Meeny Moo (约瑟夫环)
- 约瑟夫环-poj2244 - Eeny Meeny Moo
- Eeny Meeny Moo(变相约瑟夫)
- Eeny Meeny Moo 【 约瑟夫问题】
- Eeny Meeny Moo(约瑟夫环(暴力模拟(打表)))
- POJ 2244 Eeny Meeny Moo 约瑟夫
- [TOJ1133]Eeny Meeny Moo 约瑟夫问题
- pku2244 Eeny Meeny Moo
- 可导出图片的图表插件flash_amcharts破解版
- 计算中的赋值和优先级问题
- cocos2d-x 自定义控件中的回调函数使用
- 如何推广网站 网站推广增加访问量的29种方法
- 在C#中利用Nuget包使用SQLite数据库和Linq to SQLite
- uva 440 Eeny Meeny Moo(约瑟夫环)
- [leetcode刷题系列]Two Sum
- log4j使用心得之三 -- log4j配置文件空格导致无法访问log文件
- Android访问php取回json数据
- POJ-3662-Telephone Lines
- iOS三种多线程编程的技术
- iOS应用崩溃日志分析
- 3.4 IRP处理
- CMurphi入门笔记(五)——语句