Accurately Say "CocaCola"!
来源:互联网 发布:tensorflow 遗传算法 编辑:程序博客网 时间:2024/05/17 09:34
点击打开链接
Accurately Say "CocaCola"!
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 25 Accepted Submission(s) : 8
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 integerT (1 <=T <= 100) which is the number of test cases. And it will be followed byT 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 thep "CocaCola"s stands for.
Sample Input
223
Sample Output
2770
#include<stdio.h>
int main()
{
int m;
while(scanf("%d",&m)!=EOF)
{
while(m--)
{
int n;
scanf("%d",&n);
if(n==1)printf("7\n");
else if(n==2)printf("27\n");
else if(n>=3&&n<=10) printf("70\n");
else if(n==11) printf("270\n");
else if(n>11) printf("700\n");
}
}
return 0;
}
- Accurately Say "CocaCola"!
- Accurately Say "CocaCola"!
- BNU16484:Accurately Say "CocaCola"!
- zoj2965 Accurately Say "CocaCola"!
- zoj 2965 Accurately Say "CocaCola"!
- zoj 2965 Accurately Say "CocaCola"!
- ZOJ 2965 Accurately Say "CocaCola"!
- ZOJ 2965 Accurately Say "CocaCola"!
- ZOJ 2965 Accurately Say "CocaCola"!
- ZOJ 2965 Accurately Say "CocaCola"!
- ZOJ 2965 Accurately Say "CocaCola"!
- [找规律]ZOJ 2965 Accurately Say "CocaCola"!
- A - Accurately Say "CocaCola"! --- (first qualifying)
- Accurately Say "CocaCola"!(规律题)
- ZOJ 2965 Accurately Say "CocaCola"!
- ZOJ 2965Accurately Say "CocaCola"!
- ZOJ2965-Accurately Say "CocaCola"!
- ZOJ2965 Accurately Say "CocaCola"! 线性扫描
- android界面View简介及android界面绘制过程
- OANET(五):编译安装Qt-Embedded
- Hdu 1018+1196+2504+2817+1042
- 动态提交表单
- 浅谈数据库及表设计的几个原则
- Accurately Say "CocaCola"!
- 写给4年前开始编程序的自己
- Libpcap使用总结
- ThreadLocal memory leak
- android中dip、dp、px、sp和屏幕密度简介
- 生产者模式实现总结
- Android平台Java命名规范(一)
- YouTube开源项目Vitess:打造高性能MySQL前端
- VMware Workstation(VMware虚拟机)v8.0.3安装图解教程&完美汉化破解版下载