ZOJ 2965 模拟 (A)
来源:互联网 发布:百度云盘我的应用数据 编辑:程序博客网 时间:2024/04/29 19:42
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
223
Sample Output
2770
Author: HANG, Hang
Source: The 5th Zhejiang Provincial Collegiate Programming Contest
题意:求连续n个与7有关的数字,(整除7或者数字里含有7(例如17))
题解:直接模拟
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;#define LL long long #define N 100000int a[N];inline bool judge(int n){if(n%7==0)return true;;while(n>0){if(n%10==7){return true;}n/=10;}return false;}int main(){#ifdef CDZSCfreopen("i.txt","r",stdin);#endifint n,t;scanf("%d",&t);while(t--){int sum=0;int temp=7;scanf("%d",&n);for(int i=7;;i++){if(judge(i)){sum++;temp=i;}else{sum=0;}if(sum==n)break;}printf("%d\n",temp-n+1);}return 0; }
- ZOJ 2965 模拟 (A)
- ZOJ 3210 A Stack or A Queue?【模拟】
- ZOJ-3581 A Simple Test 模拟连连看
- ZOJ 3705 10th 省赛 A Applications【模拟】
- zoj 1720 模拟
- zoj 1009 Enigma (模拟)
- ZOJ 3321 Circle【模拟】
- zoj 3627#模拟#枚举
- zoj 3643 模拟栈
- ZOJ 1354(枚举,模拟)
- ZOJ 1138(模拟)
- zoj 3683 模拟
- zoj 1005 Jugs (模拟)
- 模拟 zoj 1005 Jugs
- ZOJ 3736 模拟魔方
- ZOJ 3775 ?(>_o)!(模拟)
- [ZOJ 3314] CAPTCHA [模拟]
- ZOJ 3314 CAPTCHA 模拟
- Redis安装、配置、操作、持久化、主从、phpredis扩展安装使用详解之持久化与主从
- VMWare下安装64位虚拟机提示无法执行64位操作?有可能是360的原因
- AIX 系统编译Lzo和Lzop源码
- 全文检索引擎Solr系列—–全文检索基本原理
- Uva1594——Ducci Sequence
- ZOJ 2965 模拟 (A)
- c++调用ado执行带参数的sql(非存储过程)
- 发表第一个博客.
- Android json的使用
- android 动画 amintorset 的使用
- 收集的一些学习ios的好网站
- HQL语句大全(转载)
- 典型的指针笔试题
- Cloud Design Pattern - External Configuration Store(配置外部集中)