首页
学习
活动
专区
圈层
工具
发布
首页
学习
活动
专区
圈层
工具
MCP广场
社区首页 >专栏 >【LightOJ】1122 - Digit Count(bfs)

【LightOJ】1122 - Digit Count(bfs)

作者头像
FishWang
发布2025-08-27 11:44:13
发布2025-08-27 11:44:13
18400
代码可运行
举报
运行总次数:0
代码可运行

点击打开题目

1122 - Digit Count

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Given a set of digits S, and an integer n, you have to find how many n-digit integers are there, which contain digits that belong to S and the difference between any two adjacent digits is not more than two.

Input

Input starts with an integer T (≤ 300), denoting the number of test cases.

Each case contains two integers, m (1 ≤ m < 10) and n (1 ≤ n ≤ 10). The next line will contain m integers (from 1 to 9) separated by spaces. These integers form the set S as described above. These integers will be distinct and given in ascending order.

Output

For each case, print the case number and the number of valid n-digit integers in a single line.

Sample Input

Output for Sample Input

3 3 2 1 3 6 3 2 1 2 3 3 3 1 4 6

Case 1: 5 Case 2: 9 Case 3: 9

Note

For the first case the valid integers are

11

13

31

33

66

结果是问有几个符合的结果,那么跑一遍bfs就行了,数据很小,暴力也可以过。

代码如下:

代码语言:javascript
代码运行次数:0
运行
复制
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define CLR(a,b) memset(a,b,sizeof(a))
#define LL long long
#define PI acos(-1.0)
int n,k;
int num[15];
int ans;
void bfs(int x,int m)
{
	if (m == k)
	{
		ans++;
		return;
	}
	for (int i = 1 ; i <= n ; i++)
	{
		if (abs(num[i] - x) <= 2)
			bfs(num[i],m+1);
	}
}
int main()
{
	int u;
	int Case = 1;
	scanf ("%d",&u);
	while (u--)
	{
		scanf ("%d %d",&n,&k);
		for (int i = 1 ; i <= n ; i++)
			scanf ("%d",&num[i]);
		ans = 0;
		for (int i = 1 ; i <= n ; i++)
			bfs(num[i],1);
		printf ("Case %d: ",Case++);
		printf ("%d\n",ans);
	}
	return 0;
}
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2016-09-05,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Input
  • Output
  • Note
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档