题目描述
Given n positive numbers, ZJM can select exactly K of them that sums to S. Now ZJM wonders how many ways to get it!
Input
The first line, an integer T<100, indicates the number of test cases. For each case, there are two lines. The first lin…
话不多说,直接上代码
package com.softeem.wolf.homework21;
import java.io.File;/*** Created by 苍狼* Time on 2021-07-10*/
public class test {public static void main(String[] args) {File file new File("C:\\rep");recusive(file, 0);}//注意:此方法的调…