TOJ 2829.Cow Counting

最新推荐文章于 2022-06-06 14:33:42 发布

暮雨rainy

最新推荐文章于 2022-06-06 14:33:42 发布

阅读量542

点赞数

分类专栏： Toj水题文章标签：水题 toj

本文链接：https://blog.csdn.net/muyujinxi/article/details/52434362

版权

Toj水题专栏收录该内容

87 篇文章 0 订阅

订阅专栏

题目链接：http://acm.tju.edu.cn/toj/showp2829.html

2829. Cow Counting

Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 1146 Accepted Runs: 571 Multiple test files

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?

Input

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

Output

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

Sample Input

10 1

Sample Output

Input Details

Farmer John has 10 cows he needs to label without using the digit 1.

Output Details

The smallest 10 numbers he can use are: 2, 3, 4, 5, 6, 7, 8, 9, 20, and 22.

Source: USACO Open Competition 2007

Submit List Runs Forum Statistics

水题，暴力过

#include <stdio.h>
bool ok(int n,int l){
	while(n){
		if(n%10==l)
			return false;
		n/=10;
	} 
	return true;
}
int main(){
	int n,l;
	while(~scanf("%d%d",&n,&l)){
		int num=1,sum=0;
		while(sum<n){
			if(ok(num,l)){
				num++;
				sum++;
			}
			else
				num++;
		}
		printf("%d\n",num-1);
	}
}