zoukankan      html  css  js  c++  java
  • LightOj 1179 Josephus Problem

    1179 - Josephus Problem
    PDF (English) Statistics Forum
    Time Limit: 2 second(s) Memory Limit: 32 MB
    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 the kth person is killed and removed from the circle. Then the count starts from the next person. Finally one person remains. Given n and 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
    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


    PROBLEM SETTER: JANE ALAM JAN

    /*************************************
        author   : Grant Yuan
        time     : 2014/8/21 13:35
        algorithm: Josephus Problem
        source   : LightOj 1179
    *************************************/
    #include<bits/stdc++.h>
    
    using namespace std;
    int n,k,t,ans;
    int s;
    int main()
    {
        scanf("%d",&t);
        for(int i=1;i<=t;i++)
        {
             scanf("%d%d",&n,&k);
             s=0;
             for(int j=2;j<=n;j++)
             {
                 s=(s+k)%j;
             }
           printf("Case %d: %d
    ",i,s+1);
        }
        return 0;
    }
    


     

  • 相关阅读:
    OpenStack(queens)最小化搭建记录——控制与计算共两个节点
    CentOS7 minimal(最小化安装)后增加的软件安装
    redis
    layui 单击事件,选中 checkbox f
    DLL 引用查询工具
    自定义JS Map 函数
    修改MSSQL字段类型
    苹果ATS特性服务器配置指南 HTTPS 安卓可以用 IOS 报错。
    基础连接已经关闭: 未能为 SSL/TLS 安全通道建立信任关系。
    不能将多个项传入“Microsoft.Build.Framework.ITaskItem”类型的参数
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4254447.html
Copyright © 2011-2022 走看看