F: Lucky Numbers

最新推荐文章于 2020-07-06 21:45:19 发布

清风--旋叶

最新推荐文章于 2020-07-06 21:45:19 发布

阅读量930

点赞数

分类专栏： 2014辽宁省赛

本文链接：https://blog.csdn.net/lyf2934463735/article/details/27679253

版权

2014辽宁省赛专栏收录该内容

3 篇文章 0 订阅

订阅专栏

题目描述

A lucky number is made by the following rules:

Given a positive integer sequence {x | 1 <= x <= n}. From the first number, delete the last one in every 2 numbers. Select the minimum that has not been unused from the rest numbers. This number is xi. Then delete the last number in every xi numbers.

输入

There are several test cases, ended by the end of file.

Each test case has a positive integer n.(3<=n<=10000)

输出

Output the number of lucky numbers in one line.

样例输入

样例输出

提示

eg.1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

For the first time, delete the last number in every two numbers. The sequence become 1 3 5 7 9 11 13 15 17 19

For the second time, the minimum number that has never been used is 3. Delete the last number in every 3 numbers. The sequence become 1 3 7 9 13 15 19

For the third time, the minimum number that has never been used is 7. Delete the last number in every 7 numbers. The sequence becomes 1 3 7 9 13 15.

Then you cannot delete any numbers. There are 6 numbers left over. So the answer is 6.

这个一开始不知道怎么做，后来觉得很简单的。按着要求删除，每次删后找到剩余元素的个数，然后找到那个没有用到的最小的，继续删除，打了个表。

#include<stdio.h>
#include<string.h>
#define maxn 10010
int vis[maxn];
int num[maxn/2];
int main()
{
   // freopen("in.txt","r",stdin);
    num[0]=2;
    int ct=1;
    int cnt=maxn;
    int m=0,t=2;
    memset(vis,0,sizeof(vis));
    while(cnt>=t)
    {
        //printf("cnt=%d t=%d ",cnt,t);
        for(int i=1;i<=maxn;i++)
        {
            if(!vis[i])
            {
                m++;
                if(m==t)
                {
                    vis[i]=1;
                    m=0;
                }
            }
        }
        cnt=0;
        m=0;
        for(int i=1;i<=maxn;i++)
            if(!vis[i])
               cnt++;
        //printf("cnt=%d ",cnt);
        for(int i=t+1;i<=maxn;i++)
            if(!vis[i])
        {
            t=i;
            num[ct++]=t;
            break;
        }
    }
//    for(int i=0;i<ct;i++)
//        printf("%d ",num[i]);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int i=0;
        while(n>=num[i])
        {
            n=n-n/num[i];
            i++;
        }
        printf("%d\n",n);
    }
    return 0;
}