Commit 9990d34

authored

Create 3669.Balanced-K-Factor-Decomposition.cpp

1 parent f16e119 commit 9990d34Copy full SHA for 9990d34

File tree

+42

-0

lines changed

DFS/3669.Balanced-K-Factor-Decomposition
- 3669.Balanced-K-Factor-Decomposition.cpp

+42

-0

lines changed

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,42 @@`
	`1`	`+class Solution {`
	`2`	`+ vector<int>divisors;`
	`3`	`+ vector<int>cur;`
	`4`	`+ vector<int>rets;`
	`5`	`+ int bestDiff = INT_MAX/2;`
	`6`	`+public:`
	`7`	`+ void dfs(int idx, int n, int k) {`
	`8`	`+ if (k==1) {`
	`9`	`+ cur.push_back(n);`
	`10`	`+ int diff = cur.back()-cur[0];`
	`11`	`+ if (diff < bestDiff) {`
	`12`	`+ bestDiff = diff;`
	`13`	`+ rets = cur;`
	`14`	`+ }`
	`15`	`+ cur.pop_back();`
	`16`	`+ return;`
	`17`	`+ }`
	`18`	`+`
	`19`	`+ for (int i = idx; i<divisors.size(); i++) {`
	`20`	`+ int d = divisors[i];`
	`21`	`+ if (n%d!=0) continue;`
	`22`	`+ if (n/d < d) break;`
	`23`	`+ cur.push_back(d);`
	`24`	`+ dfs(i, n/d, k-1);`
	`25`	`+ cur.pop_back();`
	`26`	`+ }`
	`27`	`+ }`
	`28`	`+`
	`29`	`+ vector<int> minDifference(int n, int k) {`
	`30`	`+ for (int i=1; i*i<=n; i++) {`
	`31`	`+ if (n%i==0) {`
	`32`	`+ divisors.push_back(i);`
	`33`	`+ if (i*i!=n) divisors.push_back(n/i);`
	`34`	`+ }`
	`35`	`+ }`
	`36`	`+ sort(divisors.begin(), divisors.end());`
	`37`	`+`
	`38`	`+ dfs(0, n, k);`
	`39`	`+`
	`40`	`+ return rets;`
	`41`	`+ }`
	`42`	`+};`

Comments

(0)