WOJ1229-Cow Counting

最新推荐文章于 2020-03-09 11:11:40 发布

暴走777

最新推荐文章于 2020-03-09 11:11:40 发布

阅读量976

点赞数

CC 4.0 BY-SA版权

分类专栏： WOJ

本文链接：https://blog.youkuaiyun.com/LXQ1071717521/article/details/77877564

WOJ 专栏收录该内容

144 篇文章

订阅专栏

农夫约翰要为他的N头牛编号，但牛不喜欢包含数字L的编号。他需要找出最小的一组正整数编号，且这些编号中不包含数字L。问题在于确定约翰必须写在最大编号的牛身上的最大数字是多少。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Farmer John wants to label his N (1 <= N <= 1,000,000) cows, but
cows don't like having the digit L (0 <= L <= 9) written on them,
so he avoids that.

If the cows are labeled with the smallest set of N positive integers
that don't have the digit L, what is the largest number that Farmer
John has to write on any cow?

输入格式

Line 1: Two space-separated integers: N and L.

输出格式

Line 1: A single integer that is the largest number that Farmer John has to write on any cow.

样例输入

10 1

样例输出

#include<stdio.h>
int n,l;
int main(){
	int i,cnt,num,s,flag;
	while(scanf("%d %d",&n,&l)!=EOF){
		cnt=0;
		for(i=1;;i++){
			num=i;
			flag=1;
			while(num>0){
				s=num%10;
				if(s==l){
					flag=0;
					break;
				}
				num=num/10;
			}
			if(flag){
				cnt++;
				if(cnt==n)
				break;
			}
			else
			continue;
		}
		printf("%d\n",i);
	}
	return 0;
}