zoukankan      html  css  js  c++  java
  • ZOJ 2965 Accurately Say "CocaCola"!(预处理)

    Accurately Say "CocaCola"!

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    In a party held by CocaCola company, several students stand in a circle and play a game.

    One of them is selected as the first, and should say the number 1. Then they continue to count number from 1 one by one (clockwise). The game is interesting in that, once someone counts a number which is a multiple of 7 (e.g. 7, 14, 28, ...) or contains the digit '7' (e.g. 7, 17, 27, ...), he shall say "CocaCola" instead of the number itself.

    For example, 4 students play this game. At some time, the first one says 25, then the second should say 26. The third should say "CocaCola" because 27 contains the digit '7'. The fourth one should say "CocaCola" too, because 28 is a multiple of 7. Then the first one says 29, and the game goes on. When someone makes a mistake, the game ends.

    During a game, you may hear a consecutive of p "CocaCola"s. So what is the minimum number that can make this situation happen?

    For example p = 2, that means there are a consecutive of 2 "CocaCola"s. This situation happens in 27-28 as stated above. 27 is then the minimum number to make this situation happen.

    Input

    Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 100) which is the number of test cases. And it will be followed by Tconsecutive test cases.

    There is only one line for each case. The line contains only one integer p (1 <= p <= 99).

    Output

    Results should be directed to standard output. The output of each test case should be a single integer in one line, which is the minimum possible number for the first of the p"CocaCola"s stands for.

    Sample Input

    2
    2
    3

    Sample Output

    27
    70

    Author: HANG, Hang
    Source: The 5th Zhejiang Provincial Collegiate Programming Contest

    水题:预处理,连续的7的倍数或含数字7

    #include <iostream>
    #include<cstdio>
    using namespace std;
    int t,n;
    int f[105];
    bool ok(int k) //是否符合要求,含有数字7或者是7的倍数
    {
        if (k%7==0) return 1;
        while(k)
        {
            if (k%10==7) return 1;
            k=k/10;
        }
        return 0;
    }
    int main()
    {
        int l=0;
        for(int i=1;i<=1000;i++)
        {
            if (ok(i))
                {l++; if (!f[l]) f[l]=i-l+1;}
            else l=0;
        } //f[i]表示有i个连续的符合要求的最小的是从哪个数开始。
        while(~scanf("%d",&t))
        {
        for(;t>0;t--)
        {
            scanf("%d",&n);
            printf("%d
    ",f[n]);
        }
        }
        return 0;
    }

     

  • 相关阅读:
    Spring Boot Test(转)
    volatile的可见性和有序性是什么(转)
    消息队列漫谈:如何使用消息队列实现分布式事务?(转)
    idea IntelliJ修改代码后自动重启(转)
    Spring Boot自动配置实现原理(转)
    Java注解(Annotation)原理详解(转)
    Spring中@Import注解的作用和使用(转)
    i春秋六周年庆丨欢乐相聚,暖心同行,未来可期!
    王者之战,志在巅峰丨2021互联网安全城市巡回赛•北京站圆满收官!
    2021互联网安全城市巡回赛——风起云涌,再战京城!
  • 原文地址:https://www.cnblogs.com/stepping/p/6406659.html
Copyright © 2011-2022 走看看