|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|1 초||128 MB||40||17||16||41.026%|
Ivan has finally been accepted in university! After an exhausting year of preparation for the entry exams, he was determined to take a big break. Unfortunately the summer vacation was short and wasn’t enough for him to take a proper rest, but he didn’t get disappointed. Ivan had heard that when you are in university it isn’t compulsory to attend to every single lecture. He decided to lengthen his vacation, even though the academic year had started. And so did he!
But, of course, for every plus there is a minus – as well as in secondary schools in every college or university there are exams. More precisely in Ivan’s curriculum there are exactly N exams. They may vary in difficulty, and therefore two exams may give different amount of points. Ivan is not obliged to take all exams, but the points gathered from the tests are important to him, because they are part of his final grade. He quickly realized that he needs at least T points from all exams, so that eventually he has a good grade. He is sure that he can make at least T points after attending to all the exams, but he suspects that there might be different ways to do this. The more ways there are, the more free time he has - Ivan will be able to choose which exam to take and which not to. In this manner he will decide how to distribute his leisure time – for instance which concerts or football matches to visit. Actually Ivan is completely sure in his abilities, so if he takes an exam, he will get the full score. Don’t let Ivan wonder in how many ways he can manage to gather at least T points for too long, but write a program points that finds out this number for him.
The first row of the standard input will contain two positive integers N (N≤ 36) and T. On the next row there are going to be N positive integers, split by a single space, which represent the points of each exam. Every number in the second row will not be greater than 1013.
On the standard output print a single integer – the number of ways in which Ivan can choose which exams to take and which not, so that the sum of the gathered points to be at least T.
4 6 1 2 5 4
There are nine ways in which Ivan can choose which exam to take and which not to, so that the sum of the gathered points to be at least 6: (first and third); (second and third); (first, second and third); (second and fourth); (first, second and fourth); (first, third and fourth); (second, third and fourth); (first, second, third and fourth); (third and fourth).
8 90 1000 2 5 79 12 3 1 3