ZOJ2965 Accurately Say "CocaCola"! java

原创于 2018-07-18 12:17:12 发布 · 474 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#zoj2965

ZOJ 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个基于数字的游戏——CocaCola游戏的算法实现。玩家按顺时针方向从1开始计数，遇到与7相关的数字时需说出CocaCola代替数字。文章提供了寻找连续n个与7相关数字的最小起始数字的Java实现。

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2965

Accurately Say "CocaCola"!

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 T consecutive 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

Sample Output

题意：

求连续n个与7有关的数字，（整除7或者数字里含有7（例如17））。

思路：

暴力解。

代码：

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			int t=sc.nextInt();
			for(int i=0;i<t;i++){
				int p=sc.nextInt();
				int index=0;
				int count=0;
				for(int j=7;;j++){
					if(p==index){
						count=j-p;
						break;
					}
					if(isCondition(j)){
						index++;
						continue;
					}
					index=0;
				}
				System.out.println(count);
			}
		}

	}
	static boolean isCondition(int i){
		if(i%7==0){
			return true;
		}
		while(i!=0){
			if(i%10==7){
				return true;
			}
			i/=10;
		}
		return false;
	}
}