1027
来源:互联网 发布:遗传算法 交叉概率 编辑:程序博客网 时间:2024/05/17 03:42
#include<stdio.h>#define DEBUG_IO (0)const int MAX = 85;const int INF = 65535;bool isOver = false;int N, M;int answer;int n[MAX];int vis[MAX];void dfs(int m, int step){if(m < 0 || (m > 0 && isOver == true && answer <= step)){return;}if(m == 0){isOver = true;if(answer > step){answer = step;}}if(vis[m] && vis[m] <= step)return;vis[m] = step;for(int i = 0; i < N; i++){dfs(m - n[i], step + 1);}}int main(){#if DEBUG_IO freopen("input.txt", "r", stdin); setbuf(stdout, NULL); #endifint test_case = 0;scanf("%d", &test_case);while(test_case){test_case--;int i;scanf("%d %d", &N, &M);for(i = 0; i < N; i++){scanf("%d", &n[i]);}for(i = 0; i < MAX; i++){vis[i] = 0;}answer = INF;isOver = false;for(i = 0; i < N; i++){dfs(M - n[i], 1);}if(isOver){printf("%d\n", answer);}else{printf("0\n");}}return 0;}
0 0
- 1027
- 1027
- 1027
- 1027
- 1027
- 1027
- 1027
- 1027
- ZOJ 1027
- POJ 1027
- Sicily 1027
- sicily 1027
- sicily 1027
- hdu 1027
- tyvj-1027
- HDU 1027
- pat 1027
- hdu 1027
- Project Euler:Problem 90 Cube digit pairs
- zoj1745 Are We There Yet?
- HDU 3681 Prison Break(状压DP + 二分)
- H.264 基础及 RTP 封包详解
- oracle数据库---sqlplus介绍
- 1027
- JS视频播放
- NYOJ 1057 寻找最大数(三)
- NSString / NSData / char* 类型之间的转换
- linux 之makefile语法学习1
- HDOJ 1213 How Many Tables(并查集)
- 求和
- 【数据库】Truncate的用法
- rdbms迁移到Impala2.0