zoukankan      html  css  js  c++  java
  • UVa 3882 And Then There Was One 递推无力orz

    Let's play a stone removing game.

    Initially, n stones are arranged on a circle and numbered 1,..., n clockwise (Figure 1). You are also given two numbers k and m . From this state, remove stones one by one following the rules explained below, until only one remains. In step 1, remove stone m . In step 2, locate the k -th next stone clockwise from m and remove it. In subsequent steps, start from the slot of the stone removed in the last step, make k hops clockwise on the remaining stones and remove the one you reach. In other words, skip (k - 1) remaining stones clockwise and remove the next one. Repeat this until only one stone is left and answer its number.

    For example, the answer for the case n = 8 , k = 5 , m = 3 is 1, as shown in Figure 1.

    \epsfbox{p3882.eps}

    Figure 1: An example game


    Initial state: Eight stones are arranged on a circle.

    Step 1: Stone 3 is removed since m = 3 .

    Step 2: You start from the slot that was occupied by stone 3. You skip four stones 4, 5, 6 and 7 (since k = 5), and remove the next one, which is 8.

    Step 3: You skip stones 1, 2, 4 and 5, and thus remove 6. Note that you only count stones that are still on the circle and ignore those already removed. Stone 3 is ignored in this case.

    Steps 4-7: You continue until only one stone is left. Notice that in later steps when only a few stones remain, the same stone may be skipped multiple times. For example, stones 1 and 4 are skipped twice in step 7.

    Final State: Finally, only one stone, 1, is on the circle. This is the final state, so the answer is 1.

    Input 

    The input consists of multiple datasets each of which is formatted as follows.


    n k m


    The last dataset is followed by a line containing three zeros. Numbers in a line are separated by a single space. A dataset satisfies the following conditions.

    2$\displaystyle \le$n$\displaystyle \le$10000, 1$\displaystyle \le$k$\displaystyle \le$10000, 1$\displaystyle \le$m$\displaystyle \le$n

    The number of datasets is less than 100.

    Output 

    For each dataset, output a line containing the stone number left in the final state. No extra characters such as spaces should appear in the output.

    Sample Input 

    8 5 3 
    100 9999 98 
    10000 10000 10000 
    0 0 0
    

    Sample Output 

    1 
    93 
    2019
    --------------------------------------

    疑问这到底是怎么推出来的啊。

    ---------------------------------

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    using namespace std;
    
    int f[11111];
    
    int main()
    {
        int n,k,m;
        while (~scanf("%d%d%d",&n,&k,&m))
        {
            if (n==0) break;
            f[1]=0;
            for (int i=2;i<=n;i++) f[i]=(f[i-1]+k)%i;
            int ans=(f[n]+m-k+1)%n;
            if (ans<=0) ans+=n;
            printf("%d\n",ans);
        }
        return 0;
    }
    







  • 相关阅读:
    书决战.NET——ASP.NET AJAX与Silverlight实战手册(含光的评论
    C#和.NET 3.0第一步——适用Visual Studio 2005与Visual Studio 这本书怎么样
    Visual Basic.NET 2008控件使用范例详解这本书怎么样
    书C#2005 &.NET 3.0高级编程(第5版)(上、下卷)的评论
    关于Visual J#.NET应用程序设计(高等学校计算机科学与技术教材)的读后感
    Dos命令
    调整markdown 图片大小和对齐方式
    Intellij IDEA设置自定义类描述信息
    Markdown基本语法
    计算机的发展史(待补充)
  • 原文地址:https://www.cnblogs.com/cyendra/p/3226345.html
Copyright © 2011-2022 走看看