URAL 1009 K-based Numbers (DFS)

#include <stdio.h>int numOfDigits, base;
int result;void isValid(int digits, int preDigit){if (digits > numOfDigits){result++;return;}int digit;for (digit = 0; digit < base; digit++){if (preDigit == 0 && digit == 0)//剪枝后可以通过continue;isValid(digits + 1, digit);}
}int main(){scanf("%d %d", &numOfDigits, &base);isValid(1, 0);printf("%d\n", result);return 0;
}

URAL 1009 K-based Numbers (DFS)相关推荐

ural 1009 K-based Numbers
1009. K-based Numbers Time limit: 1.0 second Memory limit: 64 MB Let's consider K-based numbers, ...
ural 1009. K-based Numbers - dp
1009. K-based Numbers Let's consider K-based numbers, containing exactlyN digits. We define a number ...
51nod 1268 和为K的组合 dfs
题目: 1268 和为K的组合基准时间限制:1 秒空间限制:131072 KB 分值: 20 难度:3级算法题给出N个正整数组成的数组A,求能否从中选出若干个,使他们的和为K.如果可以,输出:& ...
2412 - 和为K ---深搜dfs剪枝
**2412 - 和为K ---深搜dfs优化 **来源:东方博宜oj oj.czos.cn #include<bits/stdc++.h> using namespace std; co ...
Ural 1009 K-based Numbers
1009. K-based Numbers Time limit: 0.5 second Memory limit: 64 MB Let's considerK-based numbers, cont ...
URAL 1009. K-based Numbers
/*这题貌似就是找规律. f1 = k-1; f2 = k*k - k; f3 = (f1 + f2) * (k-1); //(k-1)表示首位不为0的个数,比如n = 3时, 首位可能是1, 2, ...
Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs
C. Hexadecimal's Numbers 题目连接: http://www.codeforces.com/contest/9/problem/C Description One beautif ...
HDU多校6 - 6831 Fragrant numbers(dfs爆搜+打表)
题目链接:点击查看题目大意:给出一个以 " 1145141919 " 无限循环的字符串,现在可以在合适的位置添加 ' + ' , ' * ' 和 ' ( ' , ' ) ' 将其 ...
LeetCode Lexicographical Numbers(dfs）
问题:给出一个正整数n,要求从 1 到 n 的字典顺序思路:深度优先搜索.如果当前数为0,则从1到9遍历加上当前数*10,进入下一层深度,否则从0到9遍历.如果当前的数大于n,递归退出. 具体代码参 ...

URAL 1009 K-based Numbers (DFS)

URAL 1009 K-based Numbers (DFS)相关推荐

最新文章

热门文章