Commit a2b770b

authored

Update dynamic_programming_templates.cpp

1 parent b8788bd commit a2b770bCopy full SHA for a2b770b

File tree

1 file changed

-10

lines changed

src
- dynamic_programming_templates.cpp

1 file changed

-10

lines changed

`‎src/dynamic_programming_templates.cpp‎`

Lines changed: 6 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,9 +12,7 @@ long long solve(){`
`12`	`12`	`}`
`13`	`13`	`if(!exist[][]){`
`14`	`14`	`long long answer = 0;`
`15`		`- //----type your code here----`
`16`	`15`
`17`		`- //---------------------------`
`18`	`16`	`dp[][] = answer;`
`19`	`17`	`exist[][] = true;`
`20`	`18`	`}`
`@@ -25,8 +23,7 @@ long long solve(){`
`25`	`23`	`* Description: Digit DP`
`26`	`24`	`*/`
`27`	`25`
`28`		`-template<typename T> string toString(T value)`
`29`		`-{`
	`26`	`+template<typename T> string toString(T value){`
`30`	`27`	`string s;`
`31`	`28`	`while (value) {`
`32`	`29`	`s.push_back(value % 10 + '0');`
`@@ -40,8 +37,7 @@ template<typename T> string toString(T value)`
`40`	`37`	`bool exist[][][];`
`41`	`38`	`long long dp[][][];`
`42`	`39`
`43`		`-long long solve(const string &s, int digit, bool bound, )`
`44`		`-{`
	`40`	`+long long solve(const string &s, int digit, bool bound, ){`
`45`	`41`	`if (digit == s.size()) {`
`46`	`42`	`return;`
`47`	`43`	`}`
`@@ -60,8 +56,8 @@ long long solve(const string &s, int digit, bool bound, )`
`60`	`56`
`61`	`57`	`/**`
`62`	`58`	`* Description: Binary exponentiation DP (Non standard)`
`63`		`- * Note: Most of the same target problems can be solved through matrix exponentiation.`
`64`		`- * It helped me once doing a Div2-E (http://codeforces.com/problemset/problem/621/E)`
	`59`	`+ * Note: Most of the same target problems can be solved through matrix exponentiation.`
	`60`	`+ * It helped me once doing a Div2-E (http://codeforces.com/problemset/problem/621/E)`
`65`	`61`	`*/`
`66`	`62`
`67`	`63`	`long long dp[105][105] = {};`
`@@ -105,7 +101,7 @@ long long solve(const string &s, int digit, bool bound, )`
`105`	`101`
`106`	`102`	`/**`
`107`	`103`	`* Description: Bitwise combinatorial DP`
`108`		`- * Note: Target problems include no of pairs (x, y)`
	`104`	`+ * Note: Target problems include no of pairs (x, y)`
`109`	`105`	`such that x <= A, y <= B, (x op y) <= C, where op is a bitwise operator.`
`110`	`106`	`*/`
`111`	`107`
`@@ -157,4 +153,4 @@ int main(){`
`157`	`153`	`scanf("%lld%lld%lld", &a, &b, &c);`
`158`	`154`	`A = toBinaryString(a); B = toBinaryString(b); C = toBinaryString(c);`
`159`	`155`	`printf("%lld\n", solve(0, true, true, true, true));`
`160`		`-}`
	`156`	`+}`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit a2b770b

File tree

1 file changed

1 file changed

`‎src/dynamic_programming_templates.cpp‎`

0 commit comments