codeforces-550B-Preparing Olympiad
2015-10-26 12:55
281 查看
550B-Preparing Olympiad
[code] time limit per test2 seconds memory limit per test256 megabytes
You have n problems. You have estimated the difficulty of the i-th one as integer ci. Now you want to prepare a problemset for a contest, using some of the problems you’ve made.
A problemset for the contest must consist of at least two problems. You think that the total difficulty of the problems of the contest must be at least l and at most r. Also, you think that the difference between difficulties of the easiest and the hardest of the chosen problems must be at least x.
Find the number of ways to choose a problemset for the contest.
Input
The first line contains four integers n, l, r, x (1 ≤ n ≤ 15, 1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ 106) — the number of problems you have, the minimum and maximum value of total difficulty of the problemset and the minimum difference in difficulty between the hardest problem in the pack and the easiest one, respectively.
The second line contains n integers c1, c2, …, cn (1 ≤ ci ≤ 106) — the difficulty of each problem.
Output
Print the number of ways to choose a suitable problemset for the contest.
input
3 5 6 1
1 2 3
output
2
input
4 40 50 10
10 20 30 25
output
2
input
5 25 35 10
10 10 20 10 20
output
6
Note
In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems.
In the second example, two sets of problems are suitable — the set of problems with difficulties 10 and 30 as well as the set of problems with difficulties 20 and 30.
In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.
题目链接:cf-550B
题目大意:给出n个数,从中选出任意个数字满足条件:1.总和在[l,r]区间内。2.最大值和最小值的差小于等于x
题目思路:暴力+位运算。因为数字最多只有10位,可以暴力2^10种情况,每种情况判断是否满足条件即可
以下是代码:
[code]#include <vector> #include <map> #include <set> #include <algorithm> #include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <string> #include <cstring> using namespace std; int c[20]; int main(){ int n,l,r,x; cin >> n >> l >> r >> x; for (int i = 0; i < n; i++) { cin >> c[i]; } sort(c,c + n); int ans = 0; for (int i = 0; i < pow(2,n); i++) { int temp = 0,m = 99999999,M = -1; for (int j = 0; j < n; j++) { if (i & 1 << j) { temp += c[j]; m = min(m,c[j]); M = max(M,c[j]); } } if (temp >= l && temp <= r && (M - m) >= x) ans++; } cout << ans << endl; return 0; }
相关文章推荐
- libpomelo 增加编译静态库cocos2d-x xcode 工程
- params is error 微信朋友圈分享网页内的外链打不开
- php 和 java RSA 对称加密互通的问题
- PaodingAnalysis 提示 "dic home should not be a file, but a directory"
- 挂起起线程与终止线程的区别
- mysql中如何统计某字段里某个字符的个数
- 区分PATCH与PUT、POST方法
- android源码编译出错(5)
- Codeforces Round #326 (Div. 2)
- DOM - nodeType 的取值
- 2015年浪潮面试题
- 编程之法:面试和算法
- iOS开发工具-网络封包分析工具Charles
- c3p0数据源项目启动卡死
- 最少拦截系统
- 实习之前及实习时的学习计划
- 关于url传参乱码的解决方法以及文件流下载遇见的问题
- Linux下UDP通讯开发
- 使用AJAX直接调用后台方法
- struts2 之配置拦截器使网站页面在session失效后退回到登录页面