zoukankan      html  css  js  c++  java
  • BNUOJ 13098 约瑟夫环问题

    C. Josephus Problem

    题目链接:http://www.bnuoj.com/v3/contest_show.php?cid=7095#problem/C

    题目描述

     

    The historian Flavius Josephus relates how, in the Romano-Jewish conflict of 67 A.D., the Romans took the town of Jotapata which he was commanding. Escaping, Josephus found himself trapped in a cave with 40 companions. The Romans discovered his whereabouts and invited him to surrender, but his companions refused to allow him to do so. He therefore suggested that they kill each other, one by one, the order to be decided by lot. Tradition has it that the means for affecting the lot was to stand in a circle, and, beginning at some point, count round, every third person being killed in turn. The sole survivor of this process was Josephus, who then surrendered to the Romans. Which begs the question: had Josephus previously practiced quietly with 41 stones in a dark corner, or had he calculated mathematically that he should adopt the 31st position in order to survive?

    Now you are in a similar situation. There are n persons standing in a circle. The persons are numbered from 1 to n circularly. For example, 1 and n are adjacent and 1 and 2 are also. The count starts from the first person. Each time you count up to k and thekth person is killed and removed from the circle. Then the count starts from the next person. Finally one person remains. Given nand k you have to find the position of the last person who remains alive.

     

    Input

    Input starts with an integer T (≤ 200), denoting the number of test cases.

    Each case contains two positive integers n (1 ≤ n ≤ 105) and k (1 ≤ k < 231).

     

    Output

    For each case, print the case number and the position of the last remaining person.

     

    Sample Input

    Sample Input

    Output for Sample Input

    6

    2 1

    2 2

    3 1

    3 2

    3 3

    4 6

    Case 1: 2

    Case 2: 1

    Case 3: 3

    Case 4: 3

    Case 5: 2

    Case 6: 3

    题意:给你一个n个人的环,每次从编号1开始数,数到第k个人就杀死,问你最后一个杀死的人的编号是多少
    题解:约瑟夫环问题,对于任意n,k
          http://www.cnblogs.com/AllenDuane/p/3748203.html
    #include<stdio.h>
    int f(int n, int m)
       {
           int r = 0;//即f(1)=0;
           for(int i = 2; i <= n; i++)
               r = (r + m) % i;//即f(i)=[f(i-1)+m]%n;
           return r + 1; //即f(n)=1;
       }
    int main()
    {
        int t,n,k;
        int oo=1;
        scanf("%d",&t);
        while(t--) scanf("%d%d",&n,&k),printf("Case %d: %d
    ",oo++,f(n,k));
        return 0;
    }
    代码
  • 相关阅读:
    天气预报WebService的使用。
    MS Agent桌面宠物插件浅析
    SECRET文件保险柜 V2.7 统一管理并加密文件
    MSNDuoi聊天机器人 V1.0基于Duoi V2.1的二次开发
    XML操作小结
    Winform鼠标左键点击按钮弹出设置菜单
    截取部分BMP图像
    获取手机的process进程数量和手机的可用内存与总内存大小
    Service一直存在并且能调用服务里面的方法
    判断应用程序是否是用户程序
  • 原文地址:https://www.cnblogs.com/zxhl/p/4906048.html
Copyright © 2011-2022 走看看