브루트포스
-
로또백준알고리즘 2019. 7. 23. 01:32
import java.util.*; public class Main{ public static boolean next_permutation(int[] x){ int i = x.length - 1; while(i > 0 && x[i - 1] = 6) test[i] = 0; else test[i] = 1; } do { for (int i = 0; i < n; i++) { if (test[i] == 1) { System.out.print(set[i] + " "); } } System.out.println(); } while (next_permutation(test)); System.out.println(); } } }
-
1486. 장훈이의 높은 선반SWexpertAcademy 2019. 7. 15. 04:11
#include #include #include using namespace std; int t; int n, b; int g[10000000]; int a[20]; void dfs(int i, int k, int j,int t,vector&result,int temp) { if (temp >= 0) { result.push_back(temp); return; } if (i == t){ if (temp >= 0) { result.push_back(temp); } else return; } else { dfs(i + 1,k + a[i + 1],j,t,result, k - j); dfs(i + 1,k,j,t,result, k - j); } } int main() { cin >> t; for (int alp ..